Our research interests include constraint based timetabling and scheduling and its
applications to real-life large scale problems.
For more details, see the list of
and that we have cooperated on.
We are very interested in collaboration
on interesting problems from the area of academic timetabling and scheduling.
To make this step easy, all our work is made publicly available under GNU licenses.
To promote research in this area, various interesting benchmark data sets for
are available in an easily readable XML format.
In order to comply with data security policies, these data sets have been purged of all private information;
however, they do retain all of the complexity of the timetabling problems that we have encountered so far.