The timetabling problem involves the scheduling of a set of entities (eg, lectures, exams,
vehicles, or people) to a set of resources in a limited number of time slots, while satisfying a …

The efficient creation of examination timetables is a recurring and important problem for
universities worldwide. Good timetables typically are characterized by balanced distances …

The examination timetabling problem involves assigning exams to a specific or limited
number of timeslots and rooms with the aim of satisfying all hard constraints (without …

Many researchers studying examination timetabling problems focus on either benchmark
problems or problems from practice encountered in their institutions. Hyperheuristics are …

Over the years, many variants, extensions and adaptations of local search techniques have
appeared in the literature. Some of them have become extremely famous, such as Simulated …

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 …

This paper investigates a tabu-search-based hyper-heuristic for solving examination
timetabling problems. The hyper-heuristic framework uses a tabu list to monitor the …

In this paper we introduce an examination timetabling problem from the MARA University of
Technology (UiTM). UiTM is the largest university in Malaysia. It has 13 branch campuses …

A two phased approach incorporating the extended great deluge technique is detailed in
relation to the Examination Timetabling Problem as described in the 2nd International …

The precise nature of the examination timetabling problem differs from institution to
institution. Thus any general solution method must be suitably flexible and this paper is …