• 대한산업공학회지
• /
• 제1권2호
• /
• pp.73-81
• /
• 1975

In an earlier paper ('Scheduling Jobs on a Number of Identical Machines' by Elmaghraby and Park, March 1974, AIIE Transactions) a branch-and-bound algorithm was developed for the sequencing problem when all jobs are available to process at time zero and are independet (i.e., there are not a priori precedence relationships among jobs.). However, the amount of computation required by the algorithm was not considered to be short if more than 50 jobs were processed. As an effort to improve the algorithm, the present paper modifies the implicit enumeration procedure in the algorithm so that moderately large problems can be treated with what appears to be a short computational time. Mainly this paper is concerned with improving the lower bound in the implicit enumeration procedure. The computational experiences with this new branch-and-bound algorithm are given.

• 경영과학
• /
• 제28권3호
• /
• pp.15-29
• /
• 2011

In this paper, we consider a system working at both primary service and secondary service. A server can switch between the primary service and the secondary service or it can be assigned to secondary service as a dedicated server. A service policy is characterized by the number of servers dedicated to the secondary service and a rule for switching the remaining servers between two services. The primary service system is modelled as a Markovian queueing system and the throughput is a function of the number of servers, buffer capacity, and service policy. And the secondary service system has a service level requirement strategically determined to perform the service assigned. There is a revenue obtained from throughput and costs due to servers and buffers. We study the problem of simultaneously determining the optimal total number of servers, buffers, and service policy to maximize profit of the system subject to both an expected customer waiting time constraint of the primary service and a service level constraint of the secondary service and develop an algorithm which can be successfully applied with the small number of computations.

• 한국수자원학회:학술대회논문집
• /
• 한국수자원학회 1993년도 수공학연구발표회논문집
• /
• pp.535-543
• /
• 1993

이 논문의 목적은 기존의 상수도 관망을 개선하는데 있어 어느 관을 교체 또는 재생할 것인가와 펌프용량을 얼마나 늘릴 것인가를 결정함으로써 관망내 각 급수지점에서의 요구유량및 수압을 만족시킴은 물론 그에 드는 비용을 최소화시키는 모델을 개발하는데 있다. 이 논문은 관교체 비용, 세관 및 재생 비용, 관보수 비용, 펌핑 비용, 펌프시설 확충비용 등의 다섯가지 비용들을 비교 검토함으로써 의사결정을 하게 된다. 제약조건식으로는 급수 조건식, 에너지 방정식, 수리학적 방정식, 결정 조건식, 한계 조건식, 정수 조건식 등이 있다. 이 모델을 수식화하면 정수혼합 비선형계획법 (mixed-integer nonlinear programming, MINLP) 문제가 된다. 이 문제를 풀기 위해 비선형해법의 GRG (generalized reduced gradient) 방법과 분기와 한계 (banch and bound) 기법을 통한 implicit enumeration 기법을 접목시키는 방법을 제안하였다.

• International Journal of Reliability and Applications
• /
• 제4권1호
• /
• pp.13-26
• /
• 2003

This paper presents a comparative study of a few commonly used maintenance scheduling methods for small utilities that consists solely of thermal generating plants. Two deterministic methods and a stochastic method are examined. The deterministic methods employ the leveling of reserve capacity criterion, of which one uses a heuristic rule to level the deterministic equivalent load obtained by using the product of the unit capacity and its corresponding forced outage rate. The stochastic method simulates the leveling of risk criterion by using the peak load carry capacity of available units. The results indicate that for the size and type of the maintenance scheduling problem described In this study, the stochastic method does not produce a schedule which is significantly better than the deterministic methods.

• Journal of Information Processing Systems
• /
• 제17권2호
• /
• pp.271-283
• /
• 2021

When generating layout schemes, both the material usage and practicality of the cutting process should be considered. This paper presents a two-section algorithm for generating guillotine-cutting schemes of rectangular blanks. It simplifies the cutting process by allowing only one size of blanks to appear in any rectangular block. The algorithm uses an implicit enumeration and a linear programming optimal cutting scheme to maximize the material usage. The algorithm was tested on some benchmark problems in the literature, and compared with the three types of layout scheme algorithm. The experimental results show that the algorithm is effective both in computation time and in material usage.

• 한국항공운항학회:학술대회논문집
• /
• 한국항공운항학회 2016년도 춘계학술대회
• /
• pp.269-275
• /
• 2016

This paper considers the arrival, airport and departure capacity as a whole, through which, the network effect between airports is fully emphasized, the flight action is coordinated, and the flight demand pattern is reasonably assigned. The optimization problem of flight queues in multi-airport is studied in detail; the mathematical model of multi-airport opening non-real time flow management in terminal area is established, and related problems such as the parameters, the simplification and the solving of the model are discussed in detail to some extent. Appropriate decision making variables are taken to make the multi-airport network system linear 0-1 integer programming model, thus, the solving of the model is available and the central flow management is realized. The heuristic implicit enumeration presented in this paper can effectively solve this kind of problems. Through the simulation of some airports network system, we not only validate the algorithm presented in this paper, but also give a deep analysis of the results, which would produce reference for later practicable use. The simulation proves that this algorithm offers a good way to settle the problem of multi-airport flight queue optimization in air traffic management automation system in terminal area.