Skip to main content
SpringerLink
Log in

Scheduling flowshops with condition-based maintenance constraint to minimize expected makespan

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

Abstract

In contrast to the common assumption, machines can be unavailable in most real-life industrial settings for many reasons. In this paper, we study the scheduling flowshops problem under “condition-based” maintenance constraints to minimize the expected makespan using simulation to tackle the randomness of the problem at hand. We propose an effective meta-heuristic algorithm, namely, hybrid simulated annealing-tabu search, to tackle such an NP-hard problem. The proposed method focuses on non-resumability, where the job needs to completely restart. We additionally suppose that machines suffer from degradation due to shocks; thus, preventive maintenance must be performed on machines. Furthermore, it is assumed that the degradation value of a machine is known at inspection time. Overall, seven adaptations of existing meta-heuristic and heuristic methods are evaluated for the integration of preventive maintenance and are applied to a set of 960 instances. The preliminary results showed that the proposed algorithm of this paper performs better than other existing methods.

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

Reference

  1. Lee CY (1997) Minimizing the makespan in the two-machine flow shop scheduling problem with an availability constraint. Oper Res Lett 20:129–139. doi:10.1016/S0167-6377(96)00041-7

    Article  MATH  MathSciNet  Google Scholar 

  2. Nawaz M, Enscore E, Ham L (1983) A heuristic for the m-machine n-job flowshop sequencing problem. Omega II:91–95. doi:10.1016/0305-0483(83)90088-9

    Article  Google Scholar 

  3. Reeves CR (1995) A genetic algorithm for flowshop sequencing. Comput Oper Res 22(I):5–13. doi:10.1016/0305-0548(93)E0014-K

    Article  MATH  Google Scholar 

  4. Murata T, Ishibuchi H, Tanaka H (1996) Genetic algorithms for flowshop scheduling problems. Comput Ind Eng 30(4):1061–1071. doi:10.1016/0360-8352(96)00053-8

    Article  Google Scholar 

  5. Chen CL, Neppalli RV, Aljaber N (1996) Genetic algorithms applied to the continuous flowshop problem. Comput Ind Eng 30(4):919–929. doi:10.1016/0360-8352(96)00042-3

    Article  Google Scholar 

  6. Osman LH, Potts CN (1989) Simulated annealing for permutation flowshop scheduling. Omega 17(6):551–557. doi:10.1016/0305-0483(89)90059-5

    Article  Google Scholar 

  7. Ogbu FA, Smith DK (1990) The application of the simulated annealing algorithm to the solution of the nlm. emax flowshop problem. Comput Oper Res 17(3):243–253. doi:10.1016/0305-0548(90)90001-N

    Article  MATH  MathSciNet  Google Scholar 

  8. Ishibuchi H, Misaki S, Tanaka H (1995) Modified simulated annealing algorithms for the flowshop sequencing problem. Eur J Oper Res 81:388–398. doi:10.1016/0377-2217(93)E0235-P

    Article  MATH  Google Scholar 

  9. Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Oper Res 64:278–285. doi:10.1016/0377-2217(93)90182-M

    Article  MATH  Google Scholar 

  10. Rajendran C, Ziegler H (2004)Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. Eur J Oper Res 155:426–38. doi:10.1016/S0377-2217(02)00908-6

    Article  MATH  MathSciNet  Google Scholar 

  11. Ruiz R, Morato C, Alcazar J (2006) Two newrobust genetic algorithms for the flowshop scheduling problem. Omeg 34:461–476. doi:10.1016/j.omega.2004.12.006

    Article  Google Scholar 

  12. Noorul Haq A, Saravanan M, Vivekraj AR, Prasad T (2006) A scatter search algorithm for general flowshop scheduling problem. Int J Adv Manuf Technol 31:731–736. doi:10.1007/s00170-005-0244-1

    Article  Google Scholar 

  13. Noorul Haq A, Saravanan M (2007) A scatter search approach for minimizing earliness and tardiness penalties in single machine scheduling around large restrictive common due windows'. Int J Appl Manag Technol 5(2):76–91

    Google Scholar 

  14. Saravanan M, Noorul Haq A (2007) Evaluation of scatter search approach for scheduling optimization of flexible manufacturing systems. Int J Adv Manuf Technol 38(9–10):978–986

    Google Scholar 

  15. Saravanan M, Noorul Haq A, Vivekraj AR, Prasad T (2007) Performance evaluation of scatter search method for permutation flowShop sequencing problems. Int J Adv Manuf Technol 37(11–12):1200–1208. doi:10.1007/s00170-007-1053-5

    Google Scholar 

  16. Saravanan M, Noorul Haq A (2008) A scatter search method to minimize makespan of cell scheduling problem. Int J Agile Syst Manage 3(1/2):18–36

    Google Scholar 

  17. Glazebrook KD (1984) Scheduling stochastic jobs on a single machine subject to breakdowns. Nav Res Logistics Q 31:251–264. doi:10.1002/nav.3800310207

    Article  MATH  MathSciNet  Google Scholar 

  18. Allahverdi A, Mittenhal J (1994) Scheduling on M parallel machines subject to random breakdowns to minimize expected mean flow time. Nav Res Logistics Q 41:677–682. doi:10.1002/1520-6750(199408) 41:5<677::AID-NAV3220410509>3.0.CO;2-7

    Article  MATH  Google Scholar 

  19. Schmidt G (2000) Scheduling with limited machine availability. Eur J Oper Res 121:1–15. doi:10.1016/S0377-2217(98)00367-1

    Article  MATH  Google Scholar 

  20. Blazewicz J et al (2001) Heuristic algorithms for the two-machine flowshop with limited machine availability. Omega 29:599–608. doi:10.1016/S0305-0483(01)00048-2

    Article  Google Scholar 

  21. Liao CJ, Chen WJ (2003)Single-machine scheduling with periodic maintenance and nonresumable jobs. Comput Oper Res 30:1335–1347. doi:10.1016/S0305-0548(02)00074-6

    Article  MATH  MathSciNet  Google Scholar 

  22. Allaoui H, Artiba A (2004) Integrating simulation and optimization to schedule a hybrid flow shop with maintenance constraints. Comput Ind Eng 47:431–450. doi:10.1016/j.cie.2004.09.002

    Article  Google Scholar 

  23. Ruiz R, Garcia-Diaz JC, Marato C (2007) Considering scheduling and preventive maintenance in the flowshop sequencing problem. Comput Oper Res 34:3314–3330. doi:10.1016/j.cor.2005.12.007

    Article  MATH  Google Scholar 

  24. Allaoui H, Lamouri S, Artiba A, Aghezzaf E (2008) Simultaneously scheduling n jobs and the preventive maintenance on the two-machine flowshop to minimize the makespan. Int J Prod Econ 112:161–167. doi:10.1016/j.ijpe.2006.08.017

    Article  Google Scholar 

  25. Chen WJ (2009) Minimizing number of tardy jobs on a single machine subject to periodic maintenance. Omega 37:591–599. doi:10.1016/j.omega.2008.01.001

    Article  Google Scholar 

  26. Gholami M, Zandieh M, Alem-Tabriz A (2008) Scheduling hybrid flowshop with sequence-dependent setup times and machines with random breakdowns. Int J Adv Manuf Technol . doi:10.1007/s00170-008-1577-3

    Google Scholar 

  27. Vaurio JK (1997) On time-dependent availability and maintenance optimization of standby units under various maintenance policies. Reliab Eng Syst Saf 56:79–89. doi:10.1016/S0951-8320(96)00132-9

    Article  Google Scholar 

  28. Legat V, Zaludova AH, Cervenka V, Jurca V (1996) Contribution to optimization of preventive maintenance. Reliab Eng Syst Saf 51:259–266. doi:10.1016/0951-8320(96)00124-X

    Article  Google Scholar 

  29. Nakagawa T (2007) Shock and damage models in reliability theory. Springer, London

    MATH  Google Scholar 

  30. Barata J, Guedes Soares C, Marseguerra M, Zio E (2002) Simulation modeling of repairable multi -component deteriorating systems for ‘on condition’ maintenance optimization. Reliab Eng Syst Saf 76:255–264

    Article  Google Scholar 

  31. Kirkpatrik S, Gelatt CD, Vecch MP (1983) Optimization by simulated annealing. Science 220:671–680. doi:10.1126/science.220.4598.671

    Article  MathSciNet  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

  34. Hao Q, Yang Z, Wang D, Li Z (1996) Common due-date determination and sequencing using tabu search. Comput Oper Res 23:409–417. doi:10.1016/0305-0548(95)00051-8

    Article  MATH  Google Scholar 

  35. Ben-Daya M, Al-Fawzan M (1998) A tabu search approach for the flowshop scheduling problem. Eur J Oper Res 109:88–95. doi:10.1016/S0377-2217(97)00136-7

    Article  MATH  Google Scholar 

  36. Lin SW, Ying KC (2008) applying a hybrid simulated annealing and tabu search approach to non-permutation flowshop scheduling problems. Int J Prod Res 47:1411–1424

    Article  Google Scholar 

  37. Chao YZ, PeiGen L, YunQing R, ZaiLin G (2008) A very fast TS/SA algorithm for the job shop scheduling problem. Comput Oper Res 35:282–294. doi:10.1016/j.cor.2006.02.024

    Article  MATH  MathSciNet  Google Scholar 

  38. Glover F (1993) A user's guide tabu search. Ann Oper Res 41:3–28

    Article  MATH  Google Scholar 

  39. Grabowski J, Wodecki M (2004) A very fast Tabu search algorithm for the permutation flowshop problem with makespan criterion. Comput Oper Res 31:281–284. doi:10.1016/S0305-0548(03)00145-X

    Article  MathSciNet  Google Scholar 

  40. Tiwari MK, Kumar S, Prakash R, Shankar R (2006) Solving part-type and operation allocation problems in an FMS: an approach using constraints-based fast simulated annealing algorithm. IEEE Trans Syst Man Cybern, Part A, Syst Humans 36:1170–1184

    Article  Google Scholar 

  41. Ruiz R, Maroto C (2005) A comprehensive review and evaluation of permutation flowshop heuristics. Eur J Oper Res 165:479–494. doi:10.1016/j.ejor.2004.04.017

    Article  MATH  MathSciNet  Google Scholar 

  42. Stützle T (1998) Applying iterated local search to the permutation flowshop problem. Technical Report AIDA-98-04, FG Intellektik, TH Darmstadt

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Iran University of Science and Technology, Narmak, Tehran, 16846, Iran

    Ehram Safari, Seyed Jafar Sadjadi & Kamran Shahanaghi

Authors
  1. Ehram Safari
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Seyed Jafar Sadjadi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kamran Shahanaghi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ehram Safari.

Additional information

This paper was financially assisted by Iran National Scientific Foundation.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Safari, E., Jafar Sadjadi, S. & Shahanaghi, K. Scheduling flowshops with condition-based maintenance constraint to minimize expected makespan. Int J Adv Manuf Technol 46, 757–767 (2010). https://doi.org/10.1007/s00170-009-2151-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-009-2151-3

Keywords

Search

Navigation