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 …

This paper presents a review pertaining to assignment problem within the education
domain, besides looking into the applications of the present research trend, developments …

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 …

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 …

This paper presents an Adaptive Tabu Search algorithm (denoted by ATS) for solving a
problem of curriculum-based course timetabling. The proposed algorithm follows a general …

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 university course timetabling problem is an optimisation problem in which a set of
events has to be scheduled in timeslots and located in suitable rooms. Recently, a set of …