Abstract
This paper considers the most general type of “network” flow shop in which jobs pass through several stages, each of which is composed on one or more identical processors. Jobs are processed on any one of the processors at each stage in ascending order of stage numbers and the objective is minimization of makespan. The class of shops considered is characterized by prohibited in-process inventory and slightly restricted job ordering per processor. Originally designed for the scheduling of nylon polymerization, the algorithms developed in the paper have numerous applications, especially in the chemical processes and petrochemical production areas.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1973 Springer-Verlag Berlin · Heidelberg
About this paper
Cite this paper
Salvador, M.S. (1973). A Solution to a Special Class of Flow Shop Scheduling Problems. In: Elmaghraby, S.E. (eds) Symposium on the Theory of Scheduling and Its Applications. Lecture Notes in Economics and Mathematical Systems, vol 86. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-80784-8_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-80784-8_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06437-4
Online ISBN: 978-3-642-80784-8
eBook Packages: Springer Book Archive