Operational Research (OR) techniques have been applied, from the early stages of the
discipline, to a wide variety of issues in education. At the government level, these include …

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 …

A novel 0–1 integer programming formulation of the university timetabling problem is
presented. The model provides constraints for a great number of operational rules and …

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 …

Integer programming has always been an alternative for formulating combinatorial problems
such as the university timetabling problem. However, the effort required for modeling …

This paper reports the design and implementation of a PC-based computer system to aid the
construction of a combined university course–examination timetable. The specific difficulties …

In this case study, we describe an integer programming (IP) approach, which has been
implemented at the School of Economics and Management at Hannover University …

One of the major problems with course scheduling-a particular type of timetabling-is the
difficulty that arises when trying to suitably co-ordinate lectures, students and classrooms …

In this chapter we consider the NP-complete problem of university course timetabling. We
note that it is often difficult to gain a deep understanding of these sorts of problems due to …

The school timetabling problem, although less complicated than its counterpart for the
university, still provides a ground for interesting and innovative approaches that promise …