International Timetabling Competition

Problem Instances

All instances are real data from the University of Udine. For all instances there exists at least one feasible solution (no hard constraint violations), but at present it is not known which is the optimal value for the soft constraints.

In order to model cases in which the number of timeslots is not the same for all days (e.g. Saturday afternoon free), there might be periods unavailable for all courses.
For all instances there cannot be two curricula composed by exactly the same courses.

You can download the first 'Early' seven instances here. A further seven 'Late' instances will be made available 2 weeks before the competition end date.








Last Updated: Monday, July 30, 2007 10:47 PM