Nurse rostering is a complex scheduling problem that affects hospital personnel on a daily
basis all over the world. The need for quality software solutions is acute for a number of …

The Second International Timetabling Competition (TTC2007) opened in August 2007.
Building on the success of the first competition in 2002, this sequel aimed to further develop …

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 …

This paper introduces a new and very simple search methodology called Late Acceptance
Hill-Climbing (LAHC). It is a local search algorithm, which accepts non-improving moves …

In this paper, we investigate variable neighbourhood search (VNS) approaches for the
university examination timetabling problem. In addition to a basic VNS method, we introduce …

Hyper-heuristics can be identified as methodologies that search the space generated by a
finite set of low level heuristics for solving search problems. An iterative hyper-heuristic …

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 …

University timetabling problems can be classified into two main categories: course and
examination timetabling. We discuss the problem statements and constraints for each of …