Skip to Main content Skip to Navigation
New interface

Automates et programmation par contraintes pour la planification de personnel

Julien Menana 1, 2, 3 
2 TASC - Theory, Algorithms and Systems for Constraints
LINA - Laboratoire d'Informatique de Nantes Atlantique, Département informatique - EMN, Inria Rennes – Bretagne Atlantique
Abstract : As soon as a structure is organized, the ability to put the right people at the right time is critical to satisfy the need of a department, a school or a company. We define personnel scheduling problems as the process of building, in an optimized manner, the personnel schedules. The aims of this thesis are to propose a mean to express those problems in a simple and automatic way, avoiding the user to interact with the technical aspects of the resolution. For that matter, we propose to mix the modeling power of automata with the efficiency and modularity of constraint programming for complex problem solving. Thus, we use the expressiveness of the finite multi-valued automata to model complex scheduling rules. Then, to make use of those built automata, we introduce a new filtering algorithm for multi-valued finite automata based on Lagrangian relaxation : multicost-regular. We also introduce a soft version of this constraint that has the ability to penalize violated rules defined by the automaton : soft-multicost-regular. The constraint model is automatically built. It is solved using the constraint library CHOCO and the whole modeling-solving process has been tested on realistic instances from ASAP and NRP10 libraries. The solution search is finally improved using specialized regret-based heuristics using the structure of multicost-regular and soft-multicost-regular.
Complete list of metadata

Cited literature [104 references]  Display  Hide  Download
Contributor : Narendra Jussien Connect in order to contact the contributor
Submitted on : Thursday, February 7, 2013 - 10:40:51 AM
Last modification on : Wednesday, April 27, 2022 - 3:49:38 AM
Long-term archiving on: : Wednesday, May 8, 2013 - 3:52:39 AM


  • HAL Id : tel-00785838, version 1


Julien Menana. Automates et programmation par contraintes pour la planification de personnel. Intelligence artificielle [cs.AI]. Université de Nantes, 2011. Français. ⟨NNT : ⟩. ⟨tel-00785838⟩



Record views


Files downloads