The examination timetabling problem is a well researched problem. Various techniques
have been applied to solving this NP-hard problem including genetic algorithms and hyper …

The effectiveness of the Structure-Based Partial Solution Search (SBPSS) in solving the
examination timetabling problem (ETP) was shown in previous work. The research …

A hyper-heuristic for the examination timetabling problem searches a space of constructive
heuristic combinations instead of a space of examination timetables. The most optimal …

This paper presents the results of a study conducted to investigate the use of genetic
algorithms (GAs) as a means of inducing solutions to the examination timetabling problem …

The university examination timetabling problem is one of challenging optimization problems.
Its NP-hard nature makes this problem attractive to be studied, especially in the field of …

Examination timetabling is both a difficult and time consuming task, faced by many
educational institutions worldwide [5]. The main objective is to assign periods within a …

A lot of research has been conducted on hyper-heuristics for examination timetabling.
However, most of this work has been focused on an uncapacitated version of the problem …

Solving a real-world university examination timetabling is an intractable problem.
Examination timetabling problems (ETP) can be defined as a problem of assigning a set of …

Examination timetabling problem is an optimization problem which consists in assigning a
set of exams to a set of contiguous time slot, satisfying a set of constraints. The problem falls …

Research in the field of examination timetabling has developed in two directions. The first
looks at applying various methodologies to induce examination timetables. The second …