Solving a new mathematical model for a hybrid flow shop scheduling problem with a processor assignment by a genetic algorithm

International Journal of Advanced Manufacturing Technology

Volumn 61, Issue 1-4, 2012, Pages 339-349

  Ziaeifar, Amin ^a   Tavakkoli Moghaddam, Reza ^a   Pichka, Khosro ^b  

^a UNIVERSITY OF TEHRAN   (Iran)

^b TAFRESH UNIVERSITY   (Iran)

Author keywords

Genetic algorithm; Hybrid flow shop scheduling; Identical processors; Makespan

Indexed keywords

HARD PROBLEMS; HYBRID FLOW SHOP SCHEDULING; MAKESPAN; NEW MATHEMATICAL MODEL; PROCESSOR ASSIGNMENTS; TEST PROBLEM; UNLIMITED INTERMEDIATE STORAGES;

HEURISTIC ALGORITHMS; SCHEDULING; SCHEDULING ALGORITHMS;

GENETIC ALGORITHMS;

EID: 84862569607     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-011-3701-z     Document Type: Article

References (32)

1. A Vignier JC Billaut C Proust 1999 Hybrid flowshop scheduling problems: state of the art Rairo-OR 33 2 117 183 1716954 0960.90042 10.1051/ro:1999108 (Pubitemid 32082126)
2. C Andres JM Albarracin G Tormo E Vicens JP Garcia-Sabater 2005 Group technology in a hybrid flowshop environment: a case study Eur J Oper Res 167 1 272 281 2148704 1074.90524 10.1016/j.ejor.2004.03.026 (Pubitemid 40220015)
3. AGP Guinet 1991 Textile production systems: a succession of non-identical parallel processor shops J Oper Res Soc 42 8 655 671 0729.90754
4. A Janiak E Kozan M Lichtenstein C Oguz 2007 Metaheuristic approaches to the hybrid flow shop scheduling problem with a cost-related criterion Int J Prod Econ 105 2 407 424 10.1016/j.ijpe.2004.05.027 (Pubitemid 44827610)
5. K Alaykýran O Engin A Döyen 2007 Using ant colony optimization to solve hybrid flow shop scheduling problems Int J Adv Manuf Technol 35 541 550 10.1007/s00170-007-1048-2 (Pubitemid 350098198)
6. E Rashidi M Jahandar M Zandieh 2010 An improved hybrid multi-objective parallel genetic algorithm for hybrid flow shop scheduling with unrelated parallel machines Int J Adv Manuf Technol 49 1129 1139 10.1007/s00170-009-2475-z
7. Shiau D and Huang Y (2011) A hybrid two-phase encoding particle swarm optimization for total weighted completion time minimization in proportionate flexible flow shop scheduling. Int J Adv Manuf Technol. doi: 10.1007/s00170-011-3378-3
8. SA Brah JL Hunsucker 1991 Branch and bound algorithm for the flow-shop with multiple processors Eur J Oper Res 51 1 88 99 0732.90040 10.1016/0377-2217(91)90148-O (Pubitemid 21730851)
9. DL Santos JL Hunsucker DE Deal 1995 Flow multi permutation sequences for flow shops with multiple processors J Inf Optim Sci 16 2 351 366 0861.90076 (Pubitemid 126039399)
10. DL Santos JL Hunsucker DE Deal 1995 Global lower bounds for flow shops with multiple processors Eur J Oper Res 80 1 112 120 0927.90052 10.1016/0377-2217(93)E0326-S
11. AGP Guinet MM Solomon PK Kedia A Dussauchoy 1996 A computational study of heuristics for two-stage flexible flowshops Int J Prod Res 34 5 1399 1415 0947.90540 10.1080/00207549608904972 (Pubitemid 126525266)
12. TJ Sawik 2000 Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers Math Comput Model 31 13 39 52 1773136 0969.90048 10.1016/S0895-7177(00)00110-2 (Pubitemid 30597595)
13. TJ Sawik 2002 An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers Math Comput Model 36 4-5 461 471 1928602 1052.90038 10.1016/S0895-7177(02)00176-0
14. ME Kurz RG Askin 2003 Comparing scheduling rules for flexible flow lines Int J Prod Econ 85 3 371 388 10.1016/S0925-5273(03)00123-3
15. R Ruiz FS Serifoglu T Urlings 2008 Modeling realistic hybrid flexible flowshop scheduling problems Comput Oper Res 35 4 1151 1175 1180.90135 10.1016/j.cor.2006.07.014 (Pubitemid 47404765)
16. C Paternina-Arboleda J Montoya-Torres M Acero-Dominguez M Herrera-Hernandez 2008 Scheduling jobs on a k-stage flexible flow-shop Ann Oper Res 164 1 29 40 2470717 1169.90360 10.1007/s10479-007-0257-2
17. J Jungwattanakit M Reodecha P Chaovalitwongse F Werner 2009 A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria Comput Oper Res 36 2 358 378 2579925 1157.90417 10.1016/j.cor.2007.10.004
18. R Tavakkoli-Moghaddam N Safaei F Sassani 2009 A memetic algorithm for the flexible flow line scheduling problem with processor blocking Comput Oper Res 36 2 402 414 2579928 1157.90428 10.1016/j.cor.2007.10.011
19. D Cao M Chen G Wan 2005 Parallel machine selection and job scheduling to minimize machine cost and job tardiness Comput Oper Res 32 1995 2012 1068.90054 10.1016/j.cor.2004.01.001
20. R Linn W Zhang 1999 Hybrid flow shop scheduling: a survey Comput Ind Eng 37 1-2 57 61 10.1016/S0360-8352(99)00023-6
21. T Kis E Pesch 2005 A review of exact solution methods for the non-preemptive multiprocessor flowshop problem Eur J Oper Res 164 3 592 608 2114751 1057.90015 10.1016/j.ejor.2003.12.026 (Pubitemid 40114584)
22. R Ruiz JA Vazquez-Rodriguez 2010 The hybrid flow shop scheduling problem Eur J Oper Res 205 1 18 2592645 1188.90110 10.1016/j.ejor.2009.09.024
23. I Ribas R Leisten JM Framinan 2010 Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective Comput Oper Res 37 1439 1454 2578212 1183.90189 10.1016/j.cor.2009.11.001
24. JND Gupta 1988 Two-stage, hybrid flow shop scheduling problem J Oper Res Soc 39 4 359 364 0639.90049
25. ZX Guo WK Wong SYS Leung JT Fan SF Chan 2008 A genetic-algorithm-based optimization model for scheduling flexible assembly lines Int J Adv Manuf Technol 36 156 158 10.1007/s00170-006-0818-6 (Pubitemid 351214894)
26. S Bertel JC Billaut 2004 A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation Eur J Oper Res 159 3 651 662 2078861 1065.90032 10.1016/S0377-2217(03)00434-X
27. F Jolai S Sheikh M Rabbani B Karimi 2009 A genetic algorithm for solving no-wait flexible flow lines with due window and job rejection Int J Adv Manuf Technol 42 523 532 10.1007/s00170-008-1618-y
28. C Oguz M Ercan 2005 A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks J Sched 8 4 323 351 2149893 1123.90314 10.1007/s10951-005-1640-y (Pubitemid 40878783)
29. R Ruiz C Maroto 2006 A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility Eur J Oper Res 169 3 781 800 2173993 1079.90061 10.1016/j.ejor.2004.06.038 (Pubitemid 41492016)
30. L Wanga L Zhang DZ Zheng 2006 An effective hybrid genetic algorithm for flow shop scheduling with limited buffers Comput Oper Res 33 2960 2971 2222803 10.1016/j.cor.2005.02.028 (Pubitemid 43199834)
31. DF Shiau SC Cheng YM Huang 2008 Proportionate flexible flow shop scheduling via a hybrid constructive genetic algorithm Expert Syst Appl 34 2 1133 1143 10.1016/j.eswa.2006.12.002 (Pubitemid 350117483)
32. V Yaurima L Burtseva A Tchernykh 2009 Hybrid flowshop with unrelated machines, sequence-dependent setup time, availability constraints and limited buffers Comput Ind Eng 56 4 1452 1463 10.1016/j.cie.2008.09.004