We present a study of the university post-enrolment timetabling problem, proposed as Track 2 of the 2007 International Timetabling Competition. We approach the problem using several techniques, particularly local search, constraint programming techniques and hybrids of these in the form of a large neighbourhood search scheme. Our local search approach won the competition. Our best constraint pr...

This paper introduces a new timetabling problem on universities, called interview timetabling. In this problem, some constant number, say three, of referees are assigned to each of 2n graduate students. Our task is to construct a presentation timetable of these 2n students using n timeslots and two rooms, so that two students evaluated by the same referee must be assigned to different timeslots...

A timetable is a temporal arrangement of a set of meetings such that all given constraints are satissed. A timetabling problem can be suitably modelled in terms of a set of constraints. We use Constraint Logic Programming and develop methods, techniques and concepts for a combination of interactive and automatic timetabling of university courses and school curricula. An exemplary application of...

Automated high school timetabling is a challenging task. This problem is a well known hard computational problem which has been of interest to practitioners as well as researchers. High schools need to timetable their regular activities once per year, or even more frequently. The exact solvers may fail to find a solution for a given instance of the problem. A selection hyper-heuristic can be de...

Automated timetabling is a current and relevant eld of research. A timetabling problem can be suitably modelled in terms of a set of constraints. Using Constraint Logic Programming we develop methods, techniques and concepts for a combination of interactive and automatic timetabling of university courses and school curricula. An exemplary application of such a timetabling system was developed f...

Agent technology promises possibilities for the design of distributed systems, the design of open systems and the reduction of information overload for the users. Timetabling applications must operate in heterogeneous environments at large organisations where users cannot be bothered with all the details influencing their work schedules. It is a domain where, at least at the system level, many ...

In this paper, we address the issue of ordering exams by simultaneously considering two separate heuristics using fuzzy methods. Combinations of two of the following three heuristic orderings are employed: largest degree, saturation degree and largest enrolment. The fuzzy weight of an exam is used to represent how difficult it is to schedule. The decreasingly ordered exams are sequentially chos...

In this paper, we address the issue of ordering exams by simultaneously considering two separate heuristics using fuzzy methods. Combinations of two of the following three heuristic orderings are employed: largest degree, saturation degree and largest enrollment. The fuzzy weight of an exam is used to represent how difficult it is to schedule. The decreasingly ordered exams are sequentially cho...