Timetabling is a typical application of constraint programming whose task is to allocate activities to slots in available resources respecting various constraints like precedence and capacity. In this paper we present a basic concept, a constraint model, and a solution algorithm for interactive timetabling. Interactive timetabling combines automated timetabling (the computer allocates the activ...

This paper deals with the timetabling problem at tertiary institutions. An empirical research was carried out dealing with timetabling at tertiary institutions in Southern Africa. Questionnaires dealing with, inter alia, student population, number of groups, constraints and the method used for timetabling, were sent to the tertiary institutions. There was a response rate of over 80%. Mad it cle...

This paper describes the application of a hybrid genetic algorithm to a real-world instance of the university course timetabling problem. We address the timetabling of laboratory exercises in a highly constrained environment, for which a formal definition is given. Solution representation technique appropriate to the problem is defined, along with associated genetic operators and a local search...

The Employee Timetabling Problem (ETP) is concerned with assigning a number of employees into a given set of shifts over a fixed period of time while meeting the employee’s preferences and organizational work regulations. The problem also attempts to optimize the performance criteria and distribute the shifts equally among the employees. The problem is known to be a complex optimization problem...

Timetabling manually is a complex activity that is time-consuming and stressful because a high number of high and soft constraints need to be satisfied; there is therefore the need to automate the timetabling process. Timetabling automating involves combinatorial optimization, time-based planning, realizing highly constrained problems and addressing multi-dimensional complexities. Researchers h...

This paper presents a case-based heuristic selection approach for automated university course and exam timetabling. The method described in this paper is motivated by the goal of developing timetabling systems that are fundamentally more general than the current state of the art. Heuristics that worked well in previous similar situations are memorized in a case base and are retrieved for solvin...

This paper describes the results of a questionnaire on examination timetabling sent to the registrars of ninety five British Universities. The survey asked questions in three specific categories. Firstly, universities were asked about the nature of their examination timetabling problem: how many people, rooms, periods are involved and what difficulties are associated with the problem? Secondly,...

This paper describes how the university timetabling problem is addressed in the Laurea course Ingegneria dell’Informazione (Information Engineering) for the University of Ferrara, Italy. The university timetabling problem is modelled as a Constraint Optimisation Problem and addressed with ECLPS, one of the leading Constraint Logic Programming languages.

In this paper, we study the multi-machine scheduling problem with earliness and tardiness penalties and sequence dependent setup times. This problem can be decomposedinto two subproblems sequencing and timetabling. Sequencing focuses on assigning each job to a fixed machine and determine the job sequence on each machine. We call such assignment a semi-schedule. Timetabling focuses on finding an...