Skip to main content
SpringerLink
Log in

Lot streaming in the two-machine flow shop with setup times

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

The lot streaming model can sometimes be analyzed as a variation of the basic flow shop model. In this paper, we consider the lot streaming model with setup times, transfer lots of size one, and makespan objective. We show how to harness existing theory for time lags and setup times in the two-machine flow shop to analyze the lot streaming case. Extensions to more than two machines are also discussed.

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

  1. H.G. Campbell, R.A. Dudek and M.L. Smith, A heuristic algorithm for then job,m machine sequencing problem, Manag. Sci. 16(1970)630–637.

    Google Scholar 

  2. F.C. Cetinkaya and M.S. Kayaligil, Unit sized transfer batch scheduling with setup times, Comp. Ind. Eng. 22(1992)177–183.

    Google Scholar 

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

    Google Scholar 

  4. S.M. Johnson, Discussion: Sequencingn jobs on two machines with arbitrary time lags, Manag. Sci. 5(1959)299–303.

    Google Scholar 

  5. B.J. Lageweg, J.K. Lenstra and A.H.G. Rinnooy Kan, A general bounding scheme for the permutation flow shop, Oper. Res. 26(1978)53–67.

    Google Scholar 

  6. L.G. Mitten, Sequencingn jobs on two machines with arbitrary time lags, Manag. Sci. 5(1958)293–303.

    Google Scholar 

  7. C.L. Monma and A.H.G. Rinnooy Kan, A concise survey of efficiently solvable special cases of the permutation flow shop problem, RAIRO Recherche operationelle/Operations Research 17(1983)105–119.

    Google Scholar 

  8. C.N. Potts and K.R. Baker, Flow shop scheduling with lot streaming, Oper. Res. Lett. 8(1989)297–303.

    Google Scholar 

  9. A.H.G. Rinnooy Kan,Machine Scheduling Problems: Classification, Complexity and Computations (Nijhoff, The Hague, 1976).

    Google Scholar 

  10. A.J.M. Smits and K.R. Baker, An experimental investigation of the occurrence of special cases in the three-machine flowshop problem, Int. J. Prod. Res. 19(1981)737–741.

    Google Scholar 

  11. D. Trietsch and K.R. Baker, Basic techniques for lot streaming, Oper. Res. 41(1993)1065–1076.

    Google Scholar 

  12. R.G. Vickson, Optimal lot streaming with setup times in a two-machine flow shop, Technical Paper 198-MS-1993, Department of Management Sciences, University of Waterloo (1993).

  13. R.G. Vickson and B.E. Alfredsson, Two and three machine flow shop scheduling problems with equal sized transfer batches, Int. J. Prod. Res. 30(1992)1551–1574.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Amos Tuck School of Business Administration, Dartmouth College, 03755, Hanover, NH, USA

    Kenneth R. Baker

Authors
  1. Kenneth R. Baker
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Baker, K.R. Lot streaming in the two-machine flow shop with setup times. Ann Oper Res 57, 1–11 (1995). https://doi.org/10.1007/BF02099687

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02099687

Keywords

Search

Navigation