On the connection between a cyclic job shop and a reentrant flow shop scheduling problem
- 111 Downloads
Hall et al. (J. Sched. 2002; 5:307–327) investigated the cycle time minimization problem in a two-machine job shop, where each job consists of at most three operations. In this note, we reduce the problem to a two-machine reentrant flow shop problem and briefly discuss some consequences.
KeywordsJob shop Reentrant flow shop Cycle time Makespan Algorithms and complexity
Unable to display preview. Download preview PDF.
- Lee, T.-E. and M. E. Posner, “Performance measures and schedules in periodic job shops,” Operations Research, 45, 72–91 (1997).Google Scholar
- Steiner, G. and Z. Xue, “On minimizing cycle time in a two-machine job shop,” Working Paper, School of Business, McMaster University, Canada, 2004.Google Scholar