1. Avella, P., & Vasil’ev, I. (2005). A computational study of a cutting plane algorithm for university course timetabling. Journal of Scheduling, 8, 497–514.
2. Burke, E., & Newall, J. (1999). A multi-stage evolutionary algorithm for the timetable problem. IEEE Transactions on Evolutionary Computation, 3(1), 63–74.
3. Lecture notes in computer science;E. Burke,1997
4. Burke, E. K., Mareček, J., Parkes, A. J., & Rudová, H. (2007). On a clique-based integer programming formulation of vertex colouring with applications in course timetabling (Technical Report NOTTCS-TR-2007-10). The University of Nottingham, Nottingham.
5. Operations Research Proceedings;E. K. Burke,2008