Timetabling is a difficult (NP-complete) problem and belongs to a general class of problems known as scheduling. Due to a variety of constraints typical in different timetabling environments, it has been difficult to develop a generic solution for timetabling. This paper is an attempt to define a generic computational model for examination timetabling for predefined constraints found in the pro...

Combinations of population-based approaches with local search have provided very good results for a variety of scheduling problems. This paper describes the development of a population-based algorithm called Electromagnetism-like mechanism with force decay rate great deluge algorithm for university course timetabling. This problem is concerned with the assignment of lectures to a specific numbe...

The university timetabling, examination and course, are known to be highly constrained optimization problems. Metaheuristic approaches, and their hybrids, have successfully been applied to solve the problems. This paper presents three artificial immune algorithms, the algorithms inspired by the immune system, for university timetabling; clonal selection, immune network and negative selection. T...

The course timetabling problem at the German University in Cairo has been in existence ever since the establishment of the university in 2003. Courses offered at the university, academic staff resources, and room resources make the problem over-constrained. Currently timetables are manually designed. The process is effort and time consuming and the results are often not satisfactory. In this pa...

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 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...

This paper describes our work on applying novel techniques based on propositional satisfiability (SAT) solvers and optimizers to the Curriculum-based Course Timetabling problem. Out of 32 standard benchmark instances derived from the Second International Timetabling Competition held in 2007, our techniques yield the best known solutions for 21 of them (19 of them being optimal), improving the p...