Filtering AtMostNValue with difference constraints: application to the Shift Minimisation Personnel Task Scheduling Problem

Jean-Guillaume Fages (1) , Tanguy Lapègue (2, 3)

1 TASC - Theory, Algorithms and Systems for Constraints
2 IRCCyN - Institut de Recherche en Communications et en Cybernétique de Nantes
3 Mines Nantes - Mines Nantes

This paper introduces a propagator which filters a conjunction of difference constraints and an atMostNValue constraint. This propagator is relevant in many applications such as the Shift Minimisation Personnel Task Scheduling Problem, which is used as a case study all along this paper. Extensive experiments show that it significantly improves a straightforward CP model, so that it competes with best known approaches from Operational Research.

Domaines: Mathématique discrète [cs.DM]

Jean-Guillaume Fages, Tanguy Lapègue. Filtering AtMostNValue with difference constraints: application to the Shift Minimisation Personnel Task Scheduling Problem. 19th International Conference on Principles and Practice of Constraint Programming (CP'13), Sep 2013, Uppsala, France. pp.63-79, ⟨10.1007/978-3-642-40627-0⟩. ⟨hal-00859169⟩