{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T04:15:06Z","timestamp":1777090506093,"version":"3.51.4"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,11,3]],"date-time":"2010-11-03T00:00:00Z","timestamp":1288742400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2012,4]]},"DOI":"10.1007\/s10479-010-0804-0","type":"journal-article","created":{"date-parts":[[2010,11,2]],"date-time":"2010-11-02T16:33:59Z","timestamp":1288715639000},"page":"33-57","source":"Crossref","is-referenced-by-count":46,"title":["Local search neighbourhoods for dealing with a novel nurse rostering model"],"prefix":"10.1007","volume":"194","author":[{"given":"Burak","family":"Bilgin","sequence":"first","affiliation":[]},{"given":"Patrick","family":"De Causmaecker","sequence":"additional","affiliation":[]},{"given":"Beno\u00eet","family":"Rossie","sequence":"additional","affiliation":[]},{"given":"Greet","family":"Vanden\u00a0Berghe","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,11,3]]},"reference":[{"issue":"1","key":"804_CR1","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/s10479-007-0214-0","volume":"155","author":"U. Aickelin","year":"2007","unstructured":"Aickelin, U., & Li, J. (2007). An estimation of distribution algorithm for nurse scheduling. Annals of Operations Research, 155(1), 289\u2013309.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"804_CR2","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10951-006-0323-7","volume":"10","author":"J. F. Bard","year":"2007","unstructured":"Bard, J. F., & Purnomo, H. W. (2007). Cyclic preference scheduling of nurses using a Lagrangian-based heuristic. Journal of Scheduling, 10(1), 5\u201323.","journal-title":"Journal of Scheduling"},{"issue":"1","key":"804_CR3","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/s10479-007-0220-2","volume":"155","author":"J. Beli\u00ebn","year":"2007","unstructured":"Beli\u00ebn, J., & Demeulemeester, E. (2007). On the trade-off between staff-decomposed and activity-decomposed column generation for a staff scheduling problem. Annals of Operations Research, 155(1), 143\u2013166.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"804_CR4","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/S0377-2217(03)00096-1","volume":"127","author":"F. Bellanti","year":"2004","unstructured":"Bellanti, F., Carello, G., Della Croce, F., & Tadei, R. (2004). A greedy-based neighborhood search approach to a nurse rostering problem. European Journal of Operational Research, 127(1), 28\u201340.","journal-title":"European Journal of Operational Research"},{"key":"804_CR5","unstructured":"Bilgin, B. (2008). Project web page of automation of nurse rostering in Belgian hospitals. http:\/\/allserv.kahosl.be\/~burak\/project.html ."},{"key":"804_CR6","first-page":"153","volume-title":"Lecture notes in computer science","author":"S. Bourdais","year":"2003","unstructured":"Bourdais, S., Galinier, P., & Pesant, G. (2003). HIBISCUS: A constraint programming application to staff scheduling in health care. In Lecture notes in computer science : Vol.\u00a02833 (pp. 153\u2013167). Berlin: Springer."},{"key":"804_CR7","unstructured":"Brucker, P., Qu, R., Burke, E. K., & Post, G. (2005). A decomposition, construction and post-processing approach for a specific nurse rostering problem. In Proceedings of multidisciplinary international conference on scheduling: theory and applications, Aug, 2005, New York (pp. 397\u2013406)."},{"issue":"4","key":"804_CR8","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1007\/s10732-008-9099-6","volume":"16","author":"P. Brucker","year":"2010","unstructured":"Brucker, P., Burke, E. K., Curtois, T., Qu, R., & Vanden Berghe, G. (2010). A shift sequence based approach for nurse scheduling and a new benchmark dataset. Journal of Heuristics, 16(4), 559\u2013573. doi: 10.1007\/s10732-008-9099-6 .","journal-title":"Journal of Heuristics"},{"issue":"3","key":"804_CR9","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1023\/A:1011291030731","volume":"15","author":"E. K. Burke","year":"2001","unstructured":"Burke, E. K., Cowling, P. I., De Causmaecker, P., & Vanden Berghe, G. (2001a). A memetic approach to the nurse rostering problem. Applied Intelligence, 15(3), 199\u2013214.","journal-title":"Applied Intelligence"},{"key":"804_CR10","first-page":"1139","volume-title":"Proceedings of the 2001 congress on evolutionary computation CEC2001","author":"E. K. Burke","year":"2001","unstructured":"Burke, E. K., De Causmaecker, P., Petrovic, S., & Vanden Berghe, G. (2001b). Fitness evaluation for nurse scheduling problems. In Proceedings of the 2001 congress on evolutionary computation CEC2001 (pp. 1139\u20131146). New York: IEEE Press."},{"issue":"6","key":"804_CR11","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1023\/B:HEUR.0000012446.94732.b6","volume":"9","author":"E. K. Burke","year":"2003","unstructured":"Burke, E. K., Kendall, G., & Soubeiga, E. (2003). A tabu-search hyperheuristic for timetabling and rostering. Journal of Heuristics, 9(6), 451\u2013470.","journal-title":"Journal of Heuristics"},{"key":"804_CR12","first-page":"44.1","volume-title":"Handbook of scheduling: algorithms, models and performance analysis","author":"E. K. Burke","year":"2004","unstructured":"Burke, E. K., De Causmaecker, P., & Vanden Berghe, G. (2004a). Novel Metaheuristic Approaches to Nurse Rostering Problems in Belgian Hospitals. In Handbook of scheduling: algorithms, models and performance analysis (pp. 44.1\u201344.18). Boca Raton: CRC Press."},{"issue":"6","key":"804_CR13","doi-asserted-by":"crossref","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., Vanden Berghe, G., & Van Landeghem, H. (2004b). The state of the art of nurse rostering. Journal of Scheduling, 7(6), 441\u2013499.","journal-title":"Journal of Scheduling"},{"issue":"2","key":"804_CR14","doi-asserted-by":"crossref","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. (2008). A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem. European Journal of Operational Research, 188(2), 330\u2013341.","journal-title":"European Journal of Operational Research"},{"key":"804_CR15","unstructured":"Burke, E. K., Curtois, T., Qu, R., & Vanden Berghe, G. (2009). A scatter search approach to the nurse rostering problem. Journal of the Operational Research Society (accepted for publication)."},{"key":"804_CR16","unstructured":"Curtois, T. (2009). The nurse rostering benchmark data set of the university of nottingham. http:\/\/www.cs.nott.ac.uk\/tec\/NRP\/ ."},{"key":"804_CR17","first-page":"129","volume-title":"Lecture notes in computer science","author":"P. Causmaecker De","year":"2003","unstructured":"De Causmaecker, P., & Vanden Berghe, G. (2003). Relaxation of coverage constraints in hospital personnel rostering. In Lecture notes in computer science : Vol. 2740 (pp. 129\u2013147). Berlin: Springer."},{"key":"804_CR18","unstructured":"De Causmaecker, P., & Vanden Berghe, G. (2009). Categorisation of personnel rostering problems. Working Paper K.U. Leuven."},{"key":"804_CR19","unstructured":"Fr\u00f8yseth, H., St\u00f8levik, M., & Riise, A. (2008). A heuristic approach for solving real world nurse rostering. In The 7th international conference on the practice and theory of automated timetabling, PATAT 2008, Montreal (p. 5)."},{"key":"804_CR20","series-title":"Lecture notes in computer science","first-page":"262","volume-title":"PATAT","author":"L. D. Gaspero","year":"2002","unstructured":"Gaspero, L. D., & Schaerf, A. (2002). Multi-neighbourhood local search with application to course timetabling. In E. K. Burke & P. D. Causmaecker (Eds.), Lecture notes in computer science : Vol. 2740. PATAT (pp. 262\u2013275). Berlin: Springer."},{"issue":"2","key":"804_CR21","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/j.ejor.2009.05.046","volume":"202","author":"C. A. Glass","year":"2010","unstructured":"Glass, C. A., & Knight, R. A. (2010). The nurse rostering problem: a critical appraisal of the problem structure. European Journal of Operational Research, 202(2), 379\u2013389.","journal-title":"European Journal of Operational Research"},{"key":"804_CR22","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/0-306-48056-5_6","volume-title":"Handbook of metaheuristics","author":"P. Hansen","year":"2003","unstructured":"Hansen, P., & Mladenovi\u0107, N. (2003). Variable neighborhood search. In Handbook of metaheuristics (pp. 145\u2013184). Berlin: Springer."},{"issue":"4","key":"804_CR23","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/s10732-007-9013-7","volume":"13","author":"B. Maenhout","year":"2007","unstructured":"Maenhout, B., & Vanhoucke, M. (2007). An electromagnetic meta-heuristic for the nurse scheduling problem. Journal of Heuristics, 13(4), 359\u2013385.","journal-title":"Journal of Heuristics"},{"issue":"1","key":"804_CR24","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/s10479-007-0268-z","volume":"159","author":"B. Maenhout","year":"2008","unstructured":"Maenhout, B., & Vanhoucke, M. (2008). Comparison and hybridization of crossover operators for the nurse scheduling problem. Annals of Operations Research, 159(1), 333\u2013353.","journal-title":"Annals of Operations Research"},{"key":"804_CR25","first-page":"85","volume-title":"Lecture notes in computer science","author":"E. \u00d6zcan","year":"2007","unstructured":"\u00d6zcan, E. (2007). Memes, self-generation and nurse rostering. In Lecture notes in computer science : Vol. 3867 (pp. 85\u2013104). Berlin: Springer."},{"key":"804_CR26","unstructured":"Pesant, G. (2008). Constraint-based rostering. In The 7th international conference on the practice and theory of automated timetabling, PATAT 2008, Montreal (p.\u00a011)."},{"key":"804_CR27","unstructured":"Petrovic, S., & Vanden Berghe, G. (2008). Comparison of algorithms for nurse rostering problems. In The 7th international conference on the practice and theory of automated timetabling, PATAT 2008, Montreal (p.\u00a018)."},{"issue":"8","key":"804_CR28","doi-asserted-by":"crossref","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","volume":"34","author":"D. Pisinger","year":"2007","unstructured":"Pisinger, D., & Ropke, S. (2007). A general heuristic for vehicle routing problems. Computers & Operations Research, 34(8), 2403\u20132435.","journal-title":"Computers & Operations Research"},{"key":"804_CR29","first-page":"40","volume-title":"Lecture notes in computer science","author":"A. Schaerf","year":"2007","unstructured":"Schaerf, A., & Di Gaspero, L. (2007). Measurability and reproducibility in university timetabling research: discussion and proposals. In Lecture notes in computer science : Vol. 3867 (pp. 40\u201349). Berlin: Springer."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-010-0804-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-010-0804-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-010-0804-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:08:03Z","timestamp":1559153283000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-010-0804-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,3]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["804"],"URL":"https:\/\/doi.org\/10.1007\/s10479-010-0804-0","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,11,3]]}}}