believe it would be beneficial to explain the obtained results from a theoretical point of view, as opposed to a purely experimentally-driven research. A first attempt in this direction could investigate the relative impact of the neighborhoods on the derived neighboring solutions. Based on such an investigation, it might be possible to conclude in general on the modifying impact of operators on alternatives.

## References

[1] T. S. Abdul-Razaq, C. N. Potts, and L. N. Van Wassenhove. A **survey of algorithms for the**
single machine total weighted tardiness scheduling problem. **Discrete Applied Mathematics**,
26:235–253, 1990.

[2] Joseph Adams, Egon Balas, and Daniel Zawack. The shifting bottleneck procedure for job shop scheduling. Management Science**, 34(3):391–401, 1988.**
[3] Arife Burcu Colka Altunc and Ahmet Burak Keha. Interval-indexed formulation based heuristics for single machine total weighted tardiness problem. **Computers & Operations Research**,
36(6):2122–2131, June 2009.

[4] Kenneth R. Baker. Introduction to Sequencing and Scheduling**. John Wiley & Sons, New York,**
London, Sydney, Toronto, 1974.

 2009
[5] Andreas Bauer, Bernd Bullnheimer, Richard F. Hartl, and **Christine Strauss. An ant colony**
optimization approach for the single machine total tardiness problem. In **Proceedings of the** 1999 Congress on Evolutionary Computation CEC99**, volume 2, pages 1445–1450, Piscataway,** NJ, 1999. IEEE Service Center.

MIC
[6] Umit Bilge, M¨ujde Kurtulan, and Furkan Kıra¸c. A tabu searc ¨ **h algorithm for the single machine**
total weighted tardiness problem. European Journal of Operational Research**, 176:1423–1435,** 2007.

[7] Fuh-Der Chou. An experienced learning genetic algorithm to solve the single machine total weighted tardiness scheduling problem. Expert Systems with Applications**, 36:3857–3865, 2009.**
[8] Richard K. Congram, Chris N. Potts, and Steef L. van de Velde. An iterated dynasearch algorithm for the single-machine total weighted tardiness problem. **INFORMS Journal on**
Computing**, 14(1):52–67, 2002.**
[9] H. A. J. Crauwels, C. N. Potts, and L. N. Van Wassenhove. Local search heuristics for the single machine total weighted tardiness scheduling problem. **INFORMS Journal on Computing**, 10(3):341–350, 1998.

[10] Matthijs den Besten, Thomas St¨utzle, and Marco Dorigo. Ant colony optimization for the total weighted tardiness problem. In M. Schoenauer, K. Deb, G. Rudolph, X. Yao, E. Lutton, J. J. Merelo, and H.-P. Schwefel, editors, Parallel Problem Solving from Nature-PPSN VI**, volume** 1917 of Lecture Notes in Computer Science**, pages 611–620, Berlin, Heidelberg, New York,** 2000. Springer Verlag.

Hamburg, Germany, June 13–16, 2009