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 performance of a collection of low-level heuristics and then make tabu heuristics that have been applied too many times, thus allowing other heuristics to be applied. Experiments carried out on examination timetabling datasets fr...

We present a study of the university post-enrolment timetabling problem, proposed as Track 2 of the 2007 International Timetabling Competition. We approach the problem using several techniques, particularly local search, constraint programming techniques and hybrids of these in the form of a large neighbourhood search scheme. Our local search approach won the competition. Our best constraint pr...

7 In this paper we present an integer programming method for solving the Classroom Assignment Problem in University Course Timetabling. We introduce a novel formulation of the problem which generalises existing models and maintains tractability even for large instances. The model is validated through computational results based on our experiences at the University of Auckland, and on instances ...

This paper studies Knowledge Discovery (KD) using Tabu Search and Hill Climbing within Case-Based Reasoning (CBR) as a hyper-heuristic method for course timetabling problems. The aim of the hyper-heuristic is to choose the best heuristic(s) for given timetabling problems according to the knowledge stored in the case base. KD in CBR is a 2-stage iterative process on both case representation and ...

In this paper we describe a heavily constrained university timetabling problem, and our genetic algorithm based approach to solve it. A problem-specific chromosome representation and knowledge-augmented genetic operators have been developed; these operators ‘intelligently’ avoid building illegal timetables. The prototype timetabling system which is presented has been implemented in C and PROLOG...

Exam timetabling is one of the most important administrative activities in universities (e.g. [4], [8], and [19]). Such problems have been the subject of significant research effort across Artificial Intelligence research and Operational Research since the 1960s. A general exam timetabling problem consists of assigning a set of exams into a limited number of timeslots while satisfying a set of ...

The examination timetabling problem has been studied in many different forms and using a variety of techniques over the years [1], [3], [4], [6]. In its simplest form, it is required that a set of exams are scheduled into a set of time periods in such a way that no two exams with students in common are scheduled at the same time. In practice there are a wide range of other constraints which mus...

sure to reduce costs while improving service delivery. A central component to this effort is the availability of timetabling systems that can find practical solutions to maximizing the utilization of teaching resources, such as facilities and staff, while not compromising on education quality. Traditional university timetabling is often concerned with the task of assigning a number of events, s...

The timetabling of lecturers, seminars, practical sessions and examinations is a core business process for academic institutions. A feasible timetable must satisfy hard constraints, an optimum timetable will additionally satisfy soft constraints, which are not absolutely essential. An Ant Colony based Timetabling Tool (ANCOTT) has been developed for solving timetabling problems. New variants of...

The paper describes a new approach, based on cell biology, to the uncapacitated examination timetabling problem. This approach begins with a single cell which is developed into a fully grown organism through the processes of cell division, cell interaction and cell migration. The mature organism represents a solution to the particular timetabling problem. The paper discusses the performance of ...