Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics

European Journal of Operational Research

Volumn 165, Issue 1, 2005, Pages 34-54

  Ruiz, Rubén ^a   Maroto, Concepción ^a   Alcaraz, Javier ^a  

^a UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

Author keywords

Genetic algorithms; Local search; Scheduling; Sequence dependent setup times

Indexed keywords

BENCHMARKING; CERAMIC PRODUCTS; CODES (STANDARDS); GENETIC ALGORITHMS; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; PRODUCTION CONTROL; TILE;

DESIGN OF EXPERIMENTS (DOE); LOCAL SEARCH; PARALLEL MACHINES; SEQUENCE DEPENDENT SETUP TIMES;

SCHEDULING;

EID: 12344285964     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2004.01.022     Document Type: Article

References (41)

1. Alcaraz J., Maroto C. A robust genetic algorithm for resource allocation in project scheduling. Annals of Operations Research. 102:2001;83-109
2. Alcaraz J., Maroto C., Ruiz R. Solving the multi-mode resource-constrained project scheduling problem with genetic algorithms. Journal of the Operational Research Society. 54(6):2003;614-626
3. Aldowaisan T., Allahverdi A. New heuristics for no-wait flowshops to minimize makespan. Computers and Operations Research. 30:2003;1219-1231
4. Allahverdi A., Gupta J.N.D., Aldowaisan T. A review of scheduling research involving setup considerations. OMEGA, The international Journal of Management Science. 27:1999;219-239
5. Campbell H.G., Dudek R.A., Smith M.L. A heuristic algorithm for the. n job, m machine sequencing problem Management Science. 16(10):1970;B630-B637
6. Chen C.-L., Vempati V.S., Aljaber N. An application of genetic algorithms for flow shop problems. European Journal of Operational Research. 80:1995;389-396
7. Cheng T.C.E., Gupta J.N.D., Wang G. A review of flowshop scheduling research with setup times. Production and Operations Management. 9(3):2000;262-282
8. Conway R.W., Maxwell W.L., Miller L.W. Theory of Scheduling. 1967;Addison-Wesley, Reading, MA
9. Corwin B.D., Esogbue A.O. Two machine flow shop scheduling problems with sequence dependent setup times: A dynamic programming approach. Naval Research Logistics Quarterly. 21:1974;515-524
10. Das S.R., Gupta J.N.D., Khumawala B.M. A savings index heuristic algorithm for flowshop scheduling with sequence dependent set-up times. Journal of the Operational Research Society. 46:1995;1365-1373
11. Garey M.R., Johnson D.S., Sethi R. The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research. 1(2):1976;117-129
12. Goldberg D.E. Genetic Algorithms in Search, Optimization and Machine Learning. 1989;Addison-Wesley, Reading, MA
13. Graham R.L., Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G. Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics. 5:1979;287-326
14. Gupta J.N.D. A search algorithm for the generalized flowshop scheduling problem. Computers & Operations Research. 2:1975;83-90
15. Gupta J.N.D. Flowshop schedules with sequence dependent setup times. Journal of the Operational Research Society of Japan. 29(3):1986;206-219
16. Gupta J.N.D., Darrow W.P. The two-machine sequence dependent flowshop scheduling problem. European Journal of Operational Research. 24:1986;439-446
17. Johnson S.M. Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly. 1:1954;61
18. Michalewicz Z. Genetic Algorithms. + Data Structures=Evolution Programs third ed.:1996;Springer-Verlag, Berlin
19. Murata T., Ishibuchi H., Tanaka H. Genetic algorithms for flowshop scheduling problems. Computers and Industrial Engineering. 30(4):1996;1061-1071
20. Nawaz M., Enscore E.E. Jr., Ham I. A heuristic algorithm for the. m -machine, n -job flow-shop sequencing problem OMEGA, The International Journal of Management Science. 11(1):1983;91-95
21. Osman I.H., Potts C.N. Simulated annealing for permutation flow-shop scheduling. OMEGA, The International Journal of Management Science. 17(6):1989;551-557
22. Parthasarathy S., Rajendran C. An experimental evaluation of heuristics for scheduling in a real-life flowshop with sequence-dependent setup times of jobs. International Journal of Production Economics. 49:1997;255-263
23. Pinedo M. Scheduling: Theory, Algorithms and Systems. second ed.:2002;Prentice-Hall, New Jersey
24. Reeves C.R. A genetic algorithm for flowshop sequencing. Computers and Operations Research. 22(1):1995;5-13
25. Ríos-Mercado R.Z., Bard J. Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups. Computers and Operations Research. 25(5):1998;351-366
26. Ríos-Mercado R.Z., Bard J. Heuristics for the flow line problem with setup costs. European Journal of Operational Research. 110:1998;76-98
27. Ríos-Mercado R.Z., Bard J. A branch-and-bound algorithm for permutation flow shops with sequence-dependent setup times. IEE Transactions. 31:1999;721-731
28. Ríos-Mercado R.Z., Bard J. An enhanced TSP-based heuristic for makespan minimization in a flow shop with setup times. Journal of Heuristics. 5:1999;53-70
29. Ruiz, R., Maroto, C., 2004. A comprehensive review and evaluation of permutation flowshop heuristics. European Journal of Operational Research (to appear)
30. Ruiz, R., Maroto, C., Alcaraz, J., 2003. Two new robust genetic algorithms for the flowshop scheduling problem. Technical Report, Universidad Politécnica de Valencia, Valencia, España, Grupo de Investigatión Operativa GIO. OMEGA, The International Journal of Management Science (submitted)
31. Simons J. Jr. Heuristics in flow shop scheduling with sequence dependent setup times. OMEGA, The International Journal of Management Science. 20(2):1992;215-225
32. Srikar B.N., Ghosh S. A MILP model for the. n -job M -stage flowshop with sequence dependent set-up times International Journal of Production Research. 24(6):1986;1459-1474
33. Stafford E.F. Jr., Tseng F.T. On the Srikar-Ghosh MILP model for the. N×M SDST flowshop problem International Journal of Production Research. 28(10):1990;1817-1830
34. Stützle, T., 1998. Applying iterated local search to the permutation flow shop problem. Technical Report, TU Darmstadt, AIDA-98-04, FG Intellektik
35. Szwarc W., Gupta J.N.D. A flow-shop problem with sequence-dependent additive setup times. Naval Research Logistics Quarterly. 34:1987;619-627
36. Taillard E. Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operational Research. 47:1990;67-74
37. Taillard E. Benchmarks for basic scheduling problems. European Journal of Operational Research. 64:1993;278-285
38. Tseng F.T., Stafford E.E. Jr. Two MILP models for the. N×M SDST flowshop sequencing problem International Journal of Production Research. 39(8):2001;1777-1809
39. Vallada, E., Ruiz, R., Maroto, C., 2003. Synthetic and real benchmarks for complex flow-shop problems. Technical Report, Universidad Politécnica de Valencia, Valencia, España, Grupo de Investigatión Operativa GIO
40. Widmer M., Hertz A. A new heuristic method for the flow shop sequencing problem. European Journal of Operational Research. 41:1989;186-193
41. Yang W.-H., Liao C.-J. Survey of scheduling research involving setup times. International Journal of Systems Science. 30(2):1999;143-155