In 1986, Carter published a survey of papers on practical examination timetabling, in the
intervening years, there have been a number of new applications, and several innovative …

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

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 …

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 …

Heuristic ordering based methods, very similar to those used for graph colouring problems,
have long been applied successfully to the examination timetabling problem. Despite the …

University timetabling is an NP-hard problem, which means that the amount of computation
required to find solutions increases exponentially with problem size. Timetabling is subject …

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 …

This document seeks to provide a scientific basis by which different initialization algorithms
for evolutionary timetabling may be compared. Seeding the initial population may be used to …

Automating the neighbourhood selection process in an iterative approach that uses multiple
heuristics is not a trivial task. Hyper-heuristics are search methodologies that not only aim to …

This paper describes an investigation of solving Examination Timetabling Problems (ETTPs)
with Genetic Algorithms (GAs) using a non-direct chromosome representation based on …