Abstract—Course timetabling problems occur every semester in a university which includes the allocation of resources (subjects, lecturers and students) to a number of fixed rooms and timeslots. The assignment is carried out in a way such that there are no conflicts within rooms, students and lecturers, as well as fulfilling a range of constraints. The constraints consist of rules and policies s...

In this abstract we present a new exam timetabling algorithm together with a set of results on the university exam timetabling problems from the University of Toronto collection, available at ftp://ftp.mie.utoronto.ca/pub/carter/testprob/. A number of recent papers have studied these problems e.g. Carter et al. [7], Caramia et al. [6], Casey & Thompson [8], Abdullah et al. [1], Burke et al. [2]...

Although timetabling has long been studied through constraint satisfaction based techniques, along with many alternatives, only recently work has been reported where distributed timetabling problems (DisTTPs) was studied as distributed constraint satisfaction problems (DisCSPs). We present an alternative method for solving DisTTPs based on multiply sectioned constraint networks (MSCNs). The pro...

University course timetabling problem (UCTP) includes the challenging task of generating an automated timetable for courses under resource limitations. Manual generated timetables might hold some errors and consume a long time to create feasible solutions. Thus, there is need find optimal fast solutions this problem. The difficulty further increased when tackling faculty-related constraints, ac...

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

Although there has been a fair amount of research in the area of school timetabling, this domain has not developed as well as other fields of educational timetabling such as university course and examination timetabling. This can possibly be attributed to the fact that the studies in this domain have generally been conducted in isolation of each other and have addressed different school timetab...

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

This paper deals with the Lecture and Tutorial Timetabling Problem at an institution in a Tunisian University. Our objective is to construct a feasible timetable for all lectures and tutorials taken by different groups of each subsection of any section in the institution. For this, we describe the timetabling problem of the institution considered and list all specific hard and soft constraints....

The Examination Timetabling problem (ETTP) regards the scheduling for the exams of a set of university courses, avoiding the overlap of exams of courses having common students, and spreading the exams for the students as much as possible. Carter et al [3] provide a set of formulations for ETTP, which differ from each other on some components of the objective function, along with a set of benchm...