This paper considers a solution to the school timetabling problem. The timetabling problem involves scheduling a number of tuples, each consisting of class of students, a teacher, a subject and a room, to a fixed number of time slots. A Monte Carlo scheme called simulated annealing is used as an optimisation technique. The paper introduces the timetabling problem, and then describes the simulat...

We investigate multi-objective aspects of the new examination timetabling model introduced as part of the 2007 International Timetabling Competition. We propose one way to group together the objectives to represent the separate interests of the students and administration, and produce an example of an associated (Pareto) trade-off curve.

Automated timetabling is a research domain that has occupied many researchers over the last 50 years. Several algorithms have proven to be applicable to timetabling but they are nearly all designed to address specific problems. The framework presented in this paper is a step towards a generic semi-automatic timetabling tool. The basis of the framework is an ontology for timetabling that we desi...

This paper discusses a series of recombination operators for the timetabling problem. These operators act upon a direct representation of the timetable and maintain the property of feasibility. That is that there are no conflicts and no overfilled rooms. Various approaches to solving the timetabling problem using evolutionary computing methods are first compared. The recombination operators are...

Scheduling is one the problems on which so many researches have been done over years and university course timetabling problem which is a NP-hard problem is a type of scheduling problem. On the other hand, timetabling process must be done for each semester frequently which is an exhausting and time consuming task. University course timetabling problem performs the allocation of whole events to ...

Although they are simple techniques from the early days of timetabling research, graph colouring heuristics are still attracting significant research interest in the timetabling research community. These heuristics involve simple ordering strategies to first select and colour those vertices that are most likely to cause trouble if deferred until later. Most of this work used a single heuristic ...

University timetabling problem is a very common and seemingly simple, but yet very difficult problem to solve in practice. While solution definitely exists (evidenced by the fact that we do hold classes), an automated optimal schedule is very difficult to derive at present. There were successful attempts to address this problem using heuristics search methods. However, until now, university tim...

The university course timetabling problem is a difficult optimisation problem due to its highly-constrained nature. Finding an optimal, or even a high quality, timetable is a challenging task, especially when resources (e.g., rooms and time slots) are limited. In the literature, many approaches have been studied to solve this problem. In this thesis, we investigate genetic algorithms to solve t...

In this paper, we present an improvement of the Grouping Genetic Algorithm (GGA) which has been described in [6]. The algorithm has been enhanced with local optimisation techniques which are based on problem-specific heuristics and incorporated into the genetic operators. First experiments on well-known benchmark problems on examination timetabling show that the new hybrid algorithm (HGGA) prod...

The authors of this paper were tasked to create an automated campus-wide timetabling system, for both course and examination timetable scheduling, for the National University of Singapore. This paper explains the development and design of the exam-scheduling portion of the University Timetable Scheduler (UTTS) software. The preliminary results of the application of the AC3 algorithm on this pro...