Flow Shops and Flexible Flow Shops (Deterministic)

Michael L. Pinedo
Additional contact information
Michael L. Pinedo: NYU Stern School of Business, IOMS Dept Rm 8-59 KMC

Chapter Chapter 6 in Scheduling, 2016, pp 151-181 from Springer

Abstract: Abstract In many manufacturing and assembly facilities each job has to undergo a series of operations. Often, these operations have to be done on all jobs in the same order implying that the jobs have to follow the same route. The machines are then assumed to be set up in series and the environment is referred to as a flow shop.

Keywords: Optimal Schedule; Travelling Salesman Problem; Flow Shop; Total Completion Time; Total Weighted Completion Time (search for similar items in EconPapers)
Date: 2016
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:sprchp:978-3-319-26580-3_6

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

DOI: 10.1007/978-3-319-26580-3_6

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().