Skip to main content
SpringerLink
Log in

A review and classification of heuristics for permutation flow-shop scheduling with makespan objective

  • Review
  • Published:
Journal of the Operational Research Society

Abstract

Makespan minimization in permutation flow-shop scheduling is an operations research topic that has been intensively addressed during the last 40 years. Since the problem is known to be NP-hard for more than two machines, most of the research effort has been devoted to the development of heuristic procedures in order to provide good approximate solutions to the problem. However, little attention has been devoted to establish a common framework for these heuristics so that they can be effectively combined or extended. In this paper, we review and classify the main contributions regarding this topic and discuss future research issues.

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

Figure 1

Similar content being viewed by others

References

  • Graham RL, Lawler EL, Lenstra JK and Rinnooy Kan AHG (1979). Optimisation and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5: 287–326.

    Article  Google Scholar 

  • Dudek RA and Teuton OF (1964). Development of m stage decision rule for scheduling n jobs through m machines. Opns Res 12: 471–497.

    Article  Google Scholar 

  • Szwarc W (1971). Elimination methods in the m × n sequencing problem. Naval Res Logist 18: 295–305.

    Article  Google Scholar 

  • Lageweg BJ, Lenstra JK and Rinnooy Kan AHG (1978). A general bounding scheme for the permutation flowshop problem. Opns Res 26: 53–67.

    Article  Google Scholar 

  • Potts CN (1980). An adaptive branching rule for the permutation flowshop problem. Eur J Opl Res 5: 19–25.

    Article  Google Scholar 

  • Carlier J and Rebaï I (1996). Two branch and bound algorithms for the permutation flowshop problem. Eur J Opl Res 90: 238–251.

    Article  Google Scholar 

  • Garey MR, Johnson DS and Sethi R (1976). The complexity of flowshop and jobshop scheduling. Math Opns Res 1: 117–129.

    Article  Google Scholar 

  • Rinnooy Kan AHG (1976). Machine Scheduling Problems. Martinus Nijhoff: The Hague.

    Google Scholar 

  • Gupta JND (1971). Flowshop scheduling via sorting analogy. UARI Research Report No. 109, University of Alabama in Huntsville, USA.

    Google Scholar 

  • Pinedo M (1995). Scheduling: Theory, Algorithms and Systems. Prentice-Hall: Englewood Cliffs, NJ.

    Google Scholar 

  • Lourenço HR (1996). Sevast'yanov's algorithm for the flow-shop scheduling problem. Eur J Opl Res 91: 176–189.

    Article  Google Scholar 

  • Gupta JND (1979). A review of flowshop scheduling research. In: Ritzman LP, Krajewski LJ, Berry WL, Goodman SM, Hardy ST, Vitt LD (eds). Disaggregation Problems in Manufacturing and Service Operations. Martin Nijhoff Publishers, The Hague, Netherlands, pp 363–388.

    Google Scholar 

  • King JR and Spachis AS (1980). Heuristics for flow-shop scheduling. Int J Prod Res 18: 345–357.

    Article  Google Scholar 

  • Park YB, Pegden CD and Enscore EE (1984). A survey and evaluation of static flowshop scheduling heuristic. Int J Prod Res 22: 127–141.

    Article  Google Scholar 

  • Widmer M and Hertz A (1991). A new heuristic method for the flow-shop sequencing problem. Eur J Opl Res 41: 186–193.

    Article  Google Scholar 

  • Moccellin JV (1995). A new heuristic method for the permutation flow-shop scheduling problem. J Opl Res Soc 46: 883–886.

    Article  Google Scholar 

  • Nawaz M, Enscore EE and Ham I (1983). A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega-Int J Mngt Sci 11: 91–95.

    Article  Google Scholar 

  • Palmer DS (1965). Sequencing jobs through a multistage process in the minimum total time: a quick method of obtaining a near-optimum. Opns Res Quart 16: 101–107.

    Article  Google Scholar 

  • Campbell HG, Dudek RA and Smith ML (1970). A heuristic algorithm for the n-job, m-machine sequencing problem. Mngt Sci 16: B630–B637.

    Article  Google Scholar 

  • Gupta JND (1971). A functional heuristic for the flow-shop scheduling problem. Opns Res Quart 22: 39–47.

    Article  Google Scholar 

  • Gupta JND (1968). Heuristic rules for n × m flowshop scheduling problem. Opsearch (India) 5: 165–170.

    Google Scholar 

  • Gupta JND (1972). Heuristic algorithms for multistage flowshop scheduling problem. AIIE Trans 4: 11–18.

    Article  Google Scholar 

  • Röck H and Schmidt G (1983). Machine aggregation heuristics in shop-scheduling. Methods Opl Res 45: 303–314.

    Google Scholar 

  • Page ES (1961). An approach to the scheduling of jobs on machines. J R Stat Soc 24: 484–492.

    Google Scholar 

  • Morton TE and Pentico DW (1993). Heuristic Scheduling Systems. Wiley: New York.

    Google Scholar 

  • Ashour S (1967). A decomposition approach for the machine scheduling problem. Int J Prod Res 6: 109–122.

    Article  Google Scholar 

  • Ashour S (1970). A modified decomposition algorithm for scheduling problems. Int J Prod Res 8: 281–284.

    Article  Google Scholar 

  • Gupta JND and Maykut AR (1973). Flow-shop scheduling by heuristic decomposition. Int J Prod Res 11: 105–111.

    Article  Google Scholar 

  • Averbakh I and Berman O (1999). A simple heuristic for m-machine flow-shop and its applications in routing-scheduling problems. Opns Res 47: 165–170.

    Article  Google Scholar 

  • Azim MA, Moras RG and Smith ML (1989). Antithetic sequences in flow shop scheduling. Comput Indust Eng 17: 353–358.

    Article  Google Scholar 

  • Hundal TS and Rajgopal J (1988). An extension of Palmer heuristic for the flow shop scheduling problem. Int J Prod Res 26: 1119–1124.

    Article  Google Scholar 

  • Gupta JND (1976). A heuristic algorithm for the flowshop scheduling problem. RAIRO Rech Opér 10: 63–73.

    Google Scholar 

  • Bonney MC and Gundry SW (1976). Solutions to the constrained flowshop sequencing problem. Opns Res Quart 27: 869–883.

    Article  Google Scholar 

  • Koulamas C (1998). A new constructive heuristic for the flowshop scheduling problem. Eur J Opl Res 105: 66–71.

    Article  Google Scholar 

  • Burns F and Rooker J (1976). Johnson's three machine flow-shop conjecture. Opns Res 24: 578–580.

    Article  Google Scholar 

  • Johnson SM (1954). Optimal two- and three-stage production schedule with setup times included. Naval Res Logist 1: 61–68.

    Article  Google Scholar 

  • Dannenbring DG (1977). An evaluation of flow-shop sequence heuristics. Mngt Sci 23: 1174–1182.

    Article  Google Scholar 

  • Selim SZ and Al-Turki UM (1987). A new heuristic algorithm for the flowshop problem. In: Kusiak A (ed). Modern Production Management Systems. Elsevier Science, Amsterdam, pp 91–96.

    Google Scholar 

  • Lai T (1996). A note on heuristics of flow-shop scheduling. Opns Res 44: 648–652.

    Article  Google Scholar 

  • Gupta JND (1968). Travelling salesman problem—a survey of theoretical developments and applications. Opsearch (India) 5: 181–192.

    Google Scholar 

  • Stinson JP and Smith W (1982). A heuristic programming procedure for sequencing the static flowshop. Int J Prod Res 20: 753–764.

    Article  Google Scholar 

  • Stinson JP (1977). A heuristic algorithm for obtaining an initial solution for the travelling salesman problem. Working Paper 77-12, School of Management, Syracuse University.

    Google Scholar 

  • Sevast'janov S (1995). Vector summation in Banach space and polynomial algorithms for flow shops and open shops. Math Opns Res 20: 90–103.

    Article  Google Scholar 

  • Lawler EL, Lenstra JK, Rinnooy Kan AHG and Shmoys DB (1993). Sequencing and scheduling: algorithms and complexity. In: Graves SC, Rinnooy Kan AHG and Zipkin PH (eds). Logistics of Production and Inventor. North-Holland, Amsterdam, pp 445–522.

    Chapter  Google Scholar 

  • Sarin S and Lefoka M (1993). Scheduling heuristic for the n-job m-machine flow shop. Omega-Int J Mngt Sci 21: 229–234.

    Article  Google Scholar 

  • Aggarwal SC and Stafford E (1975). A heuristic algorithm for the flowshop problem with a common sequence on all machines. Dec Sci 6: 237–251.

    Article  Google Scholar 

  • Woo DS and Yim HS (1998). A heuristic algorithm for mean flowtime objective in flowshop scheduling. Comput Opns Res 25: 175–182.

    Article  Google Scholar 

  • McCormick ST, Pinedo ML, Shenker S and Wolf B (1989). Sequencing in an assembly line with blocking to minimize cycle time. Opns Res 37: 925–936.

    Article  Google Scholar 

  • Sridhar J and Rajendran C (1996). Scheduling in flowshop an cellular manufacturing systems with multiple objectives—a genetic algorithmic approach. Prod Plan Control 7: 374–382.

    Article  Google Scholar 

  • Rajendran C (1993). Heuristic algorithm for scheduling in a flowshop to minimise total flowtime. Int J Prod Econ 29: 65–73.

    Article  Google Scholar 

  • Taillard E (1990). Some efficient heuristic methods for the flow-shop sequencing problem. Eur J Opl Res 47: 65–74.

    Article  Google Scholar 

  • Gupta JND and Maykut AR (1973). Heuristic algorithms for scheduling n jobs in a flowshop. J Opl Res Soc Japan 16: 131–150.

    Google Scholar 

  • Nowicki E and Smutnicki C (1996). A fast tabu search algorithm for the permutation flow-shop problem. Eur J Opl Res 91: 160–175.

    Article  Google Scholar 

  • Stützle T (1998). An ant approach for the flow shop problem. ELITE Foundation (ed). Proceedings of EUFIT'98 Aachen, Germany. Verlag Mainz, Aachen, Germany, pp. 1560–1564.

  • Ho JC and Chang YL (1991). A new heuristic for the n-job, m-machine flow-shop problem. Eur J Opl Res 52: 194–202.

    Article  Google Scholar 

  • Osman IH and Potts CN (1989). Simulated annealing permutation flow-shop scheduling. Omega-Int J Mngt Sci 17: 551–557.

    Article  Google Scholar 

  • Ogbu FA and Smith DK (1990). The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problem. Comput Opns Res 17: 243–253.

    Article  Google Scholar 

  • Ogbu FA and Smith DK (1991). Simulated annealing algorithm for the permutation flowshop problem. Omega-Int J Mngt Sci 19: 64–67.

    Article  Google Scholar 

  • Zegordi SH, Itoh K and Enkawa T (1995). Minimizing makespan for flow-shop scheduling by combining simulated annealing with sequencing knowledge. Eur J Opl Res 85: 515–531.

    Article  Google Scholar 

  • Grabowski J and Pempera J (2001). New block properties for the permutation flow shop problem with application in TS. J Opl Res Soc 52: 210–220.

    Article  Google Scholar 

  • Reeves CR (1995). A genetic algorithm for flowshop sequencing. Comput Opns Res 22: 5–13.

    Article  Google Scholar 

  • Murata T, Ishibuchi H and Tanaka H (1996). Genetic algorithms for flowshop scheduling problems. Comput Indust Eng 30: 1061–1071.

    Article  Google Scholar 

  • Reeves CR and Yamada T (1998). Genetic algorithms, path relinking and the flowshop sequencing problem. Evol Comput 6: 230–234.

    Article  Google Scholar 

  • Chen CL, Vempati VS and Aljaber N (1995). An application of genetic algorithms for flow shop problem. Eur J Opl Res 80: 389–396.

    Article  Google Scholar 

  • Werner F (1993). On the heuristic solution of the permutation flow shop problem by path algorithms. Comput Opns Res 20: 707–722.

    Article  Google Scholar 

  • Turner S and Booth D (1987). Comparison of heuristics for flowshop sequencing. Omega-Int J Mngt Sci 15: 75–85.

    Article  Google Scholar 

  • Smith AW and Stafford EF (1980). A comparison of multiple criteria solutions of large-scale flow-shop scheduling problems. American Institute of Decision Science (ed). AIDS 1980 Proceedings, Vol. 2. American Institute of Decision Science, Las Vegas, NV, pp. 35–37.

    Google Scholar 

  • Framinan JM, Leisten R and Rajendran C (2003). Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem. Int J Prod Res 41: 121–148.

    Article  Google Scholar 

  • Amar AD and Gupta JND (1986). Simulated versus real life data in testing the efficiency of scheduling algorithms. IIE Trans 18: 16–25.

    Article  Google Scholar 

  • Conway RW, Maxwell WL and Miller LW (1967). Theory of Scheduling. Addison-Wesley: Reading, MA.

    Google Scholar 

  • Watson JP, Barbulescu L, Whitley LD and Howe AE (2002). Contrasting structured and random permutation flow-shop scheduling problems: search space topology and algorithm performance. INFORMS J Comput 14: 98–123.

    Article  Google Scholar 

  • Taillard E (1993). Benchmark for basic scheduling problems. Eur J Opl Res 64: 278–285.

    Article  Google Scholar 

  • Bestwick P and Hastings N (1976). A new bound for machine scheduling. Opns Res Quart 27: 479–487.

    Article  Google Scholar 

  • Lahiri S, Rajendran C and Narendran TT (1993). Evaluation of heuristics for scheduling in a flowshop: a case study. Prod Plan Control 4: 153–158.

    Article  Google Scholar 

  • Reeves CR (1993). Improving the efficiency of tabu search for machine sequencing problem. J Opl Res Soc 44: 375–382.

    Article  Google Scholar 

  • Reeves CR (1999). Landscapes, operators and heuristic search. Ann Opns Res 86: 473–490.

    Article  Google Scholar 

Download references

Acknowledgements

The authors are grateful to the anonymous referees for a thorough and ameliorating review. The work of the first author has been supported by CICYT Project DPI-2001-3110.

Author information

Authors and Affiliations

  1. University of Seville, Spain

    J M Framinan

  2. University of Alabaman in Huntsville, AL, USA

    J N D Gupta

  3. University of Duisburg-Essen in Duisburg, Germany

    R Leisten

Authors
  1. J M Framinan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J N D Gupta
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. R Leisten
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to J M Framinan.

Additional information

The online version of the erratum article can be found at 10.1057/palgrave.jors.2601887

Rights and permissions

Reprints and permissions

About this article

Cite this article

Framinan, J., Gupta, J. & Leisten, R. A review and classification of heuristics for permutation flow-shop scheduling with makespan objective. J Oper Res Soc 55, 1243–1255 (2004). https://doi.org/10.1057/palgrave.jors.2601784

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1057/palgrave.jors.2601784

Keywords

Search

Navigation