• 산업공학
• /
• 제25권3호
• /
• pp.357-364
• /
• 2012

This paper considers a unrelated parallel machine scheduling problem with ready times, due times and sequence and machine-dependent setup times. The objective of this problem is to determine the allocation of jobs and the scheduling of machines to minimize the total tardy time. A mathematical model for optimal solution is derived. An in-depth analysis of the model shows that it is very complicated and difficult to obtain optimal solutions as the problem size becomes large. Therefore, a genetic algorithm using an effective dispatching method is proposed. The performance of the proposed genetic algorithm is evaluated using several randomly generated examples.

• 대한산업공학회지
• /
• 제40권3호
• /
• pp.305-312
• /
• 2014

This research deals with a problem that minimizes makespan in a non-identical parallel machine system with sequence and machine dependent setup times and machine dependent processing times. We first present a new mixed integer programming formulation for the problem, and using this formulation, one can easily find optimal solutions for small problems. However, since the problem is NP-hard and the size of a real problem is large, we propose four heuristic algorithms including genetic algorithm based heuristics to solve the practical big-size problems in a reasonable computational time. To assess the performance of the algorithms, we conduct a computational experiment, from which we found the heuristic algorithms show different performances as the problem characteristics are changed and the simple heuristics show better performances than genetic algorithm based heuristics for the case when the numbers of jobs and/or machines are large.

• 전자공학회논문지S
• /
• 제34S권8호
• /
• pp.27-36
• /
• 1997

In this paper, we propose a locating strategy using a cache based on the distributed call processing stucture. In our stategy, each originating call server, withc is responsible for call setup, has a cache to memorize the service ratio of call server which serves the called terminal.We present performance comparison of the proposed strategy with the existing strategy via simulation. We can reduce the cost for call setup because the originating call server can simpley establish a call without tracing the location of the called terminal. The proposed strategy also reduceds network loads caused by signaling at call setup time and lessens the frequency of queries for the database systems which can be a bottleneck when it serves many subscriber.

• 대한산업공학회지
• /
• 제27권2호
• /
• pp.158-168
• /
• 2001

We present a tabu search (TS) algorithm to minimize maximum lateness on a single machine in the presence of sequence dependent setup times and dynamic job arrivals. The TS algorithm starts with a feasible schedule generated by a modified ATCS (Apparent Tardiness Cost with Setups) rule, then through a series of search steps it improves the initial schedule. Results of extensive computational experiments show that the TS algorithm significantly outperforms a well-known RHP heuristic by Ovacik and Uzsoy, both on the solutions quality and the computation time. The performance advantage is particularly pronounced when there is high competition among jobs for machine capacity.

• Industrial Engineering and Management Systems
• /
• 제11권1호
• /
• pp.114-122
• /
• 2012

This paper considers a non-identical parallel machine scheduling problem with sequence and machine dependent setup times. The objective of this problem is to determine the allocation of jobs and the scheduling of each machine to minimize makespan. A mathematical model for optimal solution is derived. An in-depth analysis of the model shows that it is very complicated and difficult to obtain optimal solutions as the problem size becomes large. Therefore, two meta-heuristics, genetic algorithm (GA) and a new population-based evolutionary meta-heuristic called self-evolution algorithm (SEA), are proposed. The performances of the meta-heuristic algorithms are evaluated through compare with optimal solutions using randomly generated several examples.

• Geomechanics and Engineering
• /
• 제29권2호
• /
• pp.171-182
• /
• 2022

Reusing the used pile has not yet been implemented due to the unpredictability of the bearing capacity evolution. This paper presents an analytic approach to estimate the sides shear setup after the dissipation of pore pressure. Long-term evolution of adjacent soil is simulated by viscoelastic-plastic constitutive model. Then, an innovative concept of quasi-overconsolidation is proposed to estimate the strength changes of surrounding soil. Total stress method (α method) is employed to evaluate the long term bearing capacity. Measured data of test piles in Louisiana and semi-logarithmic time function are cited to validate the effectiveness of the presented method. Comparisons illustrate that the presented approach gives a reasonably prediction of the side shear setup. Both the presented method and experiment show the shaft resistance increase by 30%-50%, and this highlight the potential benefit of piles reutilization.

• 대한산업공학회지
• /
• 제30권2호
• /
• pp.107-119
• /
• 2004

A study on the following parallel machine problem is addressed in this research. An order is completed only when a given number of processes (cycle) are repeated. Anew cycle is possible only upon the completion of the previous cycle. Orders are classified into job group according to product feature. For a machine to switch to a different job group from the currently processing one a major setup is required while a minor setup time is inserted in between two jobs of the same job group. The objective of the study is to find a schedule that minimizes total weighted tardiness. An initial solution is obtained by the RATCS(Restricted Apparent Tardiness Cost with Setup) rule, and a Tabu search is applied to improve the solution. Numerical examples are also presented.

• 한국경영과학회지
• /
• 제18권1호
• /
• pp.119-126
• /
• 1993

We study a manufacturing process that is quite common in semiconductor wafer fabrication of semiconductor chip production. A machine is used to process a job consisting of J wafers. Each job requires a setup, and the i$_{th}$ setup for a job is sucessful with probability P$_{i}$. The setup is prone to failure, which results in the loss of expensive wafers. Therefore, a tiral run is first conducted on a small batch. If the set up is successful, the test is passed and the balance of the job can be processed. If the setup is unsuccessful, the exposed wafers are lost to scrap and the mask is realigned. The process then repeats on the balance of the job. We call this as send-ahead policy and consider general policies in which the number of wafers that are sent shead depend on the cost of the raw wafer, the sequence of success probabilities, and the balance of the job. We model this process and determine the expected number of good wafers per job,the expected time to process a job, and the long run average throughput. An algorithm to minimize the cost per good wafer subject to a demand constraint is provided.d.d.

• 대한전자공학회논문지TC
• /
• 제41권12호
• /
• pp.9-14
• /
• 2004

최근 인터넷 트래픽의 종류 및 크기의 다양화로 인해 광 네트워크의 동적인 경로 설정을 위한 GMPLS(Generalized Multi-Protocol Label Switching) 기반의 트래픽 제어 및 관리 프로토콜이 지속적으로 제안되고 있다. 이에 본 논문에서는 광역정보를 이용한 프로토콜과 지역정보를 이용한 프로토콜을 기반으로 한 네트워크 성능평가를 통해 두 가지 프로토콜의 특성을 비교 분석하였다. 네트워크 성능평가를 위해 변화 정보에 대한 업데이트 주기 및 임계값을 평가 메트릭으로 사용하여 트래픽 발생 율에 따른 연결 설정 시간, 제어신호 요구 대역폭, 경로 설정 블록킹 확률을 산출하였다. 평가된 프로토콜은 미래의 IP네트워크를 위한 광대역 네트워크의 필요조건이며 이는 고속의 백본 네트워크를 만족시키는 솔루션이 될 것으로 사료된다.

• 한국경영과학회지
• /
• 제13권1호
• /
• pp.13-13
• /
• 1988

This paper considers the sequencing problem in mixed model assembly lines with hybrid workstation types and sequence-dependent setup times. Computation time is often a critical factor in choosing a method of determining the sequence. We develop a mathematical formulation of the problem to minimize the overall length of a line, and present a tabu search technique which can provide a near optimal solution in real time. The proposed technique is compared with a genetic algorithm and a branch-and-bound method. Experimental results are reported to demonstrate the efficiency of the technique.