Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion

European Journal of Operational Research

Volumn 206, Issue 1, 2010, Pages 64-72

  Wang, Chuyang ^a,b   Li, Xiaoping ^a,b   Wang, Qian ^a,b  

^a SOUTHEAST UNIVERSITY   (China)

^b BEIJING UNIVERSITY OF POSTS AND TELECOMMUNICATIONS   (China)

Author keywords

Maximum lateness; Neighborhood; No wait flowshop; Scheduling; Tabu search

Indexed keywords

BASIC OPERATION; CANDIDATE SOLUTION; COMPUTATIONAL EXPERIMENT; FLOW SHOP SCHEDULING PROBLEM; FLOW-SHOP SCHEDULING; MAXIMUM LATENESS; NO-WAIT; NO-WAIT FLOWSHOP; PARTIAL SEQUENCES; SPEED-UPS; TIME COMPLEXITY;

ALGORITHMS;

TABU SEARCH;

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

References (44)

1. Aarts E.H.L., van Laarhoven E.J.M., Lenstra J.K., and Ulder N.L.J. A computational study of local search algorithms for job shop scheduling. ORSA Journal on Computing 6 2 (1994) 118-125
2. Aldowaisan T., and Allahverdi A. New heuristics for no-wait flowshops to minimize makespan. Computers & Operations Research 30 8 (2003) 1219-1231
3. Allahverdi A., and Aldowaisan T. No-wait flowshops with bicriteria of makespan and maximum lateness. European Journal of Operational Research 152 1 (2004) 132-147
4. Bonney M.C., and Gundry S.W. Solutions to the constrained flowshop sequencing problem. Operational Research Quarterly 27 4 (1976) 869-883
5. Chen C.L., Neppalli R.V., and Aljaber N. Genetic algorithms applied to the continuous flowshop problem. Computers & Industrial Engineering 30 (1996) 919-929
6. Dileepan P. A note on minimizing maximum lateness in a two-machine no-wait flowshop. Computers & Operations Research 31 12 (2004) 2111-2115
7. Eksioglu B., Eksioglu S.D., and Jain P. A tabu search algorithm for the flowshop scheduling problem with changing neighborhoods. Computers & Industrial Engineering 54 1 (2008) 1-11
8. Fink A., and Voß S. Solving the continuous flow-shop scheduling problem by metaheuristics. European Journal of Operational Research 151 (2003) 400-414
9. Gangadharan R., and Rajendran C. Heuristic algorithms for scheduling in the no-wait flowshop. International Journal of Production Economics 32 3 (1993) 285-290
10. Glass C.A., and Potts C.N. A comparison of local search methods for flow shop scheduling. Annals of Operations Research 63 4 (1996) 489-509
11. Glover F. Tabu search-Part I. ORSA Journal on Computing 1 3 (1989) 190-206
12. Glover F., and Laguna M. Tabu Search (1997), Kluwer Academic Publishers, Dordrecht
13. Grabowski J., and Pempera J. Sequencing of jobs in some production system. European Journal of Operational Research 125 (2000) 535-550
14. Grabowski J., and Pempera J. Some local search algorithms for no-wait flow-shop problem with makespan criterion. Computers & Operations Research 32 8 (2005) 2197-2212
15. Grabowski J., and Wodecki M. A very fast tabu search algorithm for the flow shop problem with makespan criterion. Computers & Operations Research 11 (2004) 1891-1909
16. 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
17. Hall N.G., and Sriskandarayah C. A survey of machine scheduling problems with blocking and no-wait in process. Operations Research 44 (1996) 510-525
18. Hansen P., and Mladenovic N. Variable neighborhood search; principles and applications. European Journal of Operational Research 130 3 (2001) 449-467
19. Hansen P., Mladenovic N., and Moreno Perez J.A. Variable neighbourhood search; methods and applications. 4OR. A Quarterly Journal of Operations Research 6 4 (2008) 319-360
20. Hasija S., and Rajendran C. Scheduling in flowshops to minimize total tardiness of jobs. International Journal of Production Research 42 (2004) 2289-2301
21. King J.R., and Spachis A.S. Heuristics for flowshop scheduling. International Journal of Production Research 18 3 (1980) 345-357
22. Li X.P., Wang Q., and Wu C. Heuristic for no-wait flow shops with makespan minimization. International Journal of Production Research 46 9 (2008) 2519-2530
23. Martí R., Laguna M., and Glover F. Principles of scatter search. European Journal of Operational Research 169 (2006) 359-372
24. Merz P. Advanced fitness landscape analysis and the performance of memetic algorithms. Evolutionary Computation 12 3 (2004) 303-325
25. Nawaz M., Enscore Jr. E.E., and Ham I. A heuristic algorithm for the m-machine, n-job flow shop sequencing problem. Omega-International Journal of Management Science 11 1 (1983) 91-95
26. Pan Q.K., Tasgetiren M.F., and Liang Y.C. A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem. Computers & Operations Research 35 9 (2008) 2807-2839
27. Potts C.N., and Van Wassenhove L.N. A decomposition algorithm for the single machine total tardiness problem. Operations Research Letters 1 5 (1982) 177-181
28. Raaymakers W., and Hoogeveen J. Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing. European Journal of Operational Research 126 (2000) 131-151
29. Rafter J.A., Abell N.L., and Braselton J.P. Multiple comparison methods for means. SIAM Review 44 2 (2002) 259-278
30. Rajendran C. A no-wait flowshop scheduling heuristic to minimize makespan. Journal of the Operational Research Society 45 (1994) 472-478
31. Rajendran C., and Ziegler H. Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. European Journal of Operational Research 155 2 (2004) 426-438
32. Rardin R.L., and Uzsoy R. Experimental evaluation of heuristic optimization algorithms; a tutorial. Journal of Heuristics 7 (2001) 261-304
33. Reddi S.S., and Ramamoorthy C.V. On the flowshop sequencing problem with no-wait in process. Operational Research Quarterly 23 3 (1972) 323-331
34. Röck H. Some new results in flow shop scheduling. Mathematical Methods of Operations Research 28 1 (1984) 1-16
35. Ruiz R., and Allahverdi A. No-wait flowshop with separate setup times to minimize maximum lateness. International Journal of Advanced Manufacturing Technology 35 5/6 (2007) 551-565
36. Ruiz R., and Allahverdi A. New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness. International Journal of Production Research 47 20 (2009) 5717-5738
37. Ruiz R., and Stützle T. A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research 177 3 (2007) 2033-2049
38. 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
39. Taillard E. Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operational Research 47 1 (1990) 67-74
40. Taillard E. Robust taboo search for the quadratic assignment problem. Parallel Computing 17 (1991) 443-455
41. Taillard E. Comparison of iterative searches for the quadratic assignment problem. Location Science 3 (1995) 87-105
42. Vallada E., Ruiz R., and Minella G. Minimising total tardiness in the m-machine flowshop problem; a review and evaluation of heuristics and metaheuristics. Computers & Operations Research 35 (2008) 1350-1373
43. Wang X.L., and Cheng T.C.E. A heuristic approach for two-machine no-wait flowshop scheduling with due dates and class setups. Computers & Operations Research 33 5 (2006) 1326-1344
44. Wismer D.A. Solution of the flowshop scheduling with no intermediate queues. Operations Research 20 (1972) 689-697