An improved genetic algorithm for robust permutation flowshop scheduling

International Journal of Advanced Manufacturing Technology

Volumn 56, Issue 1-4, 2011, Pages 345-354

  Liu, Qiong ^a   Ullah, Saif ^a   Zhang, Chaoyong ^a  

^a HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

Genetic algorithm; Permutation flowshop; Robust scheduling

Indexed keywords

COMPLETION TIME; COMPUTATIONAL RESULTS; IMPROVED GA; IMPROVED GENETIC ALGORITHMS; MAKESPAN; PERMUTATION FLOW SHOPS; PERMUTATION FLOW-SHOP SCHEDULING; ROBUST SCHEDULING;

SCHEDULING ALGORITHMS;

GENETIC ALGORITHMS;

EID: 79960982986     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-010-3149-6     Document Type: Article

References (35)

1. H Aytug MA Lawley K McKay S Mohan R Uzsoy 2005 Executing production schedules in the face of uncertainties: a review and some future directions Eur J Oper Res 161 86 110 2095874 1115.90025 10.1016/j.ejor.2003.08.027
2. H Pierreval S Durieux-Paris 2007 Robust simulation with a base environmental scenario Eur J Oper Res 182 783 793 1121.90331 10.1016/j.ejor.2006.07.045 (Pubitemid 46667209)
3. S Goren I Sabuncuoglu 2008 Robustness and stability measures for scheduling: single-machine environment IIE Trans 40 66 83 10.1080/ 07408170701283198 (Pubitemid 350110976)
4. Z Li M Ierapetritou 2008 Process scheduling under uncertainty: review and challenges Comput Chem Eng 32 715 727 10.1016/j.compchemeng.2007.03.001 (Pubitemid 351199674)
5. W Herroeleny R Leus 2004 Robust and reactive project scheduling: a review and classification of procedures Int J Prod Res 42 8 1599 1620 10.1080/00207540310001638055
6. S Lan J Clarke C Barnhart 2006 Planning for robust airline operations optimizing aircraft routings and flight departure times to minimize passenger disruptions Transp Sci 40 1 15 28 10.1287/trsc.1050.0134
7. L Tang X Wang 2008 A predictive reactive scheduling method for color-coating production in steel industry Int J Adv Manuf Technol 35 633 645 2411508 10.1007/s00170-006-0740-y (Pubitemid 350260741)
8. G Feiza P Henri S Hajri-Gabouj 2010 Analysis of robustness in proactive scheduling: a graphical approach Comput Ind Eng 58 193 198 10.1016/j.cie.2009. 03.004
9. I Sabuncuoglu S Goren 2009 Hedging production schedules against uncertainty in manufacturing environment with a review of robustness and stability research Int J Computer Integr Manuf 22 2 138 157 10.1080/ 09511920802209033
10. P Kouvelis RL Daniels G Vairaktarakis 2000 Robust scheduling of a two-machine flowshop with uncertain processing times IIE Trans 32 5 421 432 (Pubitemid 30540764)
11. CY Kuo FJ Lin 2002 Relative robustness for single-machine scheduling problem with processing time uncertainty J Chin Inst Ind Eng 19 5 59 67
12. Kouvelis P, Yu G (1997) Robust discrete optimization and its applications. Kluwer Academic Publishers, Boston
13. RL Daniels P Kouvelis 1995 Robust scheduling to hedge against processing time uncertainty in single-stage production Manage Sci 41 363 376 0832.90050 10.1287/mnsc.41.2.363
14. A Kaperski 2005 Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion Oper Res Lett 33 431 436 2127416 10.1016/j.orl.2004.07.004 (Pubitemid 40339644)
15. J Yang G Yu 2002 On the robust single machine scheduling problem J Comb Optim 6 17 33 1880729 1058.90029 10.1023/A:1013333232691 (Pubitemid 34130061)
16. L Liu HY Gu YG Xi 2007 Robust and stable scheduling of a single machine with random machine breakdowns Int J Adv Manuf Technol 31 645 654 10.1007/s00170-005-0237-0 (Pubitemid 46005335)
17. RL Daniels JE Carrillo 1997 β-Robust scheduling for single-machine systems with uncertain processing times IIE Trans 29 977 985 (Pubitemid 127755104)
18. CW Wu KN Brown JC Beck 2009 Scheduling with uncertain durations: modeling β-robust scheduling with constraints Comput Oper Res 36 2348 2356 2586502 1179.90164 10.1016/j.cor.2008.08.008
19. Teixidor AB (2006) Proactive management of uncertainty to improve scheduling robustness in process industries. PhD thesis, Universitat Politμecnica de Catalunya Barcelona
20. Hapke M, Jaskievicz A, Slowinski R (1999) Fuzzy multimode resource-constrained project scheduling with multiple objectives. In: Weglarz J (ed) Project scheduling recent models, algorithms and applications. Kluwer Academic Publishers, Dordrecht, pp 355-382
21. Allen E (2007) Modeling with Itô stochastic differential equation. Springer, Dordrecht
22. Hayter AJ (1996) Probability and statistics for engineers and scientists. PWB Publishing, Duxbury
23. CL Chen VS Vempati N Aljaber 1995 An application of genetic algorithms for flow shop problems Eur J Oper Res 80 389 396 10.1016/0377-2217(93)E0228-P
24. CR Reeves 1995 A genetic algorithm for flow shop sequencing Comput Oper Res 22 1 5 13 0815.90097 10.1016/0305-0548(93)E0014-K
25. T Murata H Ishibuchi H Tanaka 1996 Genetic algorithms for flowshop scheduling problems Comput Ind Eng 30 1061 1071 10.1016/0360-8352(96)00053-8 (Pubitemid 126375914)
26. O Etiler B Toklu M Atak J Wilson 2004 A genetic algorithm for flow shop scheduling problems J Oper Res Soc 55 830 835 1060.90035 10.1057/palgrave.jors. 2601766
27. R Ruiz C Maroto J Alcaraz 2006 Two new robust genetic algorithms for the flowshop scheduling problem Omega-Int J Manage S 34 461 476 10.1016/j.omega. 2004.12.006 (Pubitemid 43046058)
28. BT Zhang JJ Kim 2000 Comparison of selection methods for evolutionary optimization Evolutionary Optimization an International Journal 2 1 55 70
29. Sivanandam SN, Deepa SN (2008) Introduction to genetic algorithms. Springer, Berlin
30. M Nawaz E Enscore I Ham 1983 A heuristic algorithm for the m-machine, n-machine flow shop sequencing problem Omega 11 91 95 10.1016/0305-0483(83) 90088-9 (Pubitemid 13193807)
31. S Turner D Booth 1987 Comparison of heuristics for flow shop sequencing Int J Manag Sci 15 75 85
32. R Ruiz C Maroto 2005 A comprehensive review and evaluation of permutation flowshop heuristics Eur J Oper Res 165 479 494 2121952 1066.90038 10.1016/j.ejor.2004.04.017 (Pubitemid 40206377)
33. JND Gupta C Koulamas GJ Kyparisis 2006 Perfomance guarantees for flowshop heuristics to minimize makespan Eur J Oper Res 169 865 872 2173997 1079.90052 10.1016/j.ejor.2004.05.034 (Pubitemid 41492020)
34. PJ Kalczynski J Kamburowski 2007 On the NEH heuristic for minimizing the makespan in permutation flowshops Omega-Int J Manage S 35 1 53 60 10.1016/j.omega.2005.03.003 (Pubitemid 44309355)
35. J Carlier 1978 Ordonnancements a contraintes disjunctives, RAIRO Recherche operations Elle Oper Res 12 333 351 516514 0401.90052