1. Abdullah S, Burke EK and McCollum B (2005a) An investigation of variable neighbourhood search for university course timetabling. In: Proceedings of The 2 nd Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA 2005), New York, USA, July 18th-21st, pp 413-427.
2. Abdullah S, Burke EK and McCollum B (2005b). Using a Randomised Iterative Improvement Algorithm with Composite Neighbourhood Structures for University Course Timetabling. In: Proceedings of the 6th Metaheuristics International Conference (MIC 05), Vienna, Austria, August 22nd-26th, in CD-ROM, 2005.
3. Avella P and Vasil’Ev I (2005) A Computational Study of a Cutting Plane Algorithm for University Course Timetabling. Journal of Scheduling 8(6), pp 497-514.
4. Ayob M and Kendall G (2003) A monte carlo hyper-heuristic to optimise component placement sequencing for multi head placement machine. Proceedings of the International Conference on Intelligent Technologies, InTech’03, Thailand, Dec 17th -19th, pp 132-141.
5. Bardadym VA (1996) Computer-aided school and university timetabling: A new wave. Practice and Theory of Automated Timetabling V (eds. Burke and Ross), Springer Lecture Notes in Computer Science Volume 1153, pp 22-45.