Skip to main content
SpringerLink
Log in

A constructive heuristic for minimizing makespan in no-wait flow shop scheduling

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

This paper presents a new constructive heuristic, based on the principle of job insertion, for minimizing makespan in no-wait permutation flow shop scheduling problems. Empirical results demonstrate the superiority of the proposed approach over four of the best-known methods in the literature. Analytical expressions for the total number of partial and complete sequences generated by the algorithms are derived. Statistical tests of significance substantiate the improvement in solution quality.

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. Hall NG, Sriskandarajah C (1996) A survey of machine scheduling problems with blocking and no-wait in process. Oper Res 44:510–525

    Article  MATH  MathSciNet  Google Scholar 

  2. Rajendran C, Chaudhuri D (1990) Heuristic algorithms for continuous flow shop problem. Nav Res Logist 37:695–705

    Article  MATH  Google Scholar 

  3. Aldowaisan T (2001) A new heuristic and dominance relations for no-wait flow shops with setups. Comput Oper Res 28:563–584

    Article  MATH  Google Scholar 

  4. Aldowaisan T, Allahverdi A (1998) Total flowtime in no-wait flow shops with setup times. Comput Oper Res 25:757–765

    Article  MATH  Google Scholar 

  5. Aldowaisan T, Allahverdi A (2004) A new heuristic for m-machine no-wait flow shop to minimize total completion time. Omega 32:345–352

    Article  Google Scholar 

  6. Allahverdi A, Aldowaisan T (2000) No-wait and separate setup three-machine flow shop with total completion time criterion. Int Trans Oper Res 7:245–264

    Article  MathSciNet  Google Scholar 

  7. Allahverdi A, Aldowaisan T (2001) Minimizing total completion time in a no-wait flow shop with sequence dependent additive changeover times. J Oper Res Soc 52:449–462

    Article  MATH  Google Scholar 

  8. Adiri I, Pohoryles D (1982) Flow shop/no-idle or no-wait scheduling to minimize the sum of completion times. Nav Res Logist 29:495–504

    Article  MATH  MathSciNet  Google Scholar 

  9. Kumar A, Prakash A, Shankar R, Tiwari MK (2006) Psycho-clonal algorithm based approach to solve continuous flow shop scheduling problem. Expert Syst Appl 31:504–514

    Article  Google Scholar 

  10. Bertolissi E (2000) Heuristic algorithm for scheduling in the no-wait flow-shop. J Mater Process Technol 107:459–465

    Article  Google Scholar 

  11. van der Veen JAA, van dal R (1991) Solvable cases of the no-wait flow shop scheduling problem. J Oper Res Soc 42:971–980

    MATH  Google Scholar 

  12. Chen C, Neppalli RV, Aljaber N (1996) Genetic algorithms applied to the continuous flow shop problem. Comput Ind Eng 30:919–929

    Article  Google Scholar 

  13. Reddi SS, Ramamoorthy CV (1972) On the flow shop sequencing problem with no-wait in process. Oper Res Q 23:323–331

    Article  MATH  Google Scholar 

  14. Wismer DA (1972) Solution of the flow shop-scheduling with no intermediate queues. Oper Res 29:689–697

    Article  Google Scholar 

  15. Bonney MC, Gundry SW (1976) Solutions to the constrained flow shop sequencing problem. Oper Res Q 24:869–883

    Article  Google Scholar 

  16. King JR, Spachis AS (1980) Heuristics for flow shop scheduling. Int J Prod Res 18:343–357

    Google Scholar 

  17. Rajendran C (1994) A no-wait flow shop scheduling heuristic to minimize makespan. J Oper Res Soc 45:472–478

    Article  MATH  Google Scholar 

  18. Gangadharan R, Rajendran C (1993) Heuristic algorithms for scheduling in no-wait flow shop. Int J Prod Econ 32:285–290

    Article  Google Scholar 

  19. Aldowaisan T, Allahverdi A (2003) New heuristics for no-wait flow shops to minimize makespan. Comput Oper Res 30:1219–1231

    Article  MATH  Google Scholar 

  20. Grabowski J, Pempera J (2007) The permutation flow shop problem with blocking. Omega 35:302–311

    Article  Google Scholar 

  21. Glover F (1989) Tabu search: Part I. ORSA J Comput 1:190–206

    MATH  MathSciNet  Google Scholar 

  22. Glover F (1990) Tabu search: Part II. ORSA J Comput 2:4–32

    MATH  Google Scholar 

  23. Schuster CJ, Framinan JM (2003) Approximate procedures for no-wait job shop scheduling. Oper Res Lett 31:308–318

    Article  MATH  MathSciNet  Google Scholar 

  24. Hansen P, Mladenovic N (2001) Variable neighborhood search: Principles and applications. Eur J Oper Res 130:449–467

    Article  MATH  MathSciNet  Google Scholar 

  25. Wang L, Zheng D (2001) An effective hybrid optimization strategy for job-shop scheduling problems. Comput Oper Res 28:585–596

    Article  MATH  MathSciNet  Google Scholar 

  26. Guinet A, Legrand M (1998) Reduction of job-shop problems to flow-shop problems with precedence constraints. Eur J Oper Res 109:96–110

    Article  MATH  Google Scholar 

  27. Carlier J (1978) Ordonnancements a contraintes disjonctives. RAIRO Rech Oper/Oper Res 12:333–351

    MATH  MathSciNet  Google Scholar 

  28. Heller J (1960) Some numerical experiments for an M×J flow shop and its decision-theoretical aspects. Oper Res 8:178–184

    Google Scholar 

  29. Reeves CR (1995) A genetic algorithm for flow shop sequencing. Comput Oper Res 22:5–13

    Article  MATH  Google Scholar 

  30. Fink A, Voß S (2003) Solving the continuous flow-shop scheduling problem by metaheuristics. Eur J Oper Res 151:400–414

    Article  MATH  Google Scholar 

  31. Nawaz M, Enscore E, Ham I (1983) A heuristic algorithm for the m-machine, n-shop sequencing problem. Omega 11:91–95

    Article  Google Scholar 

  32. Taillard E (1990) Some efficient heuristic methods for the flow shop sequencing problem. Eur J Oper Res 47:67–74

    Article  MathSciNet  Google Scholar 

  33. Ruiz R, Maroto C (2005) A comprehensive review and evaluation of permutation flow shop heuristics. Eur J Oper Res 165:479–494

    Article  MATH  MathSciNet  Google Scholar 

  34. Osman IH, Potts CN (1989) Simulated annealing for permutation flow-shop scheduling. Omega 17:551–557

    Article  Google Scholar 

  35. Campbell HG, Dudek RA, Smith ML (1970) A heuristic algorithm for the n job m machine sequencing problem. Manage Sci 16:630–637

    Article  Google Scholar 

  36. Dannenbring DG (1977) An evaluation of flow-shop sequencing heuristic. Manage Sci 23:1174–1182

    Article  MATH  Google Scholar 

  37. Parthasarathy S, Rajendran C (1997) A simulated annealing heuristic for scheduling to minimize mean weighted tardiness in a flow shop with sequence-dependent setup times of jobs - a case study. Prod Plann Contr 8:475–483

    Article  Google Scholar 

  38. Chakravarthy K, Rajendran C (1999) A heuristic for scheduling in a flow shop with the bicriteria of makespan and maximum tardiness minimization. Prod Plann Contr 10:707–714

    Article  Google Scholar 

  39. Laha D, Chakraborty UK (2007) An efficient stochastic hybrid heuristic for flowshop scheduling. Eng Appl Artif Intell 20:851–856

    Article  Google Scholar 

  40. Laha D, Chakraborty UK (2007) An efficient heuristic approach to total flowtime minimization in permutation flowshop scheduling. Int J Adv Manuf Technol. DOI 10.1007/s00170–007–1156-z

  41. Chakraborty UK, Laha D (2007) An improved heuristic for permutation flowshop scheduling. International Journal of Information & Communication Technology 1:89–97

    Article  Google Scholar 

  42. Kreyszig E (1972) Advanced Engineering Mathematics. Wiley, New York

    MATH  Google Scholar 

  43. Liu J, Reeves CR (2001) Constructive and composite heuristics solution of the \(P||\sum {C_i } \) scheduling problem. Eur J Oper Res 132:439–452

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mechanical Engineering Department, Jadavpur University, Calcutta, 700032, India

    Dipak Laha

  2. Department of Mathematics and Computer Science, University of Missouri, St. Louis, MO, 63121, USA

    Uday K. Chakraborty

Authors
  1. Dipak Laha
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Uday K. Chakraborty
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Uday K. Chakraborty.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Laha, D., Chakraborty, U.K. A constructive heuristic for minimizing makespan in no-wait flow shop scheduling. Int J Adv Manuf Technol 41, 97–109 (2009). https://doi.org/10.1007/s00170-008-1454-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-008-1454-0

Keywords

Search

Navigation