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

The ant colony optimisation metaheuristic has shown promise on simplified artificial instances of university course timetabling problems. However, limited work has been done applying it to practical timetabling problems. In this paper, we describe the application of the ant colony optimisation to a highly constrained real–world instance of the university course timetabling problem. We present t...

A timetable is a temporal arrangement of a set of meetings such that all given constraints are satissed. A timetabling problem can be suitably modelled in terms of a set of constraints. We use Constraint Logic Programming and develop methods, techniques and concepts for a combination of interactive and automatic timetabling of university courses and school curricula. An exemplary application of...

The timetabling problem consists in fixing a sequence of meetings between teachers and students in a prefixed period of time (typically a week), satisfying a set of constraints of various types. [1] Course timetabling is a multidimensional NP-Complete problem. [2] In this paper we present MultiResource Timetabling Problem (MRTP), which is our model for generalized high-school timetabling proble...

The 2nd International Timetabling Competition (ITC2007) is made up of three tracks; one on examination timetabling and two on course timetabling. This paper describes the examination timetabling track introduced as part of the competition. Both the model and the datasets are based on current real world instances introduced by EventMAP Limited. It is hoped that the interest generated as part of ...

The general timetabling problem is an assignment of activ ities to xed time intervals adhering to a prede ned set of resource availabilities Timetabling problems are di cult to solve and can be ex tremely time consuming without some computer assistance In this paper the application of constraint based reasoning to timetable generation is examined Speci cally we consider how a timetabling proble...

Automated timetabling is a current and relevant eld of research. A timetabling problem can be suitably modelled in terms of a set of constraints. Using Constraint Logic Programming we develop methods, techniques and concepts for a combination of interactive and automatic timetabling of university courses and school curricula. An exemplary application of such a timetabling system was developed f...

Timetabling problem is among the most difficult operational tasks and an important step in raising industrial productivity, capability, capacity. Such are usually tackled using metaheuristics techniques that provide intelligent way of suggesting solutions or decision-making. Swarm intelligence including Particle Optimization (PSO) have proved to be effective examples. Different recent experimen...