Skip to main content
SpringerLink
Log in

A new efficient heuristic method for minimizing the total tardiness in a no-idle permutation flow shop

  • Production Management
  • Published:
Production Engineering Aims and scope Submit manuscript

Abstract

This paper aims at minimizing total tardiness in a no-idle permutational flow shop environment. Even though this criterion is relevant for improving client satisfaction in production systems with strict due dates, no constructive heuristics have been developed for this specific problem so far. In this study, high performance constructive heuristics from related problems were adapted and compared to a new one proposed for the problem \({F_m}\left| {no - idle,prmu} \right|\mathop \sum{T}\). Computational experiments show that the new method significantly outperforms the adapted existing heuristics.

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

Fig. 1

Similar content being viewed by others

References

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

    Article  MathSciNet  MATH  Google Scholar 

  2. Baptiste P, Hguny L-K (1997) A branch and bound algorithm for the F/no − idle/Cmax. In: Proceedings of the international conference on industrial engineering and production management (IEPM97), Lyon, France, pp 429–438

  3. Baraz D, Mosheiov G (2008) A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time. Eur J Oper Res 184:810–813

    Article  MathSciNet  MATH  Google Scholar 

  4. Cepek O, Okada M, Vlach M (2000) Note: on the two-machine no-idle flowshop problem. Nav Res Logist 47:353–358

    Article  MathSciNet  MATH  Google Scholar 

  5. Fernandez-Viagas V, Framinan JM (2015) NEH-based heuristics for the permutation fowshop scheduling problem to minimise total tardiness. Comput Oper Res 60:27–36

    Article  MathSciNet  MATH  Google Scholar 

  6. Graham R-L, Lawler E-L, Lenstra J-K, Kan A-R (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discret Math 5:287–326

    Article  MathSciNet  MATH  Google Scholar 

  7. Johnson SM (1954) Optimal two and three-stage production schedules with set-up times included. Nav Res Logist Q 1(1):61–68

    Article  MATH  Google Scholar 

  8. Kalczynski PJ, Kamburowski J (2007) On no-wait and no-idle flow shops with makespan criterion. Eur J Oper Res 178(3):677–685

    Article  MathSciNet  MATH  Google Scholar 

  9. Kalczynski P-J, Kamburowski J (2005) A heuristic for minimizing the makespan in no-idle permutation flowshop. Comput Ind Eng 49(1):146–154

    Article  Google Scholar 

  10. Kim YD, Kim JG, Choi B, Kim HU (2001) Production scheduling in a semiconductor wafer fabrication facility producing multiple product types with distinct due dates. IEEE Trans Robot Autom 17(5):589–598

    Article  Google Scholar 

  11. Kim Y-D (1993) Heuristics for flowshop scheduling problems minimizing mean tardiness. J Oper Res Soc 44(1):19–28

    Article  MATH  Google Scholar 

  12. Liu J, Reeves C (2001) Constructive and composite heuristic solutions to the P || scheduling problem. Eur J Oper Res 132:439–452

    Article  MathSciNet  MATH  Google Scholar 

  13. Moccellin JV, Nagano MS (1998) Evaluating the performance of tabu search procedures for flow shop sequencing. J Oper Res Soc 49(12):1296–1302

    Article  MATH  Google Scholar 

  14. Nagano MS, Moccellin JV (2002) A high quality solution constructive heuristic for flow shop sequencing. J Oper Res Soc 53(12):1374–1379

    Article  MATH  Google Scholar 

  15. Nagano MS, Januário JCSS (2013) Evolutionary heuristic for makespan minimization in no-idle flow shop production systems. Acta Sci Technol 35(2):271–278

    Article  Google Scholar 

  16. Narain L, Bagga P-C (2005) Flowshop/no-idle scheduling to minimise the mean flowtime. Anziam J 47:265–275.

    Article  MathSciNet  MATH  Google Scholar 

  17. Nawaz IHM, Enscore EE, Ham I (1983) A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11(1):91–95

    Article  Google Scholar 

  18. Pan Q, Ruiz R (2014) An effective iterated greedy algorithm for the mixed no-idle permutation flowshop scheduling problem. Omega 44:41–50

    Article  Google Scholar 

  19. Panwalkar S, Dudek R, Smith M (1973) Sequencing research and the industrial problem. In: Symposium on the theory of scheduling. Springer, Berlin

    Google Scholar 

  20. Pinedo M (2008) Scheduling theory, algorithms, and systems, 3rd edn. Springer, New York

    MATH  Google Scholar 

  21. Rad S-F, Ruiz R, Boroojerdian N (2009) New high performing heuristics for minimizing makespan in permutation flowshops. OMEGA Int J Manag Sci 37:331–345

    Article  Google Scholar 

  22. Raman N (1995) Minimum tardiness scheduling in flow shops: Construction and evaluation of alternative solution approaches. J Oper Manag 12(2):131–151

    Article  Google Scholar 

  23. Rossi FL, Nagano MS, Tavares Neto RF (2016) Evaluation of high performance constructive heuristics for the flow shop with makespan minimization. Int J Adv Manuf Technol 87(1–4):125–136

    Article  Google Scholar 

  24. Rossi FL, Nagano MS, Sagawa JK (2017) An effective constructive heuristic for permutation flow shop scheduling problem with total flow time criterion. Int J Adv Manuf Technol 90(1–4):93–107

    Article  Google Scholar 

  25. Ruiz R, Vallada E, Fernandez-Martinez C (2009) Scheduling in flowshops with no-idle machines. Computational intelligence in flowshop and job shop scheduling. Springer-Verlag, Berlin, pp 21–51

    Book  Google Scholar 

  26. Saadani N, Guinet A, Moalla M (2003) Three stage no-idle flow-shops. Comput Ind Eng 44(3):425–434

    Article  Google Scholar 

  27. Sen T, Gupta S (1984). A state-of-art survey of static scheduling research involving due dates. Omega 12(1):63–76

    Article  Google Scholar 

  28. Tasgetiren M-F, Pan Q, Suganthan P-N, Oner A (2013) A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion. Appl Math Modell 37:6758–6779

    Article  MathSciNet  Google Scholar 

  29. Vachajitpan P (1982) Job sequencing with continuous machine operation. Comput Ind Eng 6(3):255–259

    Article  Google Scholar 

  30. Vallada E, Ruiz R, Minella G (2008) Minimising total tardiness in the m-machine flowshop problem: a review and evaluation of heuristics and metaheuristics. Comput Oper Res 35(4):1350–1373

    Article  MATH  Google Scholar 

  31. Woollam CR (1986) Flowshop with no idle machine time allowed. Comput Ind Eng 10(1):69–76

    Article  Google Scholar 

Download references

Acknowledgements

This research has been economically supported by Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) through the number process 448161/2014-1 and 308047/2014-1.

Author information

Authors and Affiliations

  1. Production Engineering Department, São Carlos School of Engineering, University of São Paulo, Av. Trabalhador Sãocarlense, 400, Centro, São Carlos, SP, 13566-590, Brazil

    Marcelo Seido Nagano, Fernando Luis Rossi & Caio Paziani Tomazella

Authors
  1. Marcelo Seido Nagano
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fernando Luis Rossi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Caio Paziani Tomazella
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Marcelo Seido Nagano.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Nagano, M.S., Rossi, F.L. & Tomazella, C.P. A new efficient heuristic method for minimizing the total tardiness in a no-idle permutation flow shop. Prod. Eng. Res. Devel. 11, 523–529 (2017). https://doi.org/10.1007/s11740-017-0747-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11740-017-0747-2

Keywords

Search

Navigation