Interactively solving school timetabling problems using extensions of constraint programming - Archive ouverte HAL
Chapitre D'ouvrage Année : 2005

Interactively solving school timetabling problems using extensions of constraint programming

Résumé

Timetabling problems have been frequently studied due to their wide range of applications. However, they are often solved manually because of the lack of appropriate computer tools. Although many approaches mainly based on local search or constraint programming seem to have been quite successful in recent years, they are often highly dedicated to specific problems and encounter difficulties to take the dynamic and over-constrained nature of such problems. We were confronted with such an over-constrained and dynamic problem in our institution. This paper deals with a timetabling system based on constraint programming with the use of explanations to offer a dynamic behaviour and to allow automatic relaxations of constraints. Our tool has successfully answered the needs of the current planner by providing solutions in a few minutes instead of a week of manual design.We present in this paper the techniques used, the results obtained and a discussion on the effects of the automation of the timetabling process.
Fichier principal
Vignette du fichier
LNCS05.pdf (347.61 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00312705 , version 1 (25-08-2008)

Identifiants

Citer

Hadrien Cambazard, Fabien Demazeau, Narendra Jussien, Philippe David. Interactively solving school timetabling problems using extensions of constraint programming. Practice and Theory of Automated Timetabling V, Springer, pp.190-207, 2005, Lecture Notes in Computer Science, ⟨10.1007/11593577⟩. ⟨hal-00312705⟩
333 Consultations
495 Téléchargements

Altmetric

Partager

More