Fast neighborhood search for the single machine earliness-tardiness scheduling problem

Computers and Operations Research

Volumn 37, Issue 8, 2010, Pages 1464-1471

  Kedad Sidhoum, Safia ^a   Sourd, Francis ^a  

^a SORBONNE UNIVERSITÉ   (France)

Author keywords

Earliness tardiness; Iterated local search; Machine scheduling; Neighborhood

Indexed keywords

BLOCK REPRESENTATION; COMPUTATIONAL RESULTS; DUE DATES; EARLINESS-TARDINESS; ITERATED LOCAL SEARCH; MACHINE SCHEDULING; NEIGHBORHOOD SEARCH; ONE-MACHINE SCHEDULING; SCHEDULING PROBLEM; SINGLE MACHINES; TARDINESS COST;

MACHINERY;

SCHEDULING;

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

References (23)

1. Della Croce F., Grosso A., Orlin J.B., and Tadei R. An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem. Operations Research Letters 32 (2004) 68-72
2. Bülbül K., Kaminsky P., and Yano C. Preemption in single machine earliness/tardiness scheduling. Journal of Scheduling 10 (2007) 271-292
3. Congram R.K., Potts C.N., and van de Velde S.L. An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem. INFORMS Journal on Computing 14 (2002) 52-67
4. den Besten M, Stützle T, Dorigo M. Design of iterated local search algorithms. In: Proceedings of the EvoWorkshops on applications of evolutionary computing, vol. 2037, 2001. p. 441-51.
5. Ergun Ö., and Orlin J.B. Fast neighborhood search for the single machine total weighted tardiness problem. Operations Research Letters 34 (2006) 41-45
6. Estève B., Aubijoux C., Chartier A., and Tkindt V. A recovering beam search algorithm for the single machine just-in-time scheduling problem. European Journal of Operational Research 172 (2006) 798-813
7. Hendel Y., and Sourd F. Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem. European Journal of Operational Research 173 (2006) 108-119
8. Hendel Y., and Sourd F. An improved earliness-tardiness timing algorithm. Computers & Operations Research 34 (2007) 2931-2938
9. Hoogeveen J.A., and Van de Velde S.L. A branch-and-bound algorithm for single-machine earliness-tardiness scheduling with idle-time. INFORMS Journal on Computing 8 (1996) 402-412
10. James R.J.W., and Buchanan J.T. A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem. European Journal of Operational Research 102 (1997) 513-527
11. James R.J.W., and Buchanan J.T. Performance enhancements to tabu search for the early/tardy scheduling problem. European Journal of Operational Research 106 (1998) 254-265
12. Józefowska J. Just-in-time scheduling (2007), Springer, Berlin
13. Kedad-Sidhoum S., Solis Y.A.R., and Sourd F. Lower bound for the earliness-tardiness scheduling problem on parallel machines with distinct due dates. European Journal of Operational Research 3 (2008) 1305-1316
14. Lourenço H.R., Martin O., and Stützle T. Iterated local search. Handbook of metaheuristics. International series in operations research and management vol. 57 (2006), Kluwer Academic Publishers, Dordrecht 321-353
15. Sourd F. The continuous assignment problem and its application to preemptive and non-preemptive scheduling with irregular cost functions. INFORMS Journal on Computing 16 (2004) 198-208
16. Sourd F. Dynasearch neighborhood for the earliness-tardiness scheduling problem with release dates and setup constraints. Operations Research Letters 34 (2006) 591-598
17. Sourd F. New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling. INFORMS Journal of Computing 2009;21:167-75.
18. Sourd F., and Kedad-Sidhoum S. A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem. Journal of Scheduling 11 (2008) 49-58
19. Tanaka S. An exact algorithm for single-machine scheduling without idle time. In: 3rd multidisciplinary international scheduling conference: theory and applications (MISTA), 2007. p. 314-7.
20. Tanaka S, Fujikuma S, Araki M. A branch-and-bound algorithm based on lagrangian relaxation for single-machine scheduling. In: International symposium on scheduling, 2006. p. 148-53.
21. Tsai T.I. A genetic algorithm for solving the single machine earliness/tardiness problem with distinct due dates and ready times. International Journal of Advanced Manufacturing Technology 31 (2007) 994-1000
22. Wan G., and Yen B.P.C. Tabu search for single machine with distinct due windows and weighted earliness/tardiness penalties. European Journal of Operational Research 142 (2002) 271-281
23. Wodecki M. A block approach to earliness-tardiness scheduling problem. International Journal of Advanced Manufacturing Technology 40 (2009) 797-807