{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T22:31:22Z","timestamp":1776378682666,"version":"3.51.2"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","license":[{"start":{"date-parts":[[2013,4,3]],"date-time":"2013-04-03T00:00:00Z","timestamp":1364947200000},"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"],"DOI":"10.1007\/s10479-013-1357-9","type":"journal-article","created":{"date-parts":[[2013,4,2]],"date-time":"2013-04-02T08:26:45Z","timestamp":1364891205000},"source":"Crossref","is-referenced-by-count":16,"title":["A heuristic algorithm based on multi-assignment procedures for nurse scheduling"],"prefix":"10.1007","author":[{"given":"Ademir Aparecido","family":"Constantino","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dario","family":"Landa-Silva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Everton Luiz","family":"de Melo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Candido Ferreira Xavier","family":"de Mendon\u00e7a","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Douglas Baroni","family":"Rizzato","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wesley","family":"Rom\u00e3o","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,4,3]]},"reference":[{"key":"1357_CR1","unstructured":"Bilgin, B., De Causmaecker, P., Rossie, B., & Vanden Berghe, G. (2008). Local search neighbourhoods to deal with a novel nurse rostering model. In Proceedings of the 7th international conference on practice and theory of automated timetabling, Montreal (pp. WA3-2\/6\u2013WA3-2\/24)."},{"key":"1357_CR2","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, 330\u2013341.","journal-title":"European Journal of Operational Research"},{"key":"1357_CR3","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. (2004). The state of the art of nurse rostering. Journal of Scheduling, 7, 441\u2013499.","journal-title":"Journal of Scheduling"},{"issue":"1","key":"1357_CR4","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s10479-009-0590-8","volume":"196","author":"E. K. Burke","year":"2012","unstructured":"Burke, E. K., Li, J., & Qu, R. (2012). A Pareto-based search methodology for multi-objective nurse scheduling. Annals of Operations Research, 196(1), 91\u2013109.","journal-title":"Annals of Operations Research"},{"key":"1357_CR5","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0166-218X(87)90016-3","volume":"18","author":"G. Carpaneto","year":"1987","unstructured":"Carpaneto, G., & Toth, P. (1987). Primal-dual algorithms for the assignment problem. Discrete Applied Mathematics, 18, 137\u2013153.","journal-title":"Discrete Applied Mathematics"},{"key":"1357_CR6","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/S0377-2217(03)00021-3","volume":"151","author":"B. Cheang","year":"2003","unstructured":"Cheang, B., Li, H., Lim, A., & Rodrigues, B. (2003). Nurse rostering problems\u2014a bibliographic survey. European Journal of Operational Research, 151, 447\u2013460.","journal-title":"European Journal of Operational Research"},{"key":"1357_CR7","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1057\/palgrave.jors.2601319","volume":"53","author":"J. F. Cordeau","year":"2002","unstructured":"Cordeau, J. F., Gendreau, M., Laporte, G., Potvin, J. Y., & Semet, F. (2002). A guide to vehicle routing heuristics. Journal of the Operational Research Society, 53, 512\u2013522.","journal-title":"Journal of the Operational Research Society"},{"issue":"1","key":"1357_CR8","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10951-010-0211-z","volume":"14","author":"P. Causmaecker De","year":"2011","unstructured":"De Causmaecker, P., & Vanden Berghe, G. (2011). A categorisation of nurse rostering problems. Journal of Scheduling, 14(1), 3\u201316.","journal-title":"Journal of Scheduling"},{"key":"1357_CR9","unstructured":"Haspeslagh, S., De Causmaecker, P., Schaerf, A., & St\u00f8levik, M. (2012). The first international nurse rostering competition 2010. Annals of Operations Research. http:\/\/www.springerlink.com\/content\/f2u582476q346r66\/ ."},{"key":"1357_CR10","first-page":"151","volume-title":"O.R. in health","author":"B. Maenhout","year":"2005","unstructured":"Maenhout, B., & Vanhoucke, M. (2005). NSPLib\u2014a Nurse Scheduling Problem Library: a tool to evaluate (meta-)heuristic procedures. In O.R. in health (pp. 151\u2013165). 31st meeting of the EURO working group on OR applied to health services. Amsterdam: Elsevier."},{"key":"1357_CR11","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/11730095_14","volume-title":"New computational results for the nurse scheduling problem: a scatter search algorithm","author":"B. Maenhout","year":"2006","unstructured":"Maenhout, B., & Vanhoucke, M. (2006). Lecture notes in computer science: Vol. 3906. New computational results for the nurse scheduling problem: a scatter search algorithm (pp. 159\u2013170)."},{"key":"1357_CR12","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, 359\u2013385.","journal-title":"Journal of Heuristics"},{"key":"1357_CR13","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, 333\u2013353.","journal-title":"Annals of Operations Research"},{"key":"1357_CR14","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/3-540-40996-3_7","volume-title":"Classification of various neighborhood operations for the nurse scheduling problem","author":"T. Osogami","year":"2000","unstructured":"Osogami, T., & Imai, H. (2000). Lecture notes in computer science: Vol. 1969. Classification of various neighborhood operations for the nurse scheduling problem (pp.\u00a072\u201383)."},{"issue":"1","key":"1357_CR15","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/s10479-010-0808-9","volume":"194","author":"S. Petrovic","year":"2012","unstructured":"Petrovic, S., & Vanden Berghe, G. (2012). A comparison of two approaches to nurse rostering problems. Annals of Operations Research, 194(1), 365\u2013384.","journal-title":"Annals of Operations Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-013-1357-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-013-1357-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-013-1357-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:09:41Z","timestamp":1559138981000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-013-1357-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,3]]},"references-count":15,"alternative-id":["1357"],"URL":"https:\/\/doi.org\/10.1007\/s10479-013-1357-9","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,3]]}}}