{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T12:57:59Z","timestamp":1772801879749,"version":"3.50.1"},"publisher-location":"London","reference-count":26,"publisher":"Springer London","isbn-type":[{"value":"9781848822146","type":"print"},{"value":"9781848822153","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-1-84882-215-3_16","type":"book-chapter","created":{"date-parts":[[2010,6,7]],"date-time":"2010-06-07T10:46:23Z","timestamp":1275907583000},"page":"211-224","source":"Crossref","is-referenced-by-count":18,"title":["A Hybrid Constraint Programming Approach for Nurse Rostering Problems"],"prefix":"10.1007","author":[{"given":"Rong","family":"Qu","sequence":"first","affiliation":[]},{"given":"Fang","family":"He","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"16_CR1","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1002\/(SICI)1099-1425(200005\/06)3:3<139::AID-JOS41>3.0.CO;2-2","volume":"3","author":"U. Aickelin","year":"2000","unstructured":"U. Aickelin and K. Dowsland. Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem, Journal of Scheduling, 3(3): 139\u2013153, 2000","journal-title":"Journal of Scheduling"},{"issue":"5","key":"16_CR2","first-page":"761","volume":"31","author":"U. Aickelin","year":"2003","unstructured":"U. Aickelin and K. Dowsland. An indirect genetic algorithm for a nurse scheduling problem, Journal of Operations Research Society, 31(5): 761\u2013778, 2003","journal-title":"Journal of Operations Research Society"},{"key":"16_CR3","first-page":"187","volume":"1585","author":"E. K. Burke","year":"1998","unstructured":"E. K. Burke, P. De Causmaecker and G. Vanden Berghe. A hybrid tabu search algorithm for the nurse rostering problem. Lecture Notes in Artificial Intelligence, vol. 1585, 187\u2013194, 1998","journal-title":"Lecture Notes in Artificial Intelligence"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1023\/A:1011291030731","volume":"15","author":"E. K. Burke","year":"2001","unstructured":"E. K. Burke, P. Cowling, P. De Causmaecker and G. Vanden Berghe. A memetic approach to the nurse rostering problem, Applied Intelligence, 15, 119\u2013214, 2001","journal-title":"Applied Intelligence"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"E. K. Burke, P. De Causmaecker, S. Petrovic and G. Vanden Berghe. Variable neighborhood search for nurse rostering problems. In: M.G.C. Resende and J.P. de Sousa (eds.), Metaheuristics: Computer Decision-Making (Combinatorial Optimization Book Series), Kluwer, 153\u2013172, 2003","DOI":"10.1007\/978-1-4757-4137-7_7"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1023\/B:JOSH.0000046076.75950.0b","volume":"7","author":"E. K. Burke","year":"2004","unstructured":"E. K. Burke, P. De Causmaecker, G. Vanden Berghe and H. Van Landeghem. The state of the art of nurse rostering, Journal of Scheduling, 7, 441\u2013499, 2004","journal-title":"Journal of Scheduling"},{"key":"16_CR7","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1016\/j.ejor.2007.04.030","volume":"2","author":"E. K. Burke","year":"2008","unstructured":"E. K. Burke, T. E. Curtois, G. Post, R. Qu and B. Veltman. A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem, European Journal of Operational Research, 2, 330\u2013341, 2008.","journal-title":"European Journal of Operational Research"},{"key":"16_CR8","unstructured":"P. Brucker, R. Qu, E. K. Burke and G. Post. A decomposition, construction and post-processing approach for a specific nurse rostering problem, MISTA\u201905, 397\u2013406. New York, USA, Jul 2005"},{"key":"16_CR9","unstructured":"P. Brucker, E.K. Burke, T. Curtois, R. Qu and G. Vanden Berghe. Adaptive construction of nurse schedules: A shift sequence based approach. Under review at European Journal of Operational Research. Technical Report NOTTCS-TR-2007-1, School of Computer Science, University of Nottingham"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0377-2217(03)00021-3","volume":"151","author":"B. Cheang","year":"2003","unstructured":"B. Cheang, H. Li, A. Lim and B. Rodrigues. Nurse rostering problems \u2014 a bibliographic survey, European Journal of Operational Research, 151, 447\u2013460, 2003","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"16_CR11","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1109\/4233.594027","volume":"1","author":"B. M. W. Cheng","year":"1997","unstructured":"B. M. W. Cheng, J. H. M. Lee, and J. A. C. K. Wu. A nurse rostering system using constraint programming and redundant modelling, IEEE Transactions on information technology in biomedicine, vol. 1(1), 44\u201354, 1997","journal-title":"IEEE Transactions on information technology in biomedicine"},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/S0377-2217(97)00281-6","volume":"106","author":"K. Dowsland","year":"1998","unstructured":"K. Dowsland. Nurse scheduling with tabu search and strategic oscillation, European Journal of Operational Research, 106, 393\u2013407, 1998","journal-title":"European Journal of Operational Research"},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0377-2217(03)00095-X","volume":"153","author":"A.T. Ernst","year":"2004","unstructured":"A.T. Ernst, H. Jiang, M. Krishnamoorthy and D. Sier. Staff scheduling and rostering: A review of applications, methods and models, European Journal of Operational Research, 153, 3\u201327, 2004","journal-title":"European Journal of Operational Research"},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P. Hansen","year":"2001","unstructured":"P. Hansen, N. Mladenovic, Variable Neighborhood Search: Principles and Applications, European Journal of Operational Research, 130, 449\u2013467, 2001","journal-title":"European Journal of Operational Research"},{"key":"16_CR15","unstructured":"J. Hooke, Integrated Methods for Optimization, Springer, 2006"},{"key":"16_CR16","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R. M. Karp","year":"1972","unstructured":"R. M. Karp. Reducibility among combinatorial problems, In: R.E. Miller and J.W. Thatcher (eds.), Complexity of Computer Computations, Plenum Press, New York, 85\u2013103, 1972"},{"key":"16_CR17","first-page":"280","volume-title":"Lecture Notes in Computer Science","author":"H. Meyer","year":"2000","unstructured":"H. Meyer auf\u2019m Hofe. Solving rostering tasks as constraint optimisation. In: Burke E.K. and W. Erben (eds.) Lecture Notes in Computer Science, vol. 2079, 280\u2013297, 2000, Springer, Berlin"},{"key":"16_CR18","first-page":"802","volume-title":"Lecture Notes in Computer Science","author":"T. Muller","year":"2004","unstructured":"T. Muller, R. Bartak and H. Rudova. Iterative forward search algorithm: combining local search with maintaining arc consistency and a conflict-based statistics. Lecture Notes in Computer Science, Vol 3258, 802\u2013817, 2004, Springer, Berlin"},{"key":"16_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/3-540-45578-7_13","volume-title":"Principles and Practice of Constraint Programming-CP01: The Proceedings of the Seventh International Conference","author":"G. Pesant","year":"2001","unstructured":"G. Pesant. A filtering algorithm for the stretch constraint. In: Principles and Practice of Constraint Programming-CP01: The Proceedings of the Seventh International Conference, Lecture Notes in Computer Science, Vol. 2239, 183\u2013195, 2001, Springer, Berlin"},{"key":"16_CR20","unstructured":"G. Post and B. Veltman. Harmonious personnel scheduling. In: E. Burke and M. Trick (eds.), Proceedings of the 5th International Conference on Practice and Automated Timetabling (PATAT\u201904), 557\u2013559, 2004"},{"key":"16_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"542","DOI":"10.1007\/978-3-540-30201-8_40","volume-title":"Principles and Practice of Constraint Programming (CP 2004)","author":"C. G. Quimper","year":"2004","unstructured":"C. G. Quimper, A. Lopez-Ortiz, P. van Beek, and A. Golynski. Improved algorithms for the global cardinality constraint. In: M. Wallace (editor), Principles and Practice of Constraint Programming (CP 2004), Lecture Notes in Computer Science, Vol 3258, 542\u2013556, 2004, Springer, Berlin"},{"key":"16_CR22","unstructured":"J. C. Regin. Generalized arc consistency for global cardinality constraint. National Conference on Artificial Intelligence (AAAI 1996), AAAI Press, 209\u2013215, 1996"},{"key":"16_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/BFb0017428","volume-title":"Principles and Practice of Constraint Programming-CP97: The Proceedings of the Third International Conference","author":"J. C. Regin","year":"1997","unstructured":"J. C. Regin and J. F. Puget. A filtering algorithm for global sequencing constraint, in: Principles and Practice of Constraint Programming-CP97: The Proceedings of the Third International Conference, Lecture Notes in Computer Science, Vol. 1330, 32\u201346, 1997, Springer, Berlin"},{"key":"16_CR24","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1023\/A:1021153305410","volume":"115","author":"L. M. Rousseau","year":"2002","unstructured":"L. M. Rousseau, M. Gendreau and G. Pesant. A general approach to the physician rostering problems, Annals of Operations Research, 115, 193\u2013205, 2002","journal-title":"Annals of Operations Research"},{"key":"16_CR25","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1023\/A:1021105422248","volume":"115","author":"M. Sellmann","year":"2002","unstructured":"M. Sellmann. Crew assignment via constraint programming: integrating column generation and heuristic tree search, Annals of Operations Research, 115, 207\u2013225, 2002","journal-title":"Annals of Operations Research"},{"key":"16_CR26","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1016\/j.engappai.2004.08.001","volume":"17","author":"G.Y.C. Wonga","year":"2004","unstructured":"G.Y.C. Wonga and A.H.W. Chun. Constraint-based rostering using meta-level reasoning and probability-based ordering, Engineering Applications of Artificial Intelligence, 17, 599\u2013610, 2004","journal-title":"Engineering Applications of Artificial Intelligence"}],"container-title":["Applications and Innovations in Intelligent Systems XVI"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-84882-215-3_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,1]],"date-time":"2021-05-01T22:00:12Z","timestamp":1619906412000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-84882-215-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9781848822146","9781848822153"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-1-84882-215-3_16","relation":{},"subject":[],"published":{"date-parts":[[2009]]}}}