Abstract
This paper generalizes Khurana-Bagga's flow-shop model which involves separated setup times and time lags where no restrictions are imposed on the processing and setup times as well as start and stop lags. It solves the two machine case and provides and approximate solution for the multimachine case. It also shows that Khurana-Bagga's algorithm is restricted to a special case of the two machine problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Johnson SM (1954) Optimal two and three stage production schedules with setup times included. Naval Research Logistics Quarterly 1:61–68
Khurana K, Bagga PC (1984) Minimizing the makespan in a 2-machine flowshop with time lags and setup conditions. Zeitschrift für Operations Research 28:163–174
Szwarc W (1983) Flow shop problems with time lags. Management Science 29:477–481
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Szwarc, W. The flow shop problem with time lags and separated setup times. Zeitschrift für Operations Research 30, B15–B22 (1986). https://doi.org/10.1007/BF01919496
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01919496