This paper examines the use of genetic algorithms (GAs) to solve the school timetabling problem. The school timetabling problem falls into the category of NP-hard problems. Instances of this problem vary drastically from school to school and country to country. Previous work in this area has used genetic algorithms to solve a particular school timetabling problem and has not evaluated the perfo...

This system demonstration presents an approach to interactive timetabling used by the UniTime university timetabling system. This application, which is publicly available under an open source license, has been successfully applied at Purdue University [8], a large public university (39,000 students) with a broad spectrum of programs at the undergraduate and graduate levels. The complete system ...

A large number of heuristic algorithms have been developed over the years which have been aimed at solving examination timetabling problems. However, many of these algorithms have been developed specifically to solve one particular problem instance or a small subset of instances related to a given real-life problem. Our aim is to develop a more general system which, when given any exam timetabl...

This paper examines the application of neural networks as a construction heuristic for the examination timetabling problem. Building on the heuristic ordering technique, where events are ordered by decreasing scheduling difficulty, the neural network allows a novel dynamic, multi-criteria approach to be developed. The difficulty of each event to be scheduled is assessed on several characteristi...

We present an approach for the examination timetabling problem as defined in the second International Timetabling Competition (http://www.cs.qub.ac.uk/itc2007). The solution approach can be considered as an implementation of the GRASP (Greedy Randomized Adaptive Search Procedure) method with the combination of several other metaheuristics. Three stages are employed. The first stage is responsib...

This paper proposes Hybrid Intelligent Water Drops (HIWD) algorithm to solve Tamhidi programs uncapacitated examination timetabling problem in Universiti Sains Islamic Malaysia (USIM). Intelligent Water Drops algorithm (IWD) is a population-based algorithm where each drop represents a solution and the sharing between the drops during the search lead to better drops. The results of this study pr...

This paper proposes Hybrid Intelligent Water Drops (HIWD) algorithm to solve Tamhidi programs uncapacitated examination timetabling problem in Universiti Sains Islamic Malaysia (USIM). Intelligent Water Drops algorithm (IWD) is a population-based algorithm where each drop represents a solution and the sharing between the drops during the search lead to better drops. The results of this study pr...

The Resource-Constrained Project Scheduling Problem (RCPSP) is concerned with single-item or small batch production where limited resources have to be allocated to dependent activities over time. Over the past few decades, a lot of work has been made with the use of optimal solution procedures for this basic problem type and its extensions. Brucker and Knust[1] discuss, how timetabling problems...