Reentrant Flow Shops
Hamilton Emmons () and
George Vairaktarakis ()
Additional contact information
Hamilton Emmons: Case Western Reserve University
George Vairaktarakis: Case Western Reserve University
Chapter Chapter 9 in Flow Shop Scheduling, 2013, pp 269-289 from Springer
Abstract:
Abstract We introduce flow shops that revisit certain processors, and define the common patterns of flow: cyclic, chain, hub, and V-shaped. We show that even the simplest case, the (1,2,1)-reentrant shop, is NPhard, establish properties that facilitate a branch-and-bound algorithm, and present two simple but very effective heuristics. With m machines, we give for chain-reentrance simplifying properties, for hub-reentrance a DP based on simplifying assumptions that yet performs well, for Vreentrance a solvable special case. For cyclic production of a single product in the general m-machine reentrant shop, we give an algorithm for finding the efficient frontier between cycle time and flow time, and a heuristic for larger instances. For the hybrid reentrant system, if all jobs require the same time for each production step but have different due dates, dispatching rules are recommended and compared.
Keywords: Cycle Time; Setup Time; Optimal Schedule; Flow Shop; First Come First Serve (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations: View citations in EconPapers (1)
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_9
Ordering information: This item can be ordered from
http://www.springer.com/9781461451525
DOI: 10.1007/978-1-4614-5152-5_9
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 ().