Abstract
This paper considers a generalization of the classical flow shop problem wheren the items, grouped intok fixed sequences (clusters) are processed onm machines. A permutation is being sought that minimizes the completion time of processing all items. This paper develops conditions when the clustered problem can be reduced to a classical case. It also provides sufficient optimality conditions for an approximate solution generated by a method for the two machine clustered problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Das G (1978) Equivalent-jobs for job-blocks for “n-job, 3-machine sequencing problem. Pure and Applied Mathematica Sciences 14:35–40
Johnson SM (1954) Optimal two and three-stage production schedules with setup times included. Naval Research Logistics Quarterly 1:61–68
Kurisu T (1976) Two-machine scheduling under required precedence among jobs. Journal of the Operations Research Society of Japan 19:1–13
Maggu PL, Das G (1977) Equivalent jobs for job blocks in job sequencing. Opsearch 14:277–281
Szwarc W (1978) Flow shop theory revisited. Naval Research Logistics Quarterly 25:557–570
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Szwarc, W. The clustered flow-shop problem. Zeitschrift für Operations Research 32, 315–322 (1988). https://doi.org/10.1007/BF01920301
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01920301