Scheduling hybrid flowshops with sequence dependent setup times to minimize makespan and maximum tardiness

International Journal of Advanced Manufacturing Technology

Volumn 41, Issue 11-12, 2009, Pages 1186-1198

  Naderi, B ^a   Zandieh, M ^b   Roshanaei, V ^a  

^a AMIRKABIR UNIVERSITY OF TECHNOLOGY   (Iran)

^b SHAHID BEHESHTI UNIVERSITY   (Iran)

Author keywords

Hybrid flowshops; Local search; Makespan; Maximum tardiness; Scheduling; Sequence dependent setup time; Simulated annealing; Taguchi method

Indexed keywords

ANNEALING; BENCHMARKING; SCHEDULING; SCHEDULING ALGORITHMS; TAGUCHI METHODS;

HYBRID FLOWSHOPS; LOCAL SEARCH; MAKESPAN; MAXIMUM TARDINESS; SEQUENCE DEPENDENT SETUP TIME;

SIMULATED ANNEALING;

EID: 63449107983     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-008-1569-3     Document Type: Article

References (39)

1. M Zandieh SMT Fatemi Ghomi SM Moattar Husseini 2006 An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times Appl Math Comput 180 111 127
2. Baker KR (1974) Introduction to sequence and scheduling. Wiley, New York
3. R Ruiz C Maroto 2006 A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility Eur J Oper Res 169 781 800
4. Conway RW, Maxwell WL (1967) Theory of scheduling. Addison-Wesley, Boston
5. Sule DR (1997) Industrial scheduling. PWS, Boston
6. PB Luh L Gou Y Zhang T Nagahora M Tsuji K Yoneda T Hasegawa Y Kyoya T Kano 1998 Job shop scheduling with group dependent setups, finite buffers, and long time horizon Annal Opns Res 76 233 259
7. JND Gupta 1988 Two-stage hybrid flowshop scheduling problem J Oper Res Soc 39 4 359 364
8. EYK Ng EWK Ng 2006 Parametric study of the biopotential equation for breast tumors identification using ANOVA and Taguchi method Med Biol Eng Comput 44 131 139
9. Jungwattanakit J, Reodecha M, Chaovalitwongse P, Werner F (2007) Algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria. Int J Adv Manuf Technol, doi: 10.1007/s00170-007-0977-0
10. F Luo H Sun T Geng N Qi 2008 Application of Taguchi's method in the optimization of bridging efficiency between confluent and fresh micro carriers in bead-to-bead transfer of Vero cells Biotechnol Lett 30 4 645 649
11. BW Cheng CL Chang 2007 A study on flowshop scheduling problem combining Taguchi experimental design and genetic algorithm Expert Syst Appl 32 415 421
12. R Caprihan S Wadhwa 2005 Scheduling of FMSs with information delays: a simulation study Int J Flex Manuf Syst 17 39 65
13. R Ruiz A Allahverdi 2007 Some effective heuristics for no-wait flowshops with setup times to minimize total completion time Ann Oper Res 156 143 171
14. R Ruiz T Stützle 2008 An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives Eur J Oper Res 187 3 1143 1159
15. SM Johnson 1954 Optimal two and three-stage production schedules with setup times included Nav Res Logist Q 1 61 67
16. T Yoshida K Hitomi 1979 Optimal two-stage production with setup times separated AIIE Trans 11 261 263
17. JND Gupta WP Darrow 1986 The two-machine sequence dependent flow shop scheduling problem Eur J Oper Res 24 3 439 446
18. ME Kurz RG Askin 2003 Comparing scheduling rules for flexible flow lines Int J Prod Econ 85 371 388
19. ME Kurz RG Askin 2004 Scheduling flexible flow lines with sequence-dependent setup times Eur J Oper Res 159 1 66 82
20. A Allahverdi CT Ng TCE Cheng YM Kovalyov 2008 A survey of scheduling problems with setup times or costs Eur J Oper Res 187 3 985 1032
21. YD Kim 1993 Heuristics for flow shop scheduling problems minimizing mean tardiness J Oper Res Soc 44 19 28
22. YD Kim HG Lim MW Park 1996 Search heuristics for a flow shop scheduling problem in a printed circuit board assembly process Eur J Oper Res 91 124 143
23. Phadke MS (1989) Quality engineering using robust design. Prentice-Hall, Upper Saddle River
24. B Adenso-Díaz 1996 An SA/TS mixture algorithm for the scheduling tardiness problem Eur J Oper Res 88 516 524
25. E Vallada R Ruiz G Minella 2008 Minimizing total tardiness in the m-machine flowshop problem: a review and evaluation of heuristics and metaheuristics Comput Oper Res 35 4 1350 1373
26. BA Norman JC Bean 1999 A genetic algorithm methodology for complex scheduling problems Nav Res Logist 46 199 211
27. Z Jin Z Yang T Ito 2006 Metaheuristic algorithms for the multistage hybrid flowshop scheduling problem Int J Prod Econ 100 322 334
28. Montgomery DC (2000) Design and analysis of experiments, 5th edn. Wiley, New York
29. R Ruiz C Maroto J Alcaraz 2006 Two new robust genetic algorithms for the flowshop scheduling problem Omega 34 461 476
30. R Ruiz T Stützle 2007 A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem Eur J Oper Res 177 2033 2049
31. Cochran WG, Cox GM (1992) Experimental designs, 2nd edn. Wiley, New York
32. Ross RJ (1989) Taguchi techniques for quality engineering. McGraw-Hill, New York
33. M Lundy A Mees 1986 Convergence of an annealing algorithm Math Program 34 111 124
34. AB Hmida MJ Huguet P Lopez M Haouari 2007 Climbing depth-bounded discrepancy search for solving hybrid flow shop problems Eur J Ind Eng 1 2 223 240
35. JMS Valente 2007 Heuristics for the single machine scheduling problem with early and quadratic tardy penalties Eur J Ind Eng 1 4 431 448
36. X Li N Ye X Xu R Sawhey 2007 Influencing factors of job waiting time variance on a single machine Eur J Ind Eng 1 1 56 73
37. E Rodriguez-Tello JK Hao J Torres-Jimenes 2008 An effective two-stage simulated annealing algorithm for the minimum arrangement problem Comp Oper Res 35 10 3331 3346
38. TH Wu CC Chang SH Chung 2008 A simulated annealing algorithm for manufacturing cell formation problems Expert Syst Appl 34 3 1609 1617
39. S Ramesh V Teegavarapu SP Simonovic 2002 Optimal operation of reservoir systems using simulated annealing Water Resour Manag 16 5 401 428