Skip to main content
SpringerLink
Log in

Clustered flow shop models

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

This paper deals with flow-shop models where n items are grouped in fixed sequences, called clusters. The clusters are to be processed on m machines in the same technological order. Each machine handles the clusters in the same order. Each completed item is available for processing on the next machine. The question is how to arrange the clusters to minimize the completion time. Models that include setup times for clusters with identical items are also examined. Approximate solutions along with new lower bounds are presented. Those solutions are optimal for the two machine case.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. G. Das (1978), “Equivalent-Jobs for Job-Blocks for “n-Job, 3-Machine Sequencing Problem,” Pure and Applied Mathematica Sciences, 14, 35–40.

    Google Scholar 

  2. S. M. Johnson (1954), “Optimal Two and Three-Stage Production Schedules with Setup Times Included,” Naval Research Logistics Quarterly, 1, 61–68.

    Google Scholar 

  3. T. Kurisu (1976), “Two-Machine Scheduling Under Required Precedence Among Jobs,” Journal of the Operations Research Society of Japan, 19, 1–13.

    Google Scholar 

  4. T. Kurisu (1977), “Two-Machine Scheduling Under Arbitrary Precedence Constraints,” Journal of the Operations Research Society of Japan, 20, 113–131.

    Google Scholar 

  5. T. Kurisu (1977), “Three-Machine Scheduling Problem with Precedence Constraints,” Journal of the Operations Research Society of Japan, 20, 231–242.

    Google Scholar 

  6. P. L. Maggu and G. Das (1977), “Equivalent Jobs for Job Blocks in Job Sequencing,” Opsearch, 14, 277–281.

    Google Scholar 

  7. P. L. Maggu, G. Das, R. Kumar (1981), “On Equivalent-Job for Job-Block in 2xn Sequencing Problem with Transportation Times,” Journal of the Operations Research Society of Japan, 24, 136–146.

    Google Scholar 

  8. L. G. Mitten (1959), “A Scheduling Problem,” Journal of Industrial Engineering, 10, 131–135.

    Google Scholar 

  9. W. Szwarc (1978), “Special Cases of the Flow-Shop Problem,” Naval Research Logistics Quarterly, 24, 483–492.

    Google Scholar 

  10. W. Szwarc (1978), “Flow Shop Theory Revisited,” Naval Research Logistics Quarterly, 25, 557–570.

    Google Scholar 

  11. W. Szwarc (1983), “Flow Shop Problems with Time Lags,” Management Science, 29, 477–481.

    Google Scholar 

  12. W. Szwarc (1988), “The Clustered Flow-Shop Problem,” Zeitschrift für Operations Research, 32, 315–322.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Business Administration, University of Wisconsin-Milwaukee, 53201, Milwaukee, Wisconsin, U.S.A.

    Wlodzimierz Szwarc

Authors
  1. Wlodzimierz Szwarc
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Szwarc, W. Clustered flow shop models. J Glob Optim 9, 345–356 (1996). https://doi.org/10.1007/BF00121678

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00121678

Keywords

Search

Navigation