1. Burke, E.K., Kendall, G., Soubeiga, E.: A tabu search hyperheuristic for timetabling and rostering. Journal of Heuristics 9(6), 451–470 (2003)
2. Natural Computing Series;C. Sekhar Pedamallu,2008
3. Sekhar Pedamallu, C., Özdamar, L.: Investigating a hybrid simulated annealing and local search algorithm for constrained optimization. In: EJOR (2006) (in press),
http://dx.doi.org/0,1016/j.ejor.2006.06.050
4. Abdullah, S., Burke, E.K., McCollum, B.: An Investigation of Variable Neighbourhood Search for Course Timetabling. In: The Proceedings of the 2nd Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA 2005), New York, USA, July 18 -21, pp. 413–427 (2005)
5. Abdullah, S., Burke, E.K., McCollum, B.: Using a Randomised Iterative Improvement Algorithm with Composite Neighbourhood Structures for University Course Timetabling. In: Metaheuristics Progress in Complex Systems Optimization, pp. 153–169. Springer, Heidelberg (2007)