Abstract
We start by presenting the basic structure and language of flow shops, and the conventions and notation to be adopted. The concepts of precedence, permutation schedules and when they are optimal, graphic schedule representations, dominance properties, heuristics and error bounds, cyclic shops and other fundamentals are introduced.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Graham, R.L., E.L. Lawler, J.K. Lenstra and A.H.G. Rinnooy Kan (1979) Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey, Annals of Discrete Mathematics, 5, 287–326.
Hall, N.G. and M.E. Posner (2001) Generating Experimental Data for Computational Testing with Machine Scheduling Applications, Operations Research, 49, 854–865.
Johnson, S.M. (1954) Optimal Two- and Three-Stage Production Schedules with Setup Times Included, Naval Research Logistics Quarterly, 1, 61–68.
Yeung, W.-K., C. Oguz and T.-C. E. Cheng (2009) Two-machine Flow Shop Scheduling with a Common Due Window to Minimize Earliness and Tardiness, unpublished manuscript.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media New York
About this chapter
Cite this chapter
Emmons, H., Vairaktarakis, G. (2013). Introduction. In: Flow Shop Scheduling. International Series in Operations Research & Management Science, vol 182. Springer, Boston, MA. https://doi.org/10.1007/978-1-4614-5152-5_1
Download citation
DOI: https://doi.org/10.1007/978-1-4614-5152-5_1
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4614-5151-8
Online ISBN: 978-1-4614-5152-5
eBook Packages: Business and EconomicsBusiness and Management (R0)