A Comprehensive Course Timetabling and Student Scheduling System at the University of Waterloo

Authors:
Michael W. Carter
Affiliations:
-
Venue:
PATAT '00 Selected papers from the Third International Conference on Practice and Theory of Automated Timetabling III
Year:
2000

Citing 6
Cited 4

A large scale timetabling problem

Computers and Operations Research
When is the classroom assignment problem hard?

Operations Research - Supplement
Automatic Timetabling in Practice

Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
Recent Developments in Practical Course Timetabling

PATAT '97 Selected papers from the Second International Conference on Practice and Theory of Automated Timetabling II
The Use of Local Search Suggestion Lists for Improving the Solution of Timetable Problems with Evolutionary Algorithms

Selected Papers from AISB Workshop on Evolutionary Computing
A multistage evolutionary algorithm for the timetable problem

IEEE Transactions on Evolutionary Computation

Complex university course timetabling

Journal of Scheduling
An open interactive timetabling tool

PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
Feature selection in a fuzzy student sectioning algorithm

PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
A study towards applying thermal inertia for energy conservation in rooms

ACM Transactions on Sensor Networks (TOSN)

Quantified Score

Hi-index	0.03

Visualization

Abstract

This paper describes a comprehensive course timetabling and student scheduling system that was developed for the University of Waterloo between 1979 and 1985. The system is based on a "demand-driven" philosophy where students first chose their courses, and the system tries to find the best timetable to maximize the number of satisfied requests. The problem is first decomposed into small manageable sub-problems. Each sub-problem is solved in sequence using a greedy heuristic to assign times to sections, and a Lagrangian relaxation algorithm to assign classrooms. Timetable representatives from each department have interactive access to make final modifications. Finally, each student is individually assigned to the combination of course sections that maximizes timetable satisfaction and balances section sizes. The system has been used successfully for 15 years.