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. © 2013 Springer-Verlag.
CITATION STYLE
Fages, J. G., & Lapègue, T. (2013). Filtering AtMostNValue with difference constraints: Application to the shift minimisation personnel task scheduling problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8124 LNCS, pp. 63–79). https://doi.org/10.1007/978-3-642-40627-0_8
Mendeley helps you to discover research relevant for your work.