• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.2
• /
• pp.192-203
• /
• 1999

This paper deals with the order release problem for minimizing weighted earliness and tardiness as well as Work In Process (WIP) in dynamic job shop environments. A newly designed hierarchical order release mechanism is developed for efficient real-time control of the earliness/tardiness and WIP. The hierarchical order release mechanism consists of the order release plan and the order release control which is composed of two procedures. The experimental results show that the proposed order release mechanism is superior to other four order release mechanisms under overall simulation conditions of utilization rate, due-date allowances, and earliness/tardiness cost structures. In addition, the difference of total cost among the four dispatching rules is much more reduced in the proposed order release mechanism than in other release mechanisms.

• IE interfaces
• /
• v.11 no.3
• /
• pp.1-13
• /
• 1998

This paper addresses a scheduling scheme for Flexible Flow Shop(FFS) in the case that a factory is a sub-plant of an electronic device manufacturing plant. Under this environment, job orders for the sub-plants in the production route are generated together with job processing time bucket when the customer places orders for final product. The processing time bucket for each job is a duration from possible release date to permissible due date. A sub-plant modeled FFS should schedule these jobs orders within time bucket. Viewing a Printed Circuit Board(PCB) assembly line as a FFS, the developed scheme schedules an incoming order along with the orders already placed on the scheduled. The scheme consists of the four steps, 1)assigning operation release date and due date to each work cells in the FFS, 2)job grouping, 3)dispatching and 4)machine allocation. Since the FFS scheduling problem is NP-complete, the logics used are heuristic. Using a real case, we tested the scheme and compared it with the John's algorithm and other dispatching rules.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1999.04a
• /
• pp.194-198
• /
• 1999

Order Review/Release(ORR) 시스템은 생산계획 시스템과 작업현장간의 연결고리로서, 작업현장으로의 작업투입을 조절하여 작업현장에서의 체류시간과 공정중재고, 리드타임의 변동을 줄여주는 역할을 한다. 그러나, 지금까지의 ORR에 관한 연구들은 ORR의 유효성에 관하여 명확한 결론을 내지 못하고 있다. 일부는 ORR이 작업의 전체 리드타임을 증가시키는 악영향이 있음을 주장하고, 일부는 ORR을 도입함으로써 작업현장에서의 리드타임과 공정중재고가 줄어들고, 안정화될 수 있다고 주장한다. 본 연구는 어떠한 환경에서 Order Release 정책을 도입하는 것이 시스템의 성능향상에 기여할 수 있는 지 확인하는 것을 목적으로 하고, 가상의 Job Shop을 대상으로 시뮬레이션을 수행하였다. 작업장가동률 수준과 생산계획 단계에서의 계획오더 이송간격을 환경분수로 설정하고, 작업현장의 부하를 고려하여 작업투입을 통제하는 다섯 가지 Order Release 정책과 세 가지 우선순위 규칙을 적용하여 실험하였으며, 리드타임, 납기, 공정중재고 등과 관련된 8가지 척도에 대해 각 정책을 평가하였다. 그리고, 계획시스템의 부하평준화 기능이 존재할 때, Order Release 정책의 도입으로 인한 효과가 더 크다는 기존의 연구결과를 검증하기 위해, 부하평준화를 적용하였을 때 Order Release를 통제하지 않는 정책과 통제하는 정책간의 성능향상 차이가 있는지를 확인하는 실험을 수행하였다. 실험결과, ORR 보다는 우선순위규칙이 시스템의 성능을 결정하는 주요 통제정책으로 밝혀졌다. 그러나, 생산계획시스템에서 1주 간격으로 계획오더를 이송할 때는 Order Release 방법을 적용하여 작업현장에서의 평균 리드타임과 리드타임의 변동, 공정중재고가 줄어드는 결과를 보였고, 가동률 수준이 높을수록 ORR 방법간의 차이가 크게 나타났다. 그리고 부하평준화 기능은 Order Release 정책의 유효성에 별 영향을 주지 않는 것으로 나타났다. 결론적으로, Order Release 방법은 우선순위규칙간의 성능차이를 줄이거나, 대체할 수 통제 기법이라기보다는 우선순위규칙을 보완하여 공정중재고와 작업현장에서의 리드타임, 리드타임의 편차를 줄여주는 역할을 한다고 볼 수 있다. 그리고, 계획시스템이 존재하여 계획오더가 일정기간간격으로 이송되는 환경에서 특히 유용하다는 결론을 얻었다.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.24 no.3
• /
• pp.73-82
• /
• 1999

In this paper, we address a single machine non-preemptive n-job scheduling problem to minimize the sum of earliness and tardiness with different release times and due dates. To solve the problem, we propose a genetic algorithm with new crossover and mutation operators to find the job sequencing. For the proposed genetic algorithm, the optimal pair of crossover and mutation rates is investigated. To illustrate the suitability of genetic algorithm, solutions of genetic algorithm are compared with solutions of exhaustive enumeration method in small size problems and tabu search method in large size problems. Computational results demonstrate that the proposed genetic algorithm provides the near-optimal job sequencing in the real world problem.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.27 no.2
• /
• pp.97-109
• /
• 2002

Manufacturing environments in the real world are subject to many sources of change and uncertainty, such as new job releases, job cancellations, a chance in the processing time or start time of some operation. Thus, the realistic scheduling method should Properly reflect these dynamic environment. Based on the release times of jobs, JSSP (Job Shoe Scheduling Problem) can be classified as static and dynamic scheduling problem. In this research, we mainly consider the dynamic JSSP with continually arriving jobs. The goal of this research is to develop an efficient scheduling method based on GA (Genetic Algorithm) to address dynamic JSSP. we designed scheduling method based on SGA (Sing1e Genetic Algorithm) and PGA (Parallel Genetic Algorithm) The scheduling method based on GA is extended to address dynamic JSSP. Then, This algorithms are tested for scheduling and rescheduling in dynamic JSSP. The results is compared with dispatching rule. In comparison to dispatching rule, the GA approach produces better scheduling performance.

• Journal of Korean Institute of Industrial Engineers
• /
• v.35 no.4
• /
• pp.218-225
• /
• 2009

This paper considers a parallel-machine scheduling problem with job release times and sequence-dependent setup times. The objective of this problem is to determine the allocation policy of jobs and the scheduling policy of machines so as to minimize the weighted sum of setup times, delay times, and tardy times. A mathematical model for optimal solution is derived and a meta heuristic algorithm based on the improved ant colony system is proposed in this paper. The performance of the meta heuristic algorithm is evaluated through compare with optimal solutions using randomly generated several examples.

• Journal of Korean Institute of Industrial Engineers
• /
• v.27 no.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.

• Journal of Korean Institute of Industrial Engineers
• /
• v.15 no.2
• /
• pp.11-22
• /
• 1989

The problem of scheduling n-jobs on m-uniform parallel machines is considered, in which each job has a release time, a deadline, and a processing requirement. The job processing requirements are allocated to the machines so that the maximum of the load differences between time periods is minimized. Based on Federgruen's maximum flow network model to find a feasible schedule, a polynomially bounded algorithm is developed. An example to show the effectiveness of our algorithm is presented.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 1998.03a
• /
• pp.209-213
• /
• 1998

This study considers flowshop scheduling problem related to flexible maufacturing cell in which consists of two machining centers, robots for loading/unloading, and an automated guided vehicle(AGV) for material handling between two machining centers. Because no machinng center has buffer storage for work in process, a machining center can not release a finished job until the empty AGV is available at that machining center. While the AGV cannot tranfer an unfinished job to a machining center until the machining center empty. In this paper, an new heuristic algorithm is given to find the sequence that minimize their makespan.

• IE interfaces
• /
• v.12 no.4
• /
• pp.617-624
• /
• 1999

In order to maximize an availability of machine and utilization of space, the parallel machines scheduling problem with space limit is frequently discussed in the industrial field. In this paper, we consider a scheduling problem for assembly machine in ship engine assembly shop. This paper considers the parallel machine scheduling problem in which n jobs having different release times, due dates and space limits are to be scheduled on m parallel machines. The objective function is to minimize the sum of earliness and tardiness. To solve this problem, a heuristic is developed. The proposed heuristic is divided into three modules hierarchically: job selection, machine selection and job sequencing, solution improvement. To illustrate its effectiveness, a proposed heuristic is evaluated with a large number of randomly generated test problems based on the field situation. Through the computational experiment, we determine the job selection rule that is suitable to the problem situation considered in this paper and show the effectiveness of our heuristic.