Transfer Lags in the Flow Shop

Hamilton Emmons () and George Vairaktarakis ()
Additional contact information
Hamilton Emmons: Case Western Reserve University
George Vairaktarakis: Case Western Reserve University

Chapter Chapter 3 in Flow Shop Scheduling, 2013, pp 67-96 from Springer

Abstract: Abstract We define the types of transfer lags, positive and negative, between stages of a flow shop, and discuss applications (transport times, nonbottleneck machines, manufacturing cells, batch transfers, setup and teardown times, master-slave systems, etc.). We show that the twomachine makespan problem is NP-hard, but that a variety of models can be efficiently solved using the Modified Johnson’s Rule and its extensions when our search is restricted to permutation schedules. We extend the analysis to the two-stage hybrid shop, and then to the m machine shop, for which bounds and heuristics are given. Further results involving transfer lags are given in Chap. 4.

Keywords: Optimal Schedule; Flow Shop; Minimal Makespan; Optimal Makespan; Identical Processor (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-1-4614-5152-5_3

Ordering information: This item can be ordered from
http://www.springer.com/9781461451525

DOI: 10.1007/978-1-4614-5152-5_3

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().