Sequencing and counting with the multicost-regular constraint - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

Sequencing and counting with the multicost-regular constraint

Résumé

This paper introduces a global constraint encapsulating a regular constraint together with several cumulative costs. It is motivated in the context of personnel scheduling problems, where a schedule meets patterns and occurrence requirements which are intricately bound. The optimization problem underlying the multicost-regular constraint is NP-hard but it admits an efficient Lagrangian relaxation. Hence, we propose a filtering based on this relaxation. The expressiveness and the efficiency of this new constraint is experimented on personnel scheduling benchmark instances with standard work regulations. The comparative empirical results show how multicost-regular can significantly outperform a decomposed model with regular and global-cardinality constraints.
Fichier principal
Vignette du fichier
cpaior-25-menana.pdf (201.48 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00394434 , version 1 (11-06-2009)

Identifiants

Citer

Julien Menana, Sophie Demassey. Sequencing and counting with the multicost-regular constraint. 6th international conference Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'09), May 2009, United States. pp.178-192, ⟨10.1007/978-3-642-01929-6_3⟩. ⟨hal-00394434⟩
124 Consultations
266 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More