Journal of Scheduling

, Volume 9, Issue 4, pp 381–387 | Cite as

On the connection between a cyclic job shop and a reentrant flow shop scheduling problem

  • George SteinerEmail author
  • Zhihui Xue


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.


Job shop Reentrant flow shop Cycle time Makespan Algorithms and complexity 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Drobouchevitch, I. G. and V. A. Strusevich, “A heuristic algorithm for two-machine re-entrant shop scheduling,” Annals of Operations Research, 86, 417–439 (1999).CrossRefGoogle Scholar
  2. Hall, N. G., T.-E. Lee and M. E. Posner, “The complexity of cyclic shop scheduling problems,” Journal of Scheduling, 5, 307–327 (2002).CrossRefGoogle Scholar
  3. Lee, T.-E. and M. E. Posner, “Performance measures and schedules in periodic job shops,” Operations Research, 45, 72–91 (1997).Google Scholar
  4. Lev, V. and I. Adiri, “V-shop scheduling,” European Journal of Operational Research, 18, 51–56 (1984).CrossRefGoogle Scholar
  5. 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
  6. Wang, M. Y., S. P. Sethi and S. L. Van de Velde, “Minimizing makespan in a class of reentrant shops,” Operations Research, 45, 702–712 (1997).CrossRefGoogle Scholar

Copyright information

© Springer Science + Business Media, LLC 2006

Authors and Affiliations

  1. 1.Management Science and Information SystemsMcMaster UniversityHamiltonCanada
  2. 2.Canadian Imperial Bank of CommerceTorontoCanada

Personalised recommendations