One of the peculiarities of university timetabling problems lies in their huge complexity and the easy transition between complex constrained system to an over-constrained one. The Faculty of Informat-ics timetabling problem represents very complex scheduling and resource allocation problem as individual timetable for every student has to be scheduled with respect to course pre-enrollment infor...

The research presented in this PhD thesis contributes to a larger project to develop a case-based reasoning (CBR) meta-heuristic selector for examination timetabling problems. Chapter 2 gives a detailed survey of techniques in the literature applied to examination timetabling. The work in this thesis aims to provide a significant contribution to the examination timetabling domain in its own rig...

Producing good quality examination timetables is a difficult task which is faced by many academic institutions. Due to the complexity and the large size of the realworld university examination timetabling problems, it is difficult to obtain an optimal solution. Indeed, due to the complex nature of the problem, it is questionable if an end user would recognise a truly optimal solution. Carter an...

Abstract We report on the development of Reprobate, a tool for solving sports timetabling problems in subset RobinX format. Our is based around monolithic translation instance into pseudo-Boolean (PB) optimisation problem; this can be solved using existing solvers. Once has found feasible solution, it improve second encoding that alters only home/away pattern games. entered our International Ti...

High school timetabling is one of those recurring NP-hard real-world combinatorial optimisation problems that has to be dealt with by many educational institutions periodically, and so has been of interest to practitioners and researchers. Solving a high school timetabling problem requires scheduling of resources and events into time slots subject to a set of constraints. Recently, an internati...

Course timetabling is a combinatorial optimization problem and has been confirmed to be an NP-complete problem. Course timetabling problems are different for different universities. The studied university course timetabling problem involves hard constraints such as classroom, class curriculum, and other variables. Concurrently, some soft constraints need also to be considered, including teacher...

This special volume is focused upon a selection of the papers that were presented at the 9th International Conference on the Practice and Theory of Automated Timetabling (PATAT) in Son, Norway, between 28th and 31st August, 2012. The PATAT conferences are held biennially. This is the third occasion that we have employed the Annals of Operations Research as the forum for a revised and selected c...