1. J. Aubin and J.A. Ferland. A large scale timetabling problem. Computers & Operations Research, 16:67–77, 1989.
2. H. W. Chan, C. K. Lau, and J. Sheung. Practical school timetabling: A hybrid approach using solution synthesis and iterative repair. In Proceedings of the Second International Conference on the Practice and Theory of Automated Timetabling, pages 123–131, Toronto, Canada, 1997.
3. R. Feldman and M. C. Golumbic. Constraint satisfiability algorithms for interactive student scheduling. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, pages 1010–1016, Detroit, Mich., 1989.
4. J. A. Ferland and C. Fleurent. SAPHIR: A decision support system for course scheduling. INTERFACES, 24:105–115, 1994.
5. M. Henz and J. Wurtz. Using Oz for college time tabling. In Proceedings of the First International Conference on the Practice and Theory of Automated Timetabling, pages 162–180, 1995. Available as: Springer Lecture Notes in Computer Science 1153.