1. Tim B. Cooper and Jeffrey H. Kingston. The solution of real instances of the timetabling problem. The Computer Journal
36, 645–653 (1993).
2. Tim B. Cooper and Jeffrey H. Kingston. A program for constructing high school timetables. In First International Conference on the Practice and Theory of Automated Timetabling. Napier University, Edinburgh, UK, 1995. Also ftp://ftp.cs.su.oz.au/pub/tr/TR95_496.ps.Z.
3. J. Csima. Investigations on a Time-Table Problem. Ph.D. thesis, School of Graduate Studies, University of Toronto, 1965.
4. S. Even, A. Itai, and A. Shamir. On the complexity of timetable and multicommodity flow problems. SIAM Journal on Computing
5, 691–703 (1976).
5. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, 1979.