산업경영시스템학회지 (Journal of Korean Society of Industrial and Systems Engineering)
- 제23권56호
- /
- Pages.9-18
- /
- 2000
- /
- 2005-0461(pISSN)
- /
- 2287-7975(eISSN)
Scheduling for a Two-Machine, M-Parallel Flow Shop to Minimize Makesan
- Lee, Dong Hoon (Department of Industrial Engineering, Osaka Prefecture University) ;
- Lee, Byung Gun (Department of Industrial Engineering, Dongseo University) ;
- Joo, Cheol Min (Department of Industrial Engineering, Dongseo University) ;
- Lee, Woon Sik (Department of Industrial Engineering, Pukyong National University)
- 발행 : 2000.05.01
초록
This paper considers the problem of two-machine, M-parallel flow shop scheduling to minimize makespan, and proposes a series of heuristic algorithms and a branch and bound algorithm. Two processing times of each job at two machines on each line are identical on any line. Since each flow-shop line consists of two machines, Johnson's sequence is optimal for each flow-shop line. Heuristic algorithms are developed in this paper by combining a "list scheduling" method and a "local search with global evaluation" method. Numerical experiments show that the proposed heuristics can efficiently give optimal or near-optimal schedules with high accuracy. with high accuracy.