Skip to main content
SpringerLink
Log in

A cyclical search for the two machine flow shop and open shop to minimise finishing time

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

Abstract

This paper considers scheduling problems on two machines to minimise the makespan. It shows that a simple cyclical search can find a flow shop schedule with one job omitted with makespan less than or equal to the maximum of the total processing time of all jobs on either machine. This flow shop schedule is used as the basis for constructing a number of schedules with minimum makespan for the two machine open shop. The search may be applied unchanged to batches of jobs to provide more optimal schedules.

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

References

  • de Werra, D. (1989). Graph-theoretical models for preemptive scheduling. In R. Slowinski & J. Weglarz (Eds.), Advances in project scheduling (pp. 171–185). Amsterdam: Elsevier.

  • Gonzalez, T., & Sahni, S. (1976). Open shop scheduling to minimize finish time. J Assoc Comput Mach, 23, 665–679.

    Google Scholar 

  • Gribkovskaia, I. V., Lee, C.-Y., Strusevich, V. A., & de Werra, D. (2006). Three is easy, two is hard: open shop sum-batch scheduling problem refined. Oper Res Lett, 34, 459–464.

    Google Scholar 

  • Johnson, S. M. (1954). Optimal two- and three-stage production schedules with setup times included. Naval Res Logist Quart, 1, 61–68.

    Article  Google Scholar 

  • Pinedo, M., & Schrage, L. (1982). Stochastic shop scheduling a survey. In M. A. H. Dempster, E. L. Lawler, J. K. Lenstra, & A. H. G. Rinnooy Kan (Eds.), Deterministic and stochastic scheduling (pp. 181–196). Dordrecht: Riedel.

    Chapter  Google Scholar 

Download references

Acknowledgments

The author is grateful for the comments of the reviewer for helping to improve the presentation of this manuscript.

Author information

Authors and Affiliations

  1. School of Computing and Mathematical Sciences, University of Greenwich, Old Royal Naval College, Park Row, Greenwich, London, SE10 9LS, UK

    Alan J. Soper

Authors
  1. Alan J. Soper
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alan J. Soper.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Soper, A.J. A cyclical search for the two machine flow shop and open shop to minimise finishing time. J Sched 18, 311–314 (2015). https://doi.org/10.1007/s10951-013-0356-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-013-0356-7

Keywords

Search

Navigation