{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:16:48Z","timestamp":1725603408860},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642237850"},{"type":"electronic","value":"9783642237867"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23786-7_9","type":"book-chapter","created":{"date-parts":[[2011,8,31]],"date-time":"2011-08-31T07:58:42Z","timestamp":1314777522000},"page":"85-99","source":"Crossref","is-referenced-by-count":2,"title":["A Hybrid Approach for Solving Real-World Nurse Rostering Problems"],"prefix":"10.1007","author":[{"given":"Martin","family":"St\u00f8levik","sequence":"first","affiliation":[]},{"given":"Tomas Eric","family":"Nordlander","sequence":"additional","affiliation":[]},{"given":"Atle","family":"Riise","sequence":"additional","affiliation":[]},{"given":"Helle","family":"Fr\u00f8yseth","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","first-page":"838","volume-title":"Proceedings of the Sixteenth National Conference on Artificial Intelligence and the Eleventh Innovative Applications of Artificial Intelligence Conference Innovative Applications of Artificial Intelligence, AAAI 1999\/IAAI 1999","author":"S. Abdennadher","year":"1999","unstructured":"Abdennadher, S., Schlenker, H.: Nurse scheduling using constraint logic programming. In: Proceedings of the Sixteenth National Conference on Artificial Intelligence and the Eleventh Innovative Applications of Artificial Intelligence Conference Innovative Applications of Artificial Intelligence, AAAI 1999\/IAAI 1999, pp. 838\u2013843. American Association for Artificial Intelligence, Menlo Park (1999)"},{"key":"9_CR2","unstructured":"Meyer, H., Meyer auf\u2019m Hofe, H.: Conplan\/siedaplan: Personnel assignment as a problem of hierarchical constraint satisfaction. In: Proceedings on the 3rd International Conference on Practical Applications of Constraint Technologies, pp. 257\u2013272. Practical Application Company Ltd. (1997)"},{"issue":"3","key":"9_CR3","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/S0377-2217(97)00055-6","volume":"98","author":"N. Beaumont","year":"1997","unstructured":"Beaumont, N.: Scheduling staff using mixed integer programming. European Journal of Operational Research\u00a098(3), 473\u2013484 (1997)","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"9_CR4","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/BF01807506","volume":"5","author":"A. Borning","year":"1992","unstructured":"Borning, A., Freeman-Benson, B., Wilson, M.: Constraint hierarchies. LISP and Symbolic Computation\u00a05(3), 223\u2013270 (1992), 10.1007\/BF01807506","journal-title":"LISP and Symbolic Computation"},{"issue":"2","key":"9_CR5","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0377-2217(94)00063-I","volume":"86","author":"M.J. Brusco","year":"1995","unstructured":"Brusco, M.J., Jacobs, L.W.: Cost analysis of alternative formulations for personnel scheduling in continuously operating organizations. European Journal of Operational Research\u00a086(2), 249\u2013261 (1995)","journal-title":"European Journal of Operational Research"},{"key":"9_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/3-540-48873-1_25","volume-title":"Simulated Evolution and Learning","author":"E.K. Burke","year":"1999","unstructured":"Burke, E.K., De Causmaecker, P., Berghe, G.V.: A hybrid tabu search algorithm for the nurse rostering problem. In: McKay, B., Yao, X., Newton, C.S., Kim, J.-H., Furuhashi, T. (eds.) SEAL 1998. LNCS (LNAI), vol.\u00a01585, pp. 187\u2013194. Springer, Heidelberg (1999)"},{"issue":"2","key":"9_CR7","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1016\/j.ejor.2007.04.030","volume":"188","author":"E.K. Burke","year":"2008","unstructured":"Burke, E.K., Curtois, T., Post, G., Qu, R., Veltman, B.: A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem. European Journal of Operational Research\u00a0188(2), 330\u2013341 (2008)","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"9_CR8","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1023\/B:JOSH.0000046076.75950.0b","volume":"7","author":"E.K. Burke","year":"2004","unstructured":"Burke, E.K., De Causmaecker, P., Berghe, G.V., Van Landeghem, H.: The state of the art of nurse rostering. Journal of Scheduling\u00a07(6), 441\u2013499 (2004)","journal-title":"Journal of Scheduling"},{"issue":"2","key":"9_CR9","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1016\/j.ejor.2009.07.036","volume":"203","author":"E.K. Burke","year":"2010","unstructured":"Burke, E.K., Li, J., Qu, R.: A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems. European Journal of Operational Research\u00a0203(2), 484\u2013493 (2010)","journal-title":"European Journal of Operational Research"},{"key":"9_CR10","unstructured":"Carchrae, T., Beck, J.C.: Cost-based large neighborhood search. In: Workshop on Combination of Metaheuristic and Local Search with Constraint Programming Techniques, pp. 28\u201329 (2005)"},{"key":"9_CR11","unstructured":"Chen, J.-G., Yeung, T.: Hybrid expert system approach to nurse scheduling. Computers in Nursing, 183\u2013192 (1993)"},{"issue":"2-3","key":"9_CR12","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/S0377-2217(97)00281-6","volume":"106","author":"K.A. Dowsland","year":"1998","unstructured":"Dowsland, K.A.: Nurse scheduling with tabu search and strategic oscillation. European Journal of Operational Research\u00a0106(2-3), 393\u2013407 (1998)","journal-title":"European Journal of Operational Research"},{"key":"9_CR13","first-page":"211","volume-title":"Search Methodologies - Introductory Tutorials in Optimization and Decision Support Techniques","author":"P. Hansen","year":"2005","unstructured":"Hansen, P., Mladenovic, N.: Variable neighborhood search. In: Burke, E.K., Kendall, G. (eds.) Search Methodologies - Introductory Tutorials in Optimization and Decision Support Techniques, pp. 211\u2013238. Springer, Heidelberg (2005)"},{"key":"9_CR14","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1007\/11504894_110","volume-title":"Innovations in Applied Artificial Intelligence","author":"H. Hattori","year":"2005","unstructured":"Hattori, H., Ito, T., Ozono, T., Shintani, T.: A nurse scheduling system based on dynamic constraint satisfaction problem. In: Ali, M., Esposito, F. (eds.) IEA\/AIE 2005. LNCS (LNAI), vol.\u00a03533, pp. 799\u2013808. Springer, Heidelberg (2005)"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"He, F., Qu, R.: A constraint-directed local search approach to nurse rostering problems. In: Deville, Y., Solnon, C. (eds.) Proceedings 6th International Workshop on Local Search Techniques in Constraint Satisfaction, pp. 69\u201380 (2009)","DOI":"10.4204\/EPTCS.5.6"},{"key":"9_CR16","volume-title":"Stochastic Local Search: Foundations & Applications","author":"H.H. Hoos","year":"2004","unstructured":"Hoos, H.H., St\u00fctzle, T.: Stochastic Local Search: Foundations & Applications. Morgan Kaufmann Publishers Inc., San Francisco (2004)"},{"key":"9_CR17","doi-asserted-by":"publisher","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":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press, New York (1972)"},{"issue":"4","key":"9_CR18","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1287\/inte.1070.0291","volume":"37","author":"D.L. Kellogg","year":"2007","unstructured":"Kellogg, D.L., Walczak, S.: Nurse Scheduling: From Academia to Implementation or Not? INTERFACES\u00a037(4), 355\u2013369 (2007)","journal-title":"INTERFACES"},{"key":"9_CR19","doi-asserted-by":"crossref","first-page":"730","DOI":"10.1145\/952532.952675","volume-title":"Proceedings of the 2003 ACM Symposium on Applied Computing, SAC 2003","author":"H. Li","year":"2003","unstructured":"Li, H., Lim, A., Rodrigues, B.: A hybrid ai approach for nurse rostering problem. In: Proceedings of the 2003 ACM Symposium on Applied Computing, SAC 2003, pp. 730\u2013735. ACM, New York (2003)"},{"key":"9_CR20","first-page":"321","volume-title":"Iterated Local Search","author":"H.R. Louren\u00e7o","year":"2003","unstructured":"Louren\u00e7o, H.R., Martin, O.C., St\u00fctzle, T.: Iterated Local Search, pp. 321\u2013353. Kluwer Academic Publishers, Dordrecht (2003)"},{"issue":"1","key":"9_CR21","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1023\/A:1024460714760","volume":"39","author":"A. Meisels","year":"2003","unstructured":"Meisels, A., Schaerf, A.: Modelling and solving employee timetabling problems. Annals of Mathematics and Artificial Intelligence\u00a039(1), 41\u201359 (2003)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"9_CR22","unstructured":"Heus, K., Chan, G.W.P.: Nurse scheduling with global constraints in chip: Gymnaste. In: Practical Applications of Constraint Technology, PACT (1998)"},{"key":"9_CR23","unstructured":"Post, G., Veltman, B.: Harmonious personnel scheduling. In: Burke, E.K., Trick, M.A. (eds.) PATAT 2004. LNCS, vol.\u00a03616, pp. 557\u2013559. Springer, Heidelberg (2005)"},{"issue":"2","key":"9_CR24","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1006\/jcph.1999.6413","volume":"159","author":"G. Schrimpf","year":"2000","unstructured":"Schrimpf, G., Schneider, J., Stamm-Wilbrandt, H., Dueck, G.: Record breaking optimization results using the ruin and recreate principle. Journal of Computational Physics\u00a0159(2), 139\u2013171 (2000)","journal-title":"Journal of Computational Physics"},{"key":"9_CR25","unstructured":"St\u00f8levik, M., Nordlander, T.E., Riise, A.: SINTEF ICT: Nurse rostering data (2010), http:\/\/www.comihc.org\/index.php\/Test-Beds\/sintef-ict-nurse-rostering-data.html (accessed October 13, 2010)"},{"key":"9_CR26","unstructured":"St\u00f8levik, M., Nordlander, T.E., Riise, A.: A mathematical model for the nurse rostering problem. SINTEF Technical Report A19133 (2011), http:\/\/www.comihc.org\/index.php\/Models\/sintef-ict-nurse-rostering-model.html (accessed April 08, 2011)"},{"issue":"3","key":"9_CR27","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/S0167-6377(96)00042-9","volume":"20","author":"E. Tsang","year":"1997","unstructured":"Tsang, E., Voudouris, C.: Fast local search and guided local search and their application to british telecom\u2019s workforce scheduling problem. Operations Research Letters\u00a020(3), 119\u2013127 (1997)","journal-title":"Operations Research Letters"},{"issue":"2","key":"9_CR28","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0933-3657(00)00062-2","volume":"20","author":"C. Valouxis","year":"2000","unstructured":"Valouxis, C., Housos, E.: Hybrid optimization techniques for the workshift and rest assignment of nursing personnel. Artificial Intelligence in Medicine\u00a020(2), 155\u2013175 (2000); Planning and Scheduling in the Hospital","journal-title":"Artificial Intelligence in Medicine"},{"key":"9_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1007\/3-540-45034-3_72","volume-title":"Developments in Applied Artificial Intelligence","author":"G.Y.C. Wong","year":"2003","unstructured":"Wong, G.Y.C., Chun, H.W.: Nurse rostering using constraint programming and meta-level reasoning. In: Chung, P.W.H., Hinde, C.J., Ali, M. (eds.) IEA\/AIE 2003. LNCS, vol.\u00a02718, pp. 712\u2013721. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23786-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,2]],"date-time":"2021-12-02T10:16:56Z","timestamp":1638440216000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23786-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237850","9783642237867"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23786-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}