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

A lot of research has been conducted on hyper-heuristics for examination timetabling. However, most of this work has been focused on an uncapacitated version of the problem. This study reports on evolving hyper-heuristics for a highly constrained version of the problem, namely, the set of problems from the second International Timetabling Competition (ITC ’07). Previous work has shown that usin...

A timetable is a temporal arrangement of a set of meetings such that all given constraints are satis-ed. 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 combined interactive and automatic timetabling of university courses and school curricula. An exemplary application of such ...

The course timetabling problem can be generally defined as the task of assigning a number of lectures to a limited set of timeslots and rooms, subject to a given set of hard and soft constraints. The modeling language for course timetabling is required to be expressive enough to specify a wide variety of soft constraints and objective functions. Furthermore, the resulting encoding is required t...

The university course timetabling problem is hard and time-consuming to solve. Profits from full automatisation of this process can be invaluable. This paper describes architecture and operation of two automatic timetabling systems. Both are based on evolutionary algorithms, with specialised genetic operators and penalty-based evaluation function. The paper covers two problem variations (theore...

Received Oct 22, 2013 Revised Nov 01, 2013 Accepted Nov 03, 2013 University course timetabling is a NP-hard problem which is very difficult to solve by conventional methods, we know scheduling problem is one of the Nondeterministic Polynomial (NP) problems. This means, solving NP problems through normal algorithm is a time-consuming process (it takes days or months with available equipment) whi...

Cycle inequalities play an important role in the polyhedral study of the periodic timetabling problem. We give the first pseudo-polynomial time separation algorithm for cycle inequalities, and we give a rigorous proof for the pseudo-polynomial time separability of the change-cycle inequalities. The efficiency of these cutting planes is demonstrated on real-world instances of the periodic timeta...