Complex university course timetabling

Warning

This publication doesn't include Institute of Computer Science. It includes Faculty of Informatics. Official publication website can be found on muni.cz.

Authors	RUDOVÁ Hana MÜLLER Tomáš KEITH Murray
Year of publication	2011
Type	Article in Periodical
Magazine / Source	Journal of Scheduling
MU Faculty or unit	Faculty of Informatics
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:	Highly Parallel and Distributed Computing Systems Dynamic Aspects of Scheduling