Solving dynamic resource constraint project scheduling problems using new constraint programming tools - Archive ouverte HAL Accéder directement au contenu
Chapitre D'ouvrage Année : 2003

Solving dynamic resource constraint project scheduling problems using new constraint programming tools

Résumé

Timetabling problems have been studied a lot over the last decade. Due to the complexity and the variety of such problems, most work concern static problems in which activities to schedule and resources are known in advance, and constraints are fixed. However, every timetabling problem is subject to unexpected events (consider for example, for university timetabling problems, a missing teacher, or a slide projector breakdoawn). In such a situation, one has to quickly build a new solution which takes these events into account and which is preferably not too different form the current one. We introduce in this paper constraint-programming based tools for solving dynamic timetabling problems modelled as RCPSP (Resource-Constrained Project Scheduling Problems). This approach uses explanation-based constraint programming and operational research techniques.
Fichier principal
Vignette du fichier
LNCS03.pdf (286.14 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

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

Identifiants

Citer

Abdallah Elkhyari, Christelle Guéret, Narendra Jussien. Solving dynamic resource constraint project scheduling problems using new constraint programming tools. Practice and Theory of AutomatedTimetabling IV, Springer, pp.39-59, 2003, Lecture Notes in Computer Science, ⟨10.1007/b11828⟩. ⟨hal-00312717⟩
254 Consultations
379 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More