In this paper, we first illustrate the state-of-the-art in timetabling research w.r.t. two important research qualities, namely measurability and reproducibility, analyzing what we believe are the most important contributions in the literature. Secondly, we discuss some practices that, in our opinion, could contribute to the improvement on the two aforementioned qualities for future papers in t...

In this paper, we first discuss the level of compliance for timetabling research to two important research qualities, namely measurability and reproducibility, analyzing what we believe are the most important contributions in the literature. Secondly, we discuss some practices that, in our opinion, could contribute to the improvement on the two aforementioned qualities for future papers in time...

In this paper we describe a successful case-study where a Branch-and-Cut algorithm yields the “optimal” solution of a real-world timetabling problem for university courses (University Course Timetabling problem). The polyhedral structure of the problem is studied in conection with a polytope of the Set Packing problem. Several families of cutting planes are introduced, these being crutial to fi...

This paper presents an innovative approach to curriculum-based timetabling. Curricula are defined by a rich model that includes optional courses and course groups among which students are expected to take a subset of courses. Transformation of the curriculum model into the enrollment model is proposed and a local search algorithm generating corresponding enrollments is introduced. This enables ...

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 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...

Curriculum-based course timetabling deals with the weekly assignment of a set of lectures for university courses to specific timeslots and rooms, where conflicts between courses are set according to curricula published by the university and not on the basis of enrolment data. The curriculum-based course timetabling is considered as the third track in the 2 International timetabling competition ...

We use Constraint Logic Programming and develop methods , techniques and concepts for a combined automatic and interactive timetabling of university courses and school curricula. An instance of such a timetabling system was developed for the Charit e Medical Faculty at the Humboldt University, Berlin. This paper looks at methods and techniques for solving this timetabling problem. An essential ...

The examination timetabling problem represents a major administrative activity for academic institutions. An increasing number of student enrolments, a wider variety of courses and increasing number of combined degree courses contribute to the growing challenge of developing examination timetabling software to cater for the broad spectrum of constraints required by educational institutions. In ...