Following the success of the First International Timetabling Competition in 2002, the timetabling research community is organising a new competition on this problem (opening August 1st). This new competition will be on three different timetabling problems, and one of the tracks concerns the course timetabling formulation that applies to Italian universities (called Curriculum-based Course Timet...

University timetabling problems are a yearly challenging task and faced repeatedly each semester. The considered non-polynomial time (NP) combinatorial optimization (COP), which means that they can be solved through algorithms to produce the aspired optimal timetable. Several techniques have been used solve university problems, most of them use techniques. This paper provides comprehensive revi...

Using Constraint Logic Programming, we develop methods, techniques and concepts for combined interactive and automatic timetabling. An exemples application of our timetabling system proved successful, thus demonstrating the suitability of the methods used. This paper focuses on methods for generating timetables for practical courses. This is a subproblem of our application and can be considered...

Timetable construction in Universities is a moving target. De Werra [1] indicates that educational methods are driving changes in models and software applications, helping or constructing timetables. In this article we present a new timetable model which came from a new program in one Faculty at the Université de Sherbrooke. The basic difference of this new program compared with other instances...

When timetabling experts are faced with a new timetabling problem, they usually develop a very specialised and optimised solution for this new underlying problem. One disadvantage of this strategy is that even slight changes of the problem description often cause a complete redesign of data structures and algorithms. Furthermore, other timetabling problems cannot be fit to the data structures p...

Examination timetabling is a well-studied combinatorial optimization problem. We present a new hybrid algorithm for examination timetabling, consisting of three phases: a constraint programming phase to develop an initial solution, a simulated annealing phase to improve the quality of solution, and a hill climbing phase for further improvement. The examination timetabling problem at the Univers...

We describe the design and implementation of a multi-objective course-timetabling system for the Science Division at Rollins College. In the traditional vertex-coloring approach to timetabling, all conflicts are regarded as equally undesirable, but when all such conflicts are considered, including those that might involve only one or two students, a conflict-free timetable is rarely attainable....

An integer program and a hybrid genetic algorithm for the university timetabling problem Xuehao Feng, Yuna Lee & Ilkyeong Moon To cite this article: Xuehao Feng, Yuna Lee & Ilkyeong Moon (2017) An integer program and a hybrid genetic algorithm for the university timetabling problem, Optimization Methods and Software, 32:3, 625-649, DOI: 10.1080/10556788.2016.1233970 To link to this article: htt...

The general course timetabling problem consists of assigning courses to a specific timeslot and room. The goal is to satisfy as many soft constraints as possible while constructing a feasible schedule (i.e. one that satisfies all the hard constraints). In this paper, we present a composite neighbourhood structure with a randomised iterative improvement algorithm. Many relevant publications can ...