1. Abdullah, S., Burke, E.K. & McCollum, B. (2005). An investigation of variable neighborhood search for university course timetabling, Proceedings of 2nd Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA 2005), New York,.413-427.
2. Abramson, D. (1991). Constructing school timetables using simulated annealing: sequential and parallel algorithms. Management Science, 37(1), 98-113.
3. Abuhamdah, A. and Ayob, M. (2005). Experimental result of particle collision algorithm for solving course timetabling problems. International Journal of Computer Science and Network Security, 9(9), 134-142.
4. Alkan, A. and Özcan, E. (2003). Memetic algorithms for timetabling, Proceedings of IEEE Congress on Evolutionary Computation, 1796–1802.
5. Asmuni, H., Burke, E.K. & Garibaldi, J. (2005). Fuzzy multiple heuristic ordering for course timetabling, Proceedings of the 2005 UK Workshop on Computational Intelligence UK IC 2005, London, UK, 302-309.