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

International Journal of Advanced Manufacturing Technology

Volumn 46, Issue 5-8, 2010, Pages 757-767

  Safari, Ehram ^a   Sadjadi, Seyed Jafar ^a   Shahanaghi, Kamran ^a  

^a IRAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Iran)

Author keywords

Condition based maintenance; Flowshops; Meta heuristic; Simulation

Indexed keywords

CONDITION BASED MAINTENANCE; EXISTING METHOD; EXPECTED MAKESPAN; FLOW-SHOPS; INDUSTRIAL SETTINGS; INSPECTION TIME; META HEURISTIC ALGORITHM; METAHEURISTIC; NP-HARD PROBLEM; ON-MACHINES;

COMPUTATIONAL COMPLEXITY; DEGRADATION; HEURISTIC ALGORITHMS; PREVENTIVE MAINTENANCE; SCHEDULING ALGORITHMS; SIMULATED ANNEALING; TABU SEARCH;

HEURISTIC METHODS;

EID: 74249104832     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-009-2151-3     Document Type: Article

References (42)

1. CY Lee 1997 Minimizing the makespan in the two-machine flow shop scheduling problem with an availability constraint Oper Res Lett 20 129 139 10.1016/S0167-6377(96) 00041-7 0882.90069 10.1016/S0167-6377(96)00041-7 1449340
2. M Nawaz E Enscore L Ham 1983 A heuristic for the m-machine n-job flowshop sequencing problem Omega II 91 95 10.1016/0305-0483(83)90088-9 10.1016/0305-0483(83)90088-9 (Pubitemid 13193807)
3. CR Reeves 1995 A genetic algorithm for flowshop sequencing Comput Oper Res 22 I 5 13 10.1016/0305-0548(93)E0014-K 0815.90097 10.1016/0305-0548(93) E0014-K
4. T Murata H Ishibuchi H Tanaka 1996 Genetic algorithms for flowshop scheduling problems Comput Ind Eng 30 4 1061 1071 10.1016/0360-8352(96)00053-8 10.1016/0360-8352(96)00053-8 (Pubitemid 126375914)
5. CL Chen RV Neppalli N Aljaber 1996 Genetic algorithms applied to the continuous flowshop problem Comput Ind Eng 30 4 919 929 10.1016/0360-8352(96) 00042-3 10.1016/0360-8352(96)00042-3 (Pubitemid 126375903)
6. LH Osman CN Potts 1989 Simulated annealing for permutation flowshop scheduling Omega 17 6 551 557 10.1016/0305-0483(89)90059-5 10.1016/0305-0483(89) 90059-5
7. FA Ogbu DK Smith 1990 The application of the simulated annealing algorithm to the solution of the nlm. emax flowshop problem Comput Oper Res 17 3 243 253 10.1016/0305-0548(90)90001-N 0694.90059 10.1016/0305-0548(90)90001-N 1043095 (Pubitemid 20674248)
8. H Ishibuchi S Misaki H Tanaka 1995 Modified simulated annealing algorithms for the flowshop sequencing problem Eur J Oper Res 81 388 398 10.1016/0377-2217(93)E0235-P 0927.90048 10.1016/0377-2217(93)E0235-P
9. E Taillard 1993 Benchmarks for basic scheduling problems Eur J Oper Res 64 278 285 10.1016/0377-2217(93)90182-M 0769.90052 10.1016/0377-2217(93)90182-M (Pubitemid 23599340)
10. C Rajendran H Ziegler 2004 Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs Eur J Oper Res 155 426 38 10.1016/S0377-2217(02)00908-6 1045.90032 10.1016/S0377-2217(02)00908-6 2054703
11. R Ruiz C Morato J Alcazar 2006 Two newrobust genetic algorithms for the flowshop scheduling problem Omeg 34 461 476 10.1016/j.omega.2004.12.006 10.1016/j.omega.2004.12.006 (Pubitemid 43046058)
12. A Noorul Haq M Saravanan AR Vivekraj T Prasad 2006 A scatter search algorithm for general flowshop scheduling problem Int J Adv Manuf Technol 31 731 736 10.1007/s00170-005-0244-1 10.1007/s00170-005-0244-1
13. A Noorul Haq M Saravanan 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
14. M Saravanan A Noorul Haq 2007 Evaluation of scatter search approach for scheduling optimization of flexible manufacturing systems Int J Adv Manuf Technol 38 9-10 978 986
15. M Saravanan A Noorul Haq AR Vivekraj T Prasad 2007 Performance evaluation of scatter search method for permutation flowShop sequencing problems Int J Adv Manuf Technol 37 11-12 1200 1208 10.1007/s00170-007-1053-5
16. M Saravanan A Noorul Haq 2008 A scatter search method to minimize makespan of cell scheduling problem Int J Agile Syst Manage 3 1/2 18 36
17. KD Glazebrook 1984 Scheduling stochastic jobs on a single machine subject to breakdowns Nav Res Logistics Q 31 251 264 10.1002/nav.3800310207 0538.90031 10.1002/nav.3800310207 747087
18. A Allahverdi J Mittenhal 1994 Scheduling on M parallel machines subject to random breakdowns to minimize expected mean flow time Nav Res Logistics Q 41 677 682 10.1002/1520-6750(199408) 41:5<677::AID-NAV3220410509>3.0. CO;2-7 0819.90041 10.1002/1520-6750(199408)41:5<677::AID-NAV3220410509>3. 0.CO;2-7
19. G Schmidt 2000 Scheduling with limited machine availability Eur J Oper Res 121 1 15 10.1016/S0377-2217(98)00367-1 0959.90023 10.1016/S0377-2217(98) 00367-1 (Pubitemid 30546340)
20. J Blazewicz, et al. 2001 Heuristic algorithms for the two-machine flowshop with limited machine availability Omega 29 599 608 10.1016/S0305- 0483(01)00048-2 10.1016/S0305-0483(01)00048-2 (Pubitemid 33628774)
21. CJ Liao WJ Chen 2003 Single-machine scheduling with periodic maintenance and nonresumable jobs Comput Oper Res 30 1335 1347 10.1016/S0305-0548(02)00074-6 1037.90031 10.1016/S0305-0548(02)00074-6 1967459 (Pubitemid 36463800)
22. H Allaoui A Artiba 2004 Integrating simulation and optimization to schedule a hybrid flow shop with maintenance constraints Comput Ind Eng 47 431 450 10.1016/j.cie.2004.09.002 10.1016/j.cie.2004.09.002
23. R Ruiz JC Garcia-Diaz C Marato 2007 Considering scheduling and preventive maintenance in the flowshop sequencing problem Comput Oper Res 34 3314 3330 10.1016/j.cor.2005.12.007 1128.90031 10.1016/j.cor.2005.12.007 (Pubitemid 46517859)
24. H Allaoui S Lamouri A Artiba E Aghezzaf 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 10.1016/j.ijpe.2006.08.017 10.1016/j.ijpe.2006.08.017 (Pubitemid 351179598)
25. WJ Chen 2009 Minimizing number of tardy jobs on a single machine subject to periodic maintenance Omega 37 591 599 10.1016/j.omega.2008.01.001 10.1016/j.omega.2008.01.001
26. M Gholami M Zandieh A Alem-Tabriz 2008 Scheduling hybrid flowshop with sequence-dependent setup times and machines with random breakdowns Int J Adv Manuf Technol 10.1007/s00170-008-1577-3
27. JK Vaurio 1997 On time-dependent availability and maintenance optimization of standby units under various maintenance policies Reliab Eng Syst Saf 56 79 89 10.1016/S0951-8320(96)00132-9 10.1016/S0951-8320(96)00132-9
28. V Legat AH Zaludova V Cervenka V Jurca 1996 Contribution to optimization of preventive maintenance Reliab Eng Syst Saf 51 259 266 10.1016/0951-8320(96) 00124-X 10.1016/0951-8320(96)00124-X (Pubitemid 126349479)
29. Nakagawa T (2007) Shock and damage models in reliability theory. Springer, London
30. J Barata C Guedes Soares M Marseguerra E Zio 2002 Simulation modeling of repairable multi -component deteriorating systems for 'on condition' maintenance optimization Reliab Eng Syst Saf 76 255 264 10.1016/S0951-8320(02)00017-0 (Pubitemid 34545604)
31. S Kirkpatrik CD Gelatt MP Vecch 1983 Optimization by simulated annealing Science 220 671 680 10.1126/science.220.4598.671 10.1126/science.220.4598.671 702485
32. F Glover 1989 Tabu search-Part I ORSA J Comput 1 190 206 0753.90054 1043673
33. F Glover 1990 Tabu search-Part II ORSA J Comput 2 4 32 0771.90084
34. Q Hao Z Yang D Wang Z Li 1996 Common due-date determination and sequencing using tabu search Comput Oper Res 23 409 417 10.1016/0305-0548(95) 00051-8 0849.90078 10.1016/0305-0548(95)00051-8 (Pubitemid 126375148)
35. M Ben-Daya M Al-Fawzan 1998 A tabu search approach for the flowshop scheduling problem Eur J Oper Res 109 88 95 10.1016/S0377-2217(97)00136-7 0949.90037 10.1016/S0377-2217(97)00136-7
36. SW Lin KC Ying 2008 applying a hybrid simulated annealing and tabu search approach to non-permutation flowshop scheduling problems Int J Prod Res 47 1411 1424 10.1080/00207540701484939
37. YZ Chao L PeiGen R YunQing G ZaiLin 2008 A very fast TS/SA algorithm for the job shop scheduling problem Comput Oper Res 35 282 294 10.1016/j.cor.2006. 02.024 1149.90345 10.1016/j.cor.2006.02.024 2312271 (Pubitemid 46899361)
38. F Glover 1993 A user's guide tabu search Ann Oper Res 41 3 28 0772.90063 10.1007/BF02078647
39. J Grabowski M Wodecki 2004 A very fast Tabu search algorithm for the permutation flowshop problem with makespan criterion Comput Oper Res 31 281 284 10.1016/S0305-0548(03)00145-X 10.1016/S0305-0548(03)00145-X 2047859 (Pubitemid 38527452)
40. MK Tiwari S Kumar R Prakash R Shankar 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 10.1109/TSMCA.2006.878979 (Pubitemid 44680562)
41. R Ruiz C Maroto 2005 A comprehensive review and evaluation of permutation flowshop heuristics Eur J Oper Res 165 479 494 10.1016/j.ejor.2004.04.017 1066.90038 10.1016/j.ejor.2004.04.017 2121952 (Pubitemid 40206377)
42. Stützle T (1998) Applying iterated local search to the permutation flowshop problem. Technical Report AIDA-98-04, FG Intellektik, TH Darmstadt