Complex university course timetabling
Authors | |
---|---|
Year of publication | 2011 |
Type | Article in Periodical |
Magazine / Source | Journal of Scheduling |
MU Faculty or unit | |
Citation | |
Doi | http://dx.doi.org/10.1007/s10951-010-0171-3 |
Field | Informatics |
Keywords | University course timetabling; Search; Constraint satisfaction; Soft constraints; Dynamic problems; Heuristic |
Description | This paper summarizes the work done to solve a complex course timetabling problem at a large university and provides new insights into the overall timetabling process. The system described is currently used on all of the many varied course timetabling problems encountered each term at Purdue University. |
Related projects: |