Solving multi-objective SDST flexible flow shop using GRASP algorithm

International Journal of Advanced Manufacturing Technology

Volumn 44, Issue 7-8, 2009, Pages 737-747

  Davoudpour, Hamid ^a   Ashrafi, Maryam ^a  

^a AMIRKABIR UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

Assignable due dates; Controllable processing times; GRASP; Hybrid flow shop scheduling; Sequence dependent setup times

Indexed keywords

ASSIGNABLE DUE DATES; CONTROLLABLE PROCESSING TIMES; GRASP; HYBRID FLOW SHOP SCHEDULING; SEQUENCE-DEPENDENT SETUP TIMES;

OPTIMIZATION;

MACHINE SHOP PRACTICE;

EID: 69649083513     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-008-1887-5     Document Type: Article

References (27)

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 11 127
2. Pinedo M (1995) Scheduling: theory, algorithms and applications. Prentice-Hall, Englewood Cliffs, pp 9-14
3. TCE Cheng MC Gupta 1989 Survey of scheduling research involving due date determination decisions Eur J Oper Res 38 156 166
4. JND Gupta K Kruger V Lauff F Werner YN Sotskov 2002 Heuristics for hybrid flow shops with controllable processing times and assignable due dates Comput Oper Res 29 1417 1439
5. V Gordon J-M Proth C Chu 2002 A survey of the state-of-the-art of common due date assignment and scheduling research Eur J Oper Res 139 1 25 (Pubitemid 34153934)
6. Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, Oxford
7. JND Gupta 1988 Two-stage, hybrid flow shop scheduling problem J Oper Res Soc 38 359 364
8. JA Hoogeveen JK Lenstra B Veltman 1996 Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard Eur J Oper Res 89 172 175
9. Leung JY-T (2006) Handbook of scheduling: algorithms, models, and performance analysis. Chapman & Hall/CRC, Boca Raton
10. R Linn W Zhang 1999 Hybrid flow shop scheduling: a survey Comput Ind Eng 37 57 61
11. A Vignier, et al. 1996 Resolution of some 2-stage hybrid flow shop scheduling problems IEEE Int Conf Syst Man Cybern 4 2934 2941
12. JND Gupta EA Tunc 1991 Schedules for a two stage hybrid flow shop with parallel machines at the second stage Int J Prod Res 29 1489 1502
13. TS Arthanari KG Ramamurthy 1971 An extension of two machines sequencing problem Oper Res 8 10 22
14. H Allaoui A Artiba 2004 Integrating simulation and optimization to schedule hybrid flow-shop with maintenance constraint Comput Ind Eng 47 431 450
15. O Engin A Doyen 2004 A new approach to solve hybrid flow shop scheduling problem by artificial immune system Fut Gener Comput Syst 20 1083 1095
16. V Botta-Genoulaz 2000 Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness Int J Prod Econ 64 101 111
17. A Janiak E Kozan M Lichtenstein C Oguz 2007 Metaheuristics approaches to the hybrid flow shop scheduling problem with a cost-related criterion Int J Prod Econ 105 407 424
18. R Ruiz T Stützle 2006 An Iterated Greedy heuristic for the sequence dependent setup times flow shop problem with makespan and weighted tardiness objectives Eur J Oper Res 187 3 1143 1159
19. V Amaral Armentano M Felizardo de França Filho 2007 Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach Eur J Oper Res 183 100 114
20. PS Ow TE Morton 1989 The single machine early/tardy problem Manage Sci 35 177 191
21. Y Park S Kim Y-H Lee 2000 Scheduling jobs on parallel machines applying neural network and heuristic rules Comput Ind Eng 38 189 202
22. Montgomery DC (2000) Design and analysis of experiments, 5th edn. Wiley, New York
23. Monden Y (1983) Toyota production system. Institute of Industrial Engineering Press, Norcross, Georgia
24. Salvador MS (1973) A solution to a special case of flow shop scheduling problems. In: Elmaghraby SE (ed) Symp Theory Sched Appl pp 83-91. New York, Springer-Verlag
25. SA Brah JL Hunsucker 1991 Branch and bond algorithm for the flow shop with multi processors Eur J Oper Res 51 88 99
26. JL Hunsucker SA Brah 1994 Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment Eur J Oper Res 72 102 114
27. B Alidaee G Kochenberger 1996 A framework for machine scheduling problems with controllable processing times J Prod Oper Manage 5 4 391 405 (Pubitemid 126499545)