A comprehensive course timetabling and student scheduling system at the University of Waterloo

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2079 LNCS, Issue , 2001, Pages 64-82

  Carter, Michael W ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

STUDENTS; ALGORITHMS; TEACHING;

COURSE TIMETABLING; DEMAND-DRIVEN; GREEDY HEURISTICS; LAGRANGIAN RELAXATION ALGORITHMS; SCHEDULING SYSTEMS; SECTION SIZE; SUB-PROBLEMS; UNIVERSITY OF WATERLOO;

SCHEDULING;

EID: 84889565860     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44629-x_5     Document Type: Conference Paper

References (12)

1. Aubin, J. and Ferland, J.A., "A Large Scale Timetabling Problem", Computers & Operations Research 16, 67-77, 1989.
2. E.K. Burke and J.P. Newall, "A Multi-Stage Evolutionary Algorithm for the Timetable Problem", the IEEE Transactions on Evolutionary Computation, Vol 3.1, 63-74, 1999
3. Carter, M.W., "A Lagrangian Relaxation Approach to the Classroom Assignment Problem", INFOR 27, No. 2, pp. 230-246, 1989.
4. Carter, M.W., "A Decomposition Algorithm for Practical Timetabling Problems", Working Paper, Mechanical and Industrial Engineering, University of Toronto, 1983 (available from www.mie.utoronto.ca/staff/profiles/carter. html)
5. Carter, M.W., and Gendreau, M., "A Practical Algorithm to Find a Large Clique in a Graph", Working Paper, Mechanical and Industrial Engineering, University of Toronto, 1999.
6. Carter, M.W. and Laporte, G., "Recent Developments in Practical Course Timetabling", in Practice and Theory of Automated Timetabling, Springer-Verlag Lecture Notes in Computer Science 1408, E.K. Burke and M.W. Carter, eds., Springer, 1998.
7. Carter, M.W. and Tovey, C.A., "When Is the Classroom Assignment Problem Hard?", Operations Research 40, S28-S39, 1992.
8. Hu, T.C., Integer Programming and Network Flows, Addison-Wesley, Reading, MA, 1969.
9. Paechter, B., Cumming, A. and Luchian, H., "The Use of Local Search Suggestion Lists for Improving the Solution of Timetable Problems with Evolutionary Algorithms", In Proceedings of the AISB Workshop on Evolutionary Computing, (Sheffield, April 3-7, 1995.
10. Rankin, R.C., "Automatic Timetabling in Practice", in Practice and Theory of Automated Timetabling, Springer-Verlag Lecture Notes in Computer Science 1153, E.K. Burke and P. Ross, eds., Springer, 1996.
11. Sampson, S.E., Freeland, J.R. and Weiss, E.N., "Class Scheduling to Maximize Participant Satisfaction", Interfaces 25, No. 3, 30-41, 1995.
12. University of Waterloo web site http://www.uwaterloo.ca.