{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T22:20:13Z","timestamp":1725747613146},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642406263"},{"type":"electronic","value":"9783642406270"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40627-0_8","type":"book-chapter","created":{"date-parts":[[2013,9,7]],"date-time":"2013-09-07T07:11:01Z","timestamp":1378537861000},"page":"63-79","source":"Crossref","is-referenced-by-count":4,"title":["Filtering AtMostNValue with Difference Constraints: Application to the Shift Minimisation Personnel Task Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Jean-Guillaume","family":"Fages","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tanguy","family":"Lap\u00e8gue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"8_CR1","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1287\/ijoc.1050.0162","volume":"19","author":"G. Andreello","year":"2007","unstructured":"Andreello, G., Caprara, A., Fischetti, M.: Embedding {0, 1\/2}-cuts in a branch-and-cut framework: A computational study. INFORMS J. on Computing\u00a019(2), 229\u2013238 (2007)","journal-title":"INFORMS J. on Computing"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/3-540-45578-7_15","volume-title":"Principles and Practice of Constraint Programming - CP 2001","author":"N. Beldiceanu","year":"2001","unstructured":"Beldiceanu, N.: Pruning for the minimum constraint family and for the number of distinct values constraint family. In: Walsh, T. (ed.) CP 2001. LNCS, vol.\u00a02239, pp. 211\u2013224. Springer, Heidelberg (2001)"},{"issue":"1","key":"8_CR3","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10601-006-9010-8","volume":"12","author":"N. Beldiceanu","year":"2007","unstructured":"Beldiceanu, N., Carlsson, M., Demassey, S., Petit, T.: Global constraint catalogue: Past, present and future. Constraints\u00a012(1), 21\u201362 (2007)","journal-title":"Constraints"},{"issue":"4","key":"8_CR4","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s10601-006-9001-9","volume":"11","author":"C. Bessi\u00e8re","year":"2006","unstructured":"Bessi\u00e8re, C., Hebrard, E., Hnich, B., Kiziltan, Z., Walsh, T.: Filtering Algorithms for the NValue Constraint. Constraints\u00a011(4), 271\u2013293 (2006)","journal-title":"Constraints"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Bessiere, C., Katsirelos, G., Narodytska, N., Quimper, C.G., Walsh, T.: Propagating conjunctions of alldifferent constraints. CoRR abs\/1004.2626 (2010)","DOI":"10.1609\/aaai.v24i1.7554"},{"issue":"1","key":"8_CR6","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1287\/opre.40.1.S28","volume":"40","author":"M.W. Carter","year":"1992","unstructured":"Carter, M.W., Tovey, C.A.: When is the classroom assignment problem hard? Operations Research\u00a040(1), 28\u201339 (1992)","journal-title":"Operations Research"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/978-3-642-04244-7_18","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"G. Chabert","year":"2009","unstructured":"Chabert, G., Jaulin, L., Lorca, X.: A constraint on the number of distinct vectors with application to localization. In: Gent, I.P. (ed.) CP 2009. LNCS, vol.\u00a05732, pp. 196\u2013210. Springer, Heidelberg (2009)"},{"key":"8_CR8","unstructured":"CHOCO Team: choco: an Open Source Java Constraint Programming Library. Tech. rep., Ecole des Mines de Nantes (2010), http:\/\/www.emn.fr\/z-info\/choco-solver\/"},{"issue":"6","key":"8_CR9","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1287\/inte.24.6.47","volume":"24","author":"M.C. Dijkstra","year":"1994","unstructured":"Dijkstra, M.C., Kroon, L.G., Salomon, M., Van Nunen, J.A.E.E., van Wassenhove, L.N.: Planning the Size and Organization of KLM\u2019s Aircraft Maintenance Personnel. Interfaces\u00a024(6), 47\u201358 (1994)","journal-title":"Interfaces"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1023\/A:1018992120116","volume":"72","author":"D. Dowling","year":"1997","unstructured":"Dowling, D., Krishnamoorthy, M., Mackenzie, H., Sier, D.: Staff rostering at a large international airport. Annals of Operations Research\u00a072, 125\u2013147 (1997)","journal-title":"Annals of Operations Research"},{"issue":"1","key":"8_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0377-2217(03)00095-X","volume":"153","author":"A.T. Ernst","year":"2004","unstructured":"Ernst, A.T., Jiang, H., Krishnamoorthy, M., Sier, D.: Staff scheduling and rostering: A review of applications, methods and models. European Journal of Operational Research\u00a0153(1), 3\u201327 (2004)","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"8_CR12","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1287\/opre.35.6.849","volume":"35","author":"M. Fischetti","year":"1987","unstructured":"Fischetti, M., Martello, S., Toth, P.: The fixed job schedule problem with spread-time constraints. Operations Research\u00a035(6), 849\u2013858 (1987)","journal-title":"Operations Research"},{"issue":"3","key":"8_CR13","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1287\/opre.37.3.395","volume":"37","author":"M. Fischetti","year":"1989","unstructured":"Fischetti, M., Martello, S., Toth, P.: The fixed job schedule problem with working-time constraints. Operations Research\u00a037(3), 395\u2013403 (1989)","journal-title":"Operations Research"},{"key":"8_CR14","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness, 1st edn. W. H. Freeman (January 1979)"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs, 2nd edn. Annals of Discrete Mathematics, vol.\u00a057. Elsevier (2004)","DOI":"10.1016\/S0167-5060(04)80059-1"},{"key":"8_CR16","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1287\/ijoc.1100.0436","volume":"24","author":"S. Gualandi","year":"2012","unstructured":"Gualandi, S., Malucelli, F.: Exact solution of graph coloring problems via constraint programming and column generation. INFORMS J. Comput. Sc.\u00a024, 81\u2013100 (2012)","journal-title":"INFORMS J. Comput. Sc."},{"issue":"1","key":"8_CR17","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF02523693","volume":"18","author":"M.M. Halld\u00f3rsson","year":"1997","unstructured":"Halld\u00f3rsson, M.M., Radhakrishnan, J.: Greed is good: Approximating independent sets in sparse and bounded-degree graphs. Algorithmica\u00a018(1), 145\u2013163 (1997)","journal-title":"Algorithmica"},{"key":"8_CR18","unstructured":"Haralick, R.M., Elliott, G.L.: Increasing tree search efficiency for constraint satisfaction problems. In: Proceedings of the 6th International Joint Conference on Artificial Intelligence, IJCAI 1979, vol.\u00a01, pp. 356\u2013364. Morgan Kaufmann Publishers Inc. (1979)"},{"key":"8_CR19","unstructured":"Kadioglu, S., Malitsky, Y., Sellmann, M., Tierney, K.: Isac - instance-specific algorithm configuration. In: ECAI. Frontiers in Artificial Intelligence and Applications, vol.\u00a0215, pp. 751\u2013756. IOS Press (2010)"},{"key":"8_CR20","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-1-4757-3333-4_20","volume-title":"Optimization Methods and Applications","author":"M. Krishnamoorthy","year":"2001","unstructured":"Krishnamoorthy, M., Ernst, A.T.: The personnel task scheduling problem. In: Optimization Methods and Applications, pp. 343\u2013368. Springer, US (2001)"},{"key":"8_CR21","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.ejor.2011.11.034","volume":"219","author":"M. Krishnamoorthy","year":"2012","unstructured":"Krishnamoorthy, M., Ernst, A., Baatar, D.: Algorithms for large scale shift minimisation personnel task scheduling problems. European Journal of Operational Research\u00a0219, 34\u201348 (2012)","journal-title":"European Journal of Operational Research"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"Kroon, L.G., Salomon, M., Wassenhove, L.N.V.: Exact and approximation algorithms for the tactical fixed interval scheduling problem. Operations Research\u00a045(4) (1997)","DOI":"10.1287\/opre.45.4.624"},{"key":"8_CR23","unstructured":"Lap\u00e8gue, T., Fages, J.G., Prot, D., Bellenguez-Morineau, O.: Personnel Task Scheduling Problem Library (2013), https:\/\/sites.google.com\/site\/ptsplib\/smptsp\/home"},{"issue":"18","key":"8_CR24","doi-asserted-by":"publisher","first-page":"1592","DOI":"10.1016\/j.artint.2009.09.002","volume":"173","author":"C. Lecoutre","year":"2009","unstructured":"Lecoutre, C., Sais, L., Tabary, S., Vidal, V.: Reasoning from last conflict(s) in constraint programming. Artif. Intell.\u00a0173(18), 1592\u20131614 (2009)","journal-title":"Artif. Intell."},{"issue":"4","key":"8_CR25","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/s10732-010-9141-3","volume":"17","author":"R. Leone","year":"2010","unstructured":"Leone, R., Festa, P., Marchitto, E.: A Bus Driver Scheduling Problem: a new mathematical model and a GRASP approximate solution. Journal of Heuristics\u00a017(4), 441\u2013466 (2010)","journal-title":"Journal of Heuristics"},{"key":"8_CR26","unstructured":"L\u00f3pez-Ortiz, A., Quimper, C.G., Tromp, J., van Beek, P.: A fast and simple algorithm for bounds consistency of the alldifferent constraint. In: IJCAI, pp. 245\u2013250. Morgan Kaufmann (2003)"},{"key":"8_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/978-3-642-33558-7_40","volume-title":"Principles and Practice of Constraint Programming","author":"J.N. Monette","year":"2012","unstructured":"Monette, J.N., Flener, P., Pearson, J.: Towards solver-independent propagators. In: Milano, M. (ed.) CP 2012. LNCS, vol.\u00a07514, pp. 544\u2013560. Springer, Heidelberg (2012)"},{"key":"8_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-540-48085-3_24","volume-title":"Principles and Practice of Constraint Programming \u2013 CP\u201999","author":"F. Pachet","year":"1999","unstructured":"Pachet, F., Roy, P.: Automatic generation of music programs. In: Jaffar, J. (ed.) CP 1999. LNCS, vol.\u00a01713, pp. 331\u2013345. Springer, Heidelberg (1999)"},{"key":"8_CR29","unstructured":"R\u00e9gin, J.C.: A Filtering Algorithm for Constraints of Difference in CSPs. In: National Conference on Artificial Intelligence, pp. 362\u2013367. AAAI (1994)"},{"key":"8_CR30","unstructured":"Schulte, C., Stuckey, P.J.: Efficient constraint propagation engines. CoRR abs\/cs\/0611009 (2006)"},{"key":"8_CR31","doi-asserted-by":"crossref","unstructured":"Smet, P., Wauters, T., Mihaylow, M., Vanden Berghe, G.: The shift minimisation personnel task scheduling problem: a new hybrid approach and computational insights. Technical report (2013)","DOI":"10.1016\/j.omega.2014.02.003"},{"issue":"3","key":"8_CR32","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/j.ejor.2012.11.029","volume":"226","author":"J. Van den Bergh","year":"2013","unstructured":"Van den Bergh, J., Beli\u00ebn, J., De Bruecker, P., Demeulemeester, E., De Boeck, L.: Personnel scheduling: A literature review. European Journal of Operational Research\u00a0226(3), 367\u2013385 (2013)","journal-title":"European Journal of Operational Research"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40627-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,4]],"date-time":"2023-07-04T11:09:13Z","timestamp":1688468953000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40627-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642406263","9783642406270"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40627-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}