Skip to main content
SpringerLink
Log in

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

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • 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).

    Article  Google Scholar 

  • Hall, N. G., T.-E. Lee and M. E. Posner, “The complexity of cyclic shop scheduling problems,” Journal of Scheduling, 5, 307–327 (2002).

    Article  Google Scholar 

  • Lee, T.-E. and M. E. Posner, “Performance measures and schedules in periodic job shops,” Operations Research, 45, 72–91 (1997).

    Google Scholar 

  • Lev, V. and I. Adiri, “V-shop scheduling,” European Journal of Operational Research, 18, 51–56 (1984).

    Article  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 

  • 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).

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Management Science and Information Systems, McMaster University, Hamilton, Ontario, L8S 4M4, Canada

    George Steiner & Zhihui Xue

  2. Canadian Imperial Bank of Commerce, Toronto, Ontario, Canada

    Zhihui Xue

Authors
  1. George Steiner
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhihui Xue
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to George Steiner.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Steiner, G., Xue, Z. On the connection between a cyclic job shop and a reentrant flow shop scheduling problem. J Sched 9, 381–387 (2006). https://doi.org/10.1007/s10951-006-7041-z

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-006-7041-z

Keywords

Search

Navigation