Algorithms for a realistic variant of flowshop scheduling

Computers and Operations Research

Volumn 37, Issue 2, 2010, Pages 236-246

  Naderi, B ^a   Ruiz, Rubén ^b   Zandieh, M ^c  

^a AMIRKABIR UNIVERSITY OF TECHNOLOGY   (Iran)

^b INSTITUTO TECNOLÓGICO DE INFORMÁTICA   (Spain)

^c SHAHID BEHESHTI UNIVERSITY   (Iran)

Author keywords

Dynamic dispatching rule heuristic; Hybrid flexible flowshops; Iterated local search metaheuristic; Scheduling; Sequence dependent setup times

Indexed keywords

DISPATCHING RULES; FLEXIBLE FLOWSHOP; FLOW-SHOP SCHEDULING; FLOW-SHOPS; HYBRID FLEXIBLE FLOWSHOPS; HYBRID FLOW SHOP; ITERATED LOCAL SEARCH; ITERATED LOCAL SEARCH METAHEURISTIC; JOB SEQUENCES; MAKESPAN MINIMIZATION; METAHEURISTIC; OPTIMIZATION CRITERIA; PARALLEL MACHINE; PARALLEL MACHINE PROBLEMS; SEQUENCE DEPENDENT SETUP TIMES; SEQUENCE DEPENDENT SETUPS; SINGLE MACHINES;

HEURISTIC ALGORITHMS; HEURISTIC METHODS; OPTIMIZATION;

SCHEDULING ALGORITHMS;

EID: 69749098025     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2009.04.017     Document Type: Article

References (38)

1. Pinedo M. Scheduling: theory, algorithms, and systems. 2nd ed (2002), Prentice-Hall, Upper Saddle, NJ
2. Dudek R.A., Panwalkar S.S., and Smith M.L. The lessons of flowshop scheduling research. Operations Research 40 1 (1992) 7-13
3. Ruiz R., and Maroto C. A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility. European Journal of Operational Research 169 3 (2006) 781-800
4. Allahverdi A., Gupta J.N.D., and Aldowaisan T. A review of scheduling research involving setup considerations. Omega-International Journal of Management Science 27 2 (1999) 219-239
5. Allahverdi A., Ng C.T., Cheng T.C.E., and Kovalyov M.Y. A survey of scheduling problems with setup times or costs. European Journal of Operational Research 187 3 (2008) 985-1032
6. Graham R.L., Lawler E.L., Lenstra J.K., and Rinnooy Kan A.H.G. Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics 5 (1979) 287-326
7. Haouari M., and Ladhari T. A branch-and-bound-based local search method for the flow shop problem. Journal of the Operational Research Society 54 10 (2003) 1076-1084
8. Ríos-Mercado R.Z., and Bard J.F. A branch-and-bound algorithm for permutation flow shops with sequence-dependent setup times. IIE Transactions 31 8 (1999) 721-731
9. Ríos-Mercado R.Z., and Bard J.F. The flow shop scheduling polyhedron with setup times. Journal of Combinatorial Optimization 7 3 (2003) 291-318
10. Allahverdi A., and Soroush H.M. The significance of reducing setup times/setup costs. European Journal of Operational Research 187 3 (2008) 978-984
11. Vignier A., Billaut J.-C., and Proust C. Les problèmes d'ordonnancement de type flow-shop hybride: État de l'art. RAIRO Recherche Operationnelle 33 2 (1999) 117-183
12. Ruiz R., Sivrikaya Serifoglu F., and Urlings T. Modeling realistic hybrid flexible flowshop scheduling problems. Computers & Operations Research 35 4 (2008) 1151-1175
13. Gupta J.N.D. Two-stage, hybrid flowshop scheduling problem. Journal of the Operational Research Society 39 4 (1988) 359-364
14. Kurz M.E., and Askin R.G. Comparing scheduling rules for flexible flow lines. International Journal of Production Economics 85 3 (2003) 371-388
15. Kurz M.E., and Askin R.G. Scheduling flexible flow lines with sequence-dependent setup times. European Journal of Operational Research 159 1 (2004) 66-82
16. Zandieh M., Ghomi S.M.T.F., and Husseini S.M.M. An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times. Applied Mathematics and Computation 180 1 (2006) 111-127
17. Johnson S.M. Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly 1 1 (1954) 61-68
18. Linn R., and Zhang W. Hybrid flow shop scheduling: a survey. Computers & Industrial Engineering 37 1-2 (1999) 57-61
19. Kis T., and Pesch E. A review of exact solution methods for the non-preemptive multiprocessor flowshop problem. European Journal of Operational Research 164 3 (2005) 592-608
20. Haouari M., and Hidri L. On the hybrid flowshop scheduling problem. International Journal of Production Economics 113 1 (2008) 495-497
21. Jin Z.H., Yang Z., and Ito T. Metaheuristic algorithms for the multistage hybrid flowshop scheduling problem. International Journal of Production Economics 100 2 (2006) 322-334
22. Quadt D., and Kuhn H. A taxonomy of flexible flow line scheduling procedures. European Journal of Operational Research 178 3 (2007) 686-698
23. Jungwattanakit J., Reodecha M., Chaovalitwongse P., and Werner F. Algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria. International Journal of Advanced Manufacturing Technology 37 3-4 (2008) 354-370
24. Jungwattanakit J., Reodecha M., Chaovalitwongse P., and Werner F. A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria. Computers & Operations Research 36 (2009) 358-378
25. Naderi B., Zandieh M., and Roshanaei V. Scheduling hybrid flowshops with sequence dependent setup times to minimize makespan and maximum tardiness. International Journal of Advanced Manufacturing Technology 41 (2009) 1186-1198
26. Hoos H.H., and Stützle T. Stochastic local search: foundations and applications (2005), Morgan Kaufmann, San Francisco, CA
27. Stützle T. Applying iterated local search to the permutation flow shop problem. Technical Report AIDA-98-04, FG Intellektik, TU Darmstadt; 1998.
28. Ruiz R., and Maroto C. A comprehensive review and evaluation of permutation flowshop heuristics. European Journal of Operational Research 165 2 (2005) 479-494
29. Ruiz R., and Stutzle T. A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research 177 3 (2007) 2033-2049
30. Ruiz R., and Stützle T. An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives. European Journal of Operational Research 187 3 (2008) 1143-1159
31. Lourenço H.R., Martin O.C., and Stützle T. Iterated local search. In: Glover F., and Kochenberger G.A. (Eds). Handbook of metaheuristics (2003), Kluwer Academic Publishers, Boston 321-353
32. Essafi I., Mati Y., and Dauzère-Pérès S. A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem. Computers & Operations Research 35 8 (2008) 2599-2616
33. Bean J.C. Genetic algorithms and random keys for sequencing and optimization. INFORMS Journal on Computing 6 2 (1994) 154-160
34. Norman B.A., and Bean J.C. A genetic algorithm methodology for complex scheduling problems. Naval Research Logistics 46 2 (1999) 199-211
35. Nawaz M., Enscore Jr. E.E., and Ham I. A heuristic algorithm for the m-machine, n-job flowshop sequencing problem. Omega-International Journal of Management Science 11 1 (1983) 91-95
36. Montgomery D.C. Design and analysis of experiments. 6th ed. (2005), Wiley, Hoboken, NJ
37. Ruiz R., Maroto C., and Alcaraz J. Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics. European Journal of Operational Research 165 1 (2005) 34-54
38. Ruiz R., Maroto C., and Alcaraz J. Two new robust genetic algorithms for the flowshop scheduling problem. Omega-International Journal of Management Science 34 5 (2006) 461-476