Skip to main content
SpringerLink
Log in

A heuristic for no-wait flow shop scheduling

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

Abstract

This paper presents an efficient heuristic method to minimize total flow time in no-wait flow shop scheduling. It is based on the assumption that the priority of a job in the initial sequence is given by the sum of its processing times on the bottleneck machines. Empirical results demonstrate the superiority of the proposed method over the best-known heuristics in the literature, while remaining the same complexity order of O(n 2).

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. Wismer DA (1972) Solution of the flowshop-scheduling problem with no intermediate queues. Oper Res 20:689–697

    Article  MATH  Google Scholar 

  2. 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 

  3. Gupta JND (1976) Optimal flowshop schedules with no intermediate storage. Nav Res Logist 23:235–243

    Article  MATH  Google Scholar 

  4. Framinan JM, Nagano MS (2008) Evaluating the performance for makespan minimization in no-wait flowshop sequencing. J Mater Process Technol 197:1–9

    Article  Google Scholar 

  5. Ribeiro Filho G, Nagano MS, Lorena LAN (2007) Hybrid evolutionary algorithm for flowtime minimisation in no-wait flowshop scheduling. Lecture Notes in Computer Science 4827:1099–1109

    Article  Google Scholar 

  6. Framinan JM, Nagano MS, Moccellin JV (2010) An efficient heuristic for total flowtime minimization in no-wait flowshops. Int J Adv Manuf Technol 46:1049–1057

    Article  Google Scholar 

  7. Nagano MS, Silva AA, Lorena LAN (2012) A new evolutionary clustering search for a no-wait flow shop problem with set-up times. Eng Appl Artif Intel 25(6):1114–1120

    Article  Google Scholar 

  8. Araujo DC, Nagano MS (2010) An effective heuristic for the no-wait flowshop with sequence-dependent setup times problem. Lecture Notes in Computer Science 6437:187–196

    Article  Google Scholar 

  9. Araujo DC, Nagano MS (2011) A new effective heuristic method for the no-wait flowshop with sequence-dependent setup times problem. Int J Ind Eng Comput 2(1):155–166

    Google Scholar 

  10. Rock H (1984) The three-machine no-wait flow shop is NP-complete. Journal of Associate Computer Machinery 31:336–345

    Article  MathSciNet  Google Scholar 

  11. Hall NG, Sriskandarajah C (1996) A survey of machine scheduling problems with blocking and no-wait in process. Oper Res 44:510–525

    Article  MathSciNet  MATH  Google Scholar 

  12. Bonney MC, Gundry SW (1976) Solutions to the constrained flowshop sequencing problem. Oper Res Q 27:869–883

    Article  MATH  Google Scholar 

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

    Google Scholar 

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

    MATH  Google Scholar 

  15. Gangadharan R, Rajendran C (1994) Heuristic algorithms for scheduling in the no-wait flowshop. Int J Prod Econ 32:285–290

    Article  Google Scholar 

  16. Laha D, Chakraborty UK (2009) A constructive heuristic for minimizing makespan in no-wait flow shop scheduling. Int J Adv Manuf Technol 41:97–109

    Article  Google Scholar 

  17. Rajendran C, Chaudhuri D (1990) Heuristic algorithms for continuous flow-shop problem. Naval Research Logistic Quarterly 37:695–705

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

  19. Aldowaisan T, Allahverdi A (2004) New heuristics for m-machine no-wait flowshop to minimize total completion time. Omega 32:345–352

    Article  Google Scholar 

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

    Article  MATH  Google Scholar 

  21. Grabowski J, Pempera J (2005) Some local search algorithms for no-wait flow-shop problem with makespan criterion. Comput Oper Res 32:2197–2212

    Article  MathSciNet  MATH  Google Scholar 

  22. Liu B, Wang L, Jin YH (2007) An effective hybrid particle swarm optimization for no-wait flow shop scheduling. Int J Adv Manuf Technol 31:1001–1011

    Article  Google Scholar 

  23. Pan QK, Tasgetiren MF, Liang YC (2008) A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem. Comput Oper Res 35:2807–2839

    Article  MathSciNet  MATH  Google Scholar 

  24. Pan QK, Wang L, Tasgetiren MF, Zhao BH (2008) A hybrid discrete particle swarm optimization algorithm for the no-wait flow shop scheduling problem with makespan criterion. Int J Adv Manuf Technol 38:337–347

    Article  Google Scholar 

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

    Article  Google Scholar 

  26. 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 

  27. Kumar A, Prakash A, Shankar R, Tiwari MK (2006) Psychoclonal algorithm based approach to solve continuous flowshop scheduling problem. Expert Syst Appl 31:504–514

    Article  Google Scholar 

  28. Nawaz M, Enscore EE Jr, Ham I (1983) A heuristic algorithm for the m machine, n job flowshop sequencing problem. Omega 11:91–95

    Article  Google Scholar 

  29. Haupt R (1989) A survey of priority rule based scheduling. OR-Spektrum 11:3–16

    Article  MathSciNet  MATH  Google Scholar 

  30. Ramasesh R (1990) Dynamic jobshop scheduling: a survey of simulation research. Omega 18:43–57

    Article  Google Scholar 

  31. Rajendran C, Holthaus O (1999) A comparative study of dispatching rules in dynamic flowshops and jobshops. Eur J Oper Res 115:156–170

    Article  Google Scholar 

  32. Kalir AA, Sarin SC (2001) A near-optimal heuristic for the sequencing problem in multiple-batch flow-shops with small equal sublots. Omega 29:577–584

    Article  Google Scholar 

  33. Rajendran C, Alicke K (2007) Dispatching in flowshops with bottleneck machines. Comput Ind Eng 52:89–106

    Article  Google Scholar 

  34. Framinan JM, Leisten R (2003) An efficient constructive heuristic for flowtime minimization in permutation flow shops. Omega 31:311–317

    Article  Google Scholar 

  35. Laha D, Sarin SC (2009) A heuristic to minimize total flow time in permutation flow shop. Omega 37:734–739

    Article  Google Scholar 

  36. Kreyszig E (1972) Advanced engineering mathematics. Wiley, New York

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Sagar U. Sapkal & Dipak Laha

Authors
  1. Sagar U. Sapkal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dipak Laha
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dipak Laha.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sapkal, S.U., Laha, D. A heuristic for no-wait flow shop scheduling. Int J Adv Manuf Technol 68, 1327–1338 (2013). https://doi.org/10.1007/s00170-013-4924-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-013-4924-y

Keywords

Search

Navigation