Timetabling manually is a complex activity that is time-consuming and stressful because a high number of high and soft constraints need to be satisfied; there is therefore the need to automate the timetabling process. Timetabling automating involves combinatorial optimization, time-based planning, realizing highly constrained problems and addressing multi-dimensional complexities. Researchers h...

The timetabling step in railway planning is based on the estimation of the running times. Usually, they are estimated as the shortest running time increased of a short time supplement. Estimating the running time amounts to define the speed profile which indicates the speed that the train driver must hold at each position. The approach proposed in this paper produces a set of solutions optimizi...

University timetabling problem is a very common and seemingly simple, but yet very difficult problem to solve in practice. While solution definitely exists (evidenced by the fact that we do hold classes), an automated optimal schedule is very difficult to derive at present. There were successful attempts to address this problem using heuristics search methods. However, until now, university tim...

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

This paper is the organizers’ report on the Third International Timetabling Competition (ITC2011), run during the first half of 2012. Its participants tackled 35 instances of the high school timetabling problem, taken from schools in 10 countries.

Scheduling is one the problems on which so many researches have been done over years and university course timetabling problem which is a NP-hard problem is a type of scheduling problem. On the other hand, timetabling process must be done for each semester frequently which is an exhausting and time consuming task. University course timetabling problem performs the allocation of whole events to ...

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

This paper presents a case-based heuristic selection approach for automated university course and exam timetabling. The method described in this paper is motivated by the goal of developing timetabling systems that are fundamentally more general than the current state of the art. Heuristics that worked well in previous similar situations are memorized in a case base and are retrieved for solvin...