HAL : hal-00394434, version 1

DOI : 10.1007/978-3-642-01929-6_3

Fiche détaillée

Récupérer au format BibTeX - EndNote - TEI - RefWorks -

6th international conference Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'09), États-Unis d'Amérique (2009)

Sequencing and counting with the multicost-regular constraint

Julien Menana (  Auteur correspondant ) 1, Sophie Demassey 1

(05/2009)

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.

1 :	Laboratoire d'Informatique de Nantes Atlantique (LINA)
	CNRS : UMR6241 – Université de Nantes – Ecole des Mines de Nantes

Domaine

:

Informatique/Recherche opérationnelle

hal-00394434, version 1

http://hal.archives-ouvertes.fr/hal-00394434

oai:hal.archives-ouvertes.fr:hal-00394434

Contributeur : Sophie Demassey <>

Soumis le : Jeudi 11 Juin 2009, 16:09:07

Dernière modification le : Jeudi 11 Juin 2009, 16:23:07