The aim of this paper is to give a brief introduction to some recent approaches to timetabling
problems that have been developed or are under development in the Automated …

The study of differences between timetabling research presented in conferences like PATAT
or published in Annals of OR and commercial timetabling software used in Higher Education …

Hyper-heuristics is a fairly recent technique that aims at effectively solving various real-world
optimization problems. This is the first book on hyper-heuristics, and aims to bring together …

This paper presents an investigation of a simple generic hyper-heuristic approach upon a
set of widely used constructive heuristics (graph coloring heuristics) in timetabling. Within …

Examination timetabling is one of the most important administrative activities that takes place
in all academic institutions. In this paper, we present a critical discussion of the research on …

Metaheuristics are a relatively new but already established approach to combinatorial
optimization. A metaheuristic is a generic algorithmic template that can be used for finding …

As well as nearly always belonging to the class of NP-complete problems, university
timetabling problems can be further complicated by the often idiosyncratic requirements …

We consider a simplification of a typical university course timetabling problem involving
three types of hard and three types of soft constraints. A MAX-MIN Ant System, which makes …

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 …

In recent years the processing speed of computers has increased dramatically. This in turn
has allowed search algorithms to execute more iterations in a given amount of real-time …