Some effective heuristics for no-wait flowshops with setup times to minimize total completion time

Annals of Operations Research

Volumn 156, Issue 1, 2007, Pages 143-171

  Ruiz, Rubén ^a   Allahverdi, Ali ^b  

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

^b KUWAIT UNIVERSITY   (Kuwait)

Author keywords

Flowshop; No wait; Setup times; Stochastic local search; Total flowtime

Indexed keywords

EID: 34548667975     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-007-0227-8     Document Type: Article

References (44)

1. Aldowaisan, T. (2001). A new heuristic and dominance relations for no-wait flowshops with setups. Computers & Operations Research, 28(6), 563-584.
2. Aldowaisan, T., & Allahverdi, A. (1998). Total flowtime in no-wait flowshops with separated setup times. Computers & Operations Research, 25(9), 757-765.
3. Aldowaisan, T., & Allahverdi, A. (2003). New heuristics for no-wait flowshops to minimize makespan. Computers & Operations Research, 30(8), 1219-1231.
4. Allahverdi, A. (2000). Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times. Computers & Operations Research, 27(2), 111-127.
5. Allahverdi, A., & Aldowaisan, T. (2000). No-wait and separate setup three-machine flowshop with total completion time criterion. International Transactions in Operational Research, 7(3), 245-264.
6. Allahverdi, A., Gupta, J. N. D., & Aldowaisan, T. (1999). A review of scheduling research involving setup considerations. Omega-International Journal of Management Science, 27(2), 219-239.
7. Baker, K. R. (1974). Introduction to sequencing and scheduling. New York: Wiley.
8. Bonney, M. C., & Gundry, S. W. (1976). Solutions to constrained flowshop sequencing problem. Operational Research Quarterly, 27(4), 869-883.
9. Brown, S. I., McGarvey, R., & Ventura, J. A. (2004). Total flowtime and makespan for a no-wait m-machine flowshop with set-up times separated. Journal of the Operational Research Society, 55(6), 614-621.
10. Chen, C. L., Neppalli, R. V., & Aljaber, N. (1996). Genetic algorithms applied to the continuous flow shop problem. Computers & Industrial Engineering, 30(4), 919-929.
11. Cheng, T. C. E., Gupta, J. N. D., & Wang, G. Q. (2000). A review of flowshop scheduling research with setup times. Production and Operations Management, 9(3), 262-282.
12. Dileepan, P., & Sen, T. (1991). Job lateness in a two-machine flowshop with setup times separated. Computers & Operations Research, 18(6), 549-556.
13. Dudek, R. A., Panwalkar, S. S., & Smith, M. L. (1992). The lessons of flowshop scheduling research. Operations Research, 40(1), 7-13.
14. Gangadharan, R., & Rajendran, C. (1993). Heuristic algorithms for scheduling in the no-wait flowshop. International Journal of Production Economics, 32(3), 285-290.
15. Garey, M. R., Johnson, D. S., & Sethi, R. (1976). The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research, 1(2), 117-129.
16. Grabowski, J., & Pempera, J. (2005). Some local search algorithms for no-wait flow-shop problem with makespan criterion. Computers & Operations Research, 32(8), 2197-2212.
17. Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5, 287-326.
18. Gupta, J. N. D. (1976). Optimal flowshop schedules with no intermediate storage space. Naval Research Logistics, 23(2), 235-243.
19. Gupta, J. N. D., Strusevich, V. A., & Zwaneveld, C. M. (1997). Two-stage no-wait scheduling models with setup and removal times separated. Computers & Operations Research, 24(11), 1025-1031.
20. Hall, N. G., & Sriskandarajah, C. (1996). A survey of machine scheduling problems with blocking and no-wait in process. Operations Research, 44(3), 510-525.
21. Hoos, H. H., & Stützle, T. (2005). Stochastic local search: foundations and applications. San Francisco: Kaufmann.
22. King, J. R., & Spachis, A. S. (1980). Heuristics for flowshop scheduling. International Journal of Production Research, 18(3), 345-357.
23. Liesegan, G., & Ruger, M. (1972). Flow-shop sequencing problem with no wait in process. Operational Research Quarterly, 23(4), 591-598.
24. Lourenço, H. R., Martin, O. C., & Stützle, T. (2003). Iterated local search. In F. Glover & G. A. Kochenberger (Eds.), Handbook of metaheuristics (pp. 321-353). Boston: Kluwer Academic.
25. Nawaz, M., Enscore, E. E. Jr., & Ham, I. (1983). A heuristic algorithm for the m machine, n job flowshop sequencing problem. Omega-International Journal of Management Science, 11(1), 91-95.
26. Osman, I. H., & Potts, C. N. (1989). Simulated annealing for permutation flowshop scheduling. Omega-International Journal of Management Science, 17(6), 551-557.
27. Pinedo, M. (2002). Scheduling: theory, algorithms, and systems (2nd edn.). Upper Saddle River: Prentice-Hall.
28. Proust, C., Gupta, J. N. D., & Deschamps, V. (1991). Flowshop scheduling with set-up, processing and removal times separated. International Journal of Production Research, 29(3), 479-493.
29. Rajendran, C. (1994). A no-wait flowshop scheduling heuristic to minimize makespan. Journal of the Operational Research Society, 45(4), 472-478.
30. Rajendran, C., & Chaudhuri, D. (1990). Heuristic algorithms for continuous flowshop problem. Naval Research Logistics, 37(5), 695-705.
31. Rajendran, C., & Ziegler, H. (1997). Heuristics for scheduling in a flowshop with setup, processing and removal times separated. Production Planning & Control, 8(6), 568-576.
32. Röck, H. (1984a). Some new results in flow shop scheduling. Mathematical Methods of Operations Research (ZOR), 28(1), 1-16.
33. Röck, H. (1984b). The three-machine no-wait flow shop is NP-complete. Journal of the ACM, 31(2), 336-345.
34. Ruiz, R., & Maroto, C. (2005). A comprehensive review and evaluation of permutation flowshop heuristics. European Journal of Operational Research, 165(2), 479-494.
35. Ruiz, R., & Stützle, T. (2007). A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research, 177(3), 2033-2049.
36. Ruiz, R., Maroto, C., & Alcaraz, J. (2005). Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics. European Journal of Operational Research, 165(1), 34-54.
37. Shyu, S. J., Lin, B. M. T., & Yin, P. Y. (2004). Application of ant colony optimization for no-wait flowshop scheduling problem to minimize the total completion time. Computers & Industrial Engineering, 47(2-3), 181-193.
38. Sidney, J. B., Potts, C. N., & Sriskandarajah, C. (2000). A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups. Operations Research Letters, 26(4), 165-173.
39. Stützle, T. (1998). Applying iterated local search to the permutation flow shop problem. AIDA-98-04, FG Intellektik, TU Darmstadt.
40. Sule, D. R. (1982). Sequencing n jobs on two machines with setup, processing and removal times separated. Naval Research Logistics, 29(3), 517-519.
41. Sule, D. R., & Huang, K. Y. (1983). Sequency on two and three machines with setup, processing and removal times separated. International Journal of Production Research, 21(5), 723-732.
42. Watson, J. P., Barbulescu, L., Whitley, L. D., & Howe, A. E. (2002). Contrasting structured and random permutation flow-shop scheduling problems: search-space topology and algorithm performance. INFORMS Journal on Computing, 14(2), 98-123.
43. Wismer, D. A. (1972). Solution of flowshop-scheduling problem with no intermediate queues. Operations Research, 20(3), 689-697.
44. Yoshida, T., & Hitomi, K. (1979). Optimal 2-stage production scheduling with setup times separated. AIIE Transactions, 11(3), 261-263.