Filtering AtMostNValue with difference constraints: Application to the shift minimisation personnel task scheduling problem

Andreello, 2007, Embedding {0,1/2}-cuts in a branch-and-cut framework: a computational study, INFORMS J. Comput., 19, 229, 10.1287/ijoc.1050.0162 Asaf, 2010, Applying constraint programming to identification and assignment of service professionals, vol. 6308, 24 Beldiceanu, 2001, Pruning for the minimum constraint family and for the number of distinct values constraint family, vol. 2239, 211 Beldiceanu, 2007, Global constraint catalogue: past, present and future, Constraints, 12, 21, 10.1007/s10601-006-9010-8 Beldiceanu, 2013, On the reification of global constraints, Constraints, 18, 1, 10.1007/s10601-012-9132-0 Beldiceanu, 2011, A constraint seeker: finding and ranking global constraints from examples, vol. 6876, 12 Bessière, 2006, Filtering algorithms for the NValue constraint, Constraints, 11, 271, 10.1007/s10601-006-9001-9 Borchers, 1999, Csdp, a c library for semidefinite programming, Optim. Methods Softw., 11, 613, 10.1080/10556789908805765 Boussemart, 2004, Boosting systematic search by weighting constraints, 146 Bron, 1973, Algorithm 457: finding all cliques of an undirected graph, Commun. ACM, 16, 575, 10.1145/362342.362367 Burer, 2003, A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization, Math. Program., 95, 329, 10.1007/s10107-002-0352-8 Carter, 1992, When is the classroom assignment problem hard?, Oper. Res., 40, 28, 10.1287/opre.40.1.S28 Chabert, 2009, A constraint on the number of distinct vectors with application to localization, vol. 5732, 196 2010 Debruyne, 1997, Some practicable filtering techniques for the constraint satisfaction problem, 412 Dijkstra, 1994, Planning the size and organization of KLM's aircraft maintenance personnel, Interfaces, 24, 47, 10.1287/inte.24.6.47 Dowling, 1997, Staff rostering at a large international airport, Ann. Oper. Res., 72, 125, 10.1023/A:1018992120116 Erdős, 1979, Choosability in graphs, vol. 26, 125 Ernst, 2004, Staff scheduling and rostering: a review of applications, methods and models, Eur. J. Oper. Res., 153, 3, 10.1016/S0377-2217(03)00095-X F. Fages, On the use of constraint reification within search, 2013, personal communication. Fages, 2013, Filtering atmostnvalue with difference constraints: application to the shift minimisation personnel task scheduling problem, vol. 8124, 63 Feydy, 2011, Half reification and flattening, vol. 6876, 286 Fischetti, 1987, The fixed job schedule problem with spread-time constraints, Oper. Res., 35, 849, 10.1287/opre.35.6.849 Fischetti, 1989, The fixed job schedule problem with working-time constraints, Oper. Res., 37, 395, 10.1287/opre.37.3.395 Flavia, 2006, Exploring the complexity boundary between coloring and list-coloring, Electron. Notes Discrete Math., 25, 41, 10.1016/j.endm.2006.06.064 Flener, 2009, Dynamic structural symmetry breaking for constraint satisfaction problems, Constraints, 14, 506, 10.1007/s10601-008-9059-7 Garey, 1979 Golumbic, 2004, Algorithmic Graph Theory and Perfect Graphs, vol. 57 Gondran, 1984 Gualandi, 2012, Exact solution of graph coloring problems via constraint programming and column generation, INFORMS J. Comput., 24, 81, 10.1287/ijoc.1100.0436 Halldórsson, 1997, Greed is good: approximating independent sets in sparse and bounded-degree graphs, Algorithmica, 18, 145, 10.1007/BF02523693 Haralick, 1979, Increasing tree search efficiency for constraint satisfaction problems, 356 Kadioglu, 2010, Isac – instance-specific algorithm configuration, vol. 215, 751 Kolen, 2007, Interval scheduling: a survey, Nav. Res. Logist., 54, 530, 10.1002/nav.20231 Kovalyov, 2007, Fixed interval scheduling: models, applications, computational complexity and algorithms, Eur. J. Oper. Res., 178, 331, 10.1016/j.ejor.2006.01.049 Krishnamoorthy, 2012, Algorithms for large scale shift minimisation personnel task scheduling problems, Eur. J. Oper. Res., 219, 34, 10.1016/j.ejor.2011.11.034 Krishnamoorthy, 2001, The personnel task scheduling problem, vol. 52, 343 Kroon, 1997, Exact and approximation algorithms for the tactical fixed interval scheduling problem, Oper. Res., 45, 10.1287/opre.45.4.624 Kuip, 2013, Public remark at workshop “CP solvers: modeling, applications, integration, and standartization” Lapègue Lecoutre, 2009, Reasoning from last conflict(s) in constraint programming, Artif. Intell., 173, 1592, 10.1016/j.artint.2009.09.002 Leone, 2010, A bus driver scheduling problem: a new mathematical model and a GRASP approximate solution, J. Heuristics, 17, 441, 10.1007/s10732-010-9141-3 Lin, 2014, Minimizing shifts for personnel task scheduling problems: a three-phase algorithm, Eur. J. Oper. Res., 10.1016/j.ejor.2014.01.035 López-Ortiz, 2003, A fast and simple algorithm for bounds consistency of the alldifferent constraint, 245 Lovász, 1979, On the Shannon capacity of a graph, IEEE Trans. Inf. Theory, 25, 1, 10.1109/TIT.1979.1055985 Michel, 2012, Activity-based search for black-box constraint programming solvers, 228 Monette, 2012, Towards solver-independent propagators, vol. 7514, 544 Pachet, 1999, Automatic generation of music programs, 331 Refalo, 2004, Impact-based search strategies for constraint programming, 557 Régin, 1994, A filtering algorithm for constraints of difference in CSPs, 362 Richter, 2006, Generalizing alldifferent: the somedifferent constraint, vol. 4204, 468 2006 Schrijvers, 2011, Search combinators, 774 Schulte, 2008, Efficient constraint propagation engines, ACM Trans. Program. Lang. Syst., 31, 10.1145/1452044.1452046 Schulte, 2009, Weakly monotonic propagators, 723 Smet, 2013 Van den Bergh, 2013, Personnel scheduling: a literature review, Eur. J. Oper. Res., 226, 367, 10.1016/j.ejor.2012.11.029