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. A. Bauer, B. Bullnheimer, R. F. Haiti, and C. Strauss. An ant colony optimization approach for the single machine total tardiness problem. In Proc. of CEC’99, pages 1445–1450. IEEE Press, Piscataway, NJ, 1999.
3. A. Colorni, M. Dorigo, V. Maniezzo, and M. Trubian. Ant System for Job-Shop Scheduling. Belgian Journal of Operations Research, Statistics and Computer Science, 34(1 ):39–53, 1994.
4. R. K. Congram, C. N. Potts, and S. L. Van de Velde. An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem. Technical report, Faculty of Mathematical Studies, University of Southampton, December 1998.
5. 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.