{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T20:41:48Z","timestamp":1769719308216,"version":"3.49.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,2,6]],"date-time":"2020-02-06T00:00:00Z","timestamp":1580947200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,6]],"date-time":"2020-02-06T00:00:00Z","timestamp":1580947200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1007\/s10479-020-03527-6","type":"journal-article","created":{"date-parts":[[2020,2,6]],"date-time":"2020-02-06T10:02:52Z","timestamp":1580983372000},"page":"95-113","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["Solving the static INRC-II nurse rostering problem by simulated annealing based on large neighborhoods"],"prefix":"10.1007","volume":"288","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1191-1929","authenticated-orcid":false,"given":"Sara","family":"Ceschia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1744-2166","authenticated-orcid":false,"given":"Rosita","family":"Guido","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6965-0536","authenticated-orcid":false,"given":"Andrea","family":"Schaerf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,6]]},"reference":[{"issue":"1","key":"3527_CR1","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0166-218X(01)00338-9","volume":"123","author":"RK Ahuja","year":"2002","unstructured":"Ahuja, R. K., Ergun, \u00d6., Orlin, J. B., & Punnen, A. P. (2002). A survey of very large-scale neighborhood search techniques. Discrete Applied Mathematics, 123(1), 75\u2013102.","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"3527_CR2","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1093\/occmed\/kqp162","volume":"60","author":"J Arendt","year":"2010","unstructured":"Arendt, J. (2010). Shift work: Coping with the biological clock. Occupational Medicine, 60(1), 10\u201320.","journal-title":"Occupational Medicine"},{"key":"3527_CR3","unstructured":"Birattari, M., Yuan, Z., Balaprakash, P., & St\u00fctzle, T. (2010). F-race and iterated F-race: An overview. In T. Bartz-Beielstein, M. Chiarandini, L. Paquete & M. Preuss (Eds.), Experimental methods for the analysis of optimization algorithms (pp. 311\u2013336). Berlin: Springer."},{"issue":"6","key":"3527_CR4","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1023\/B:JOSH.0000046076.75950.0b","volume":"7","author":"EK Burke","year":"2004","unstructured":"Burke, E. K., De Causmaecker, P., Berghe, G. V., & Van Landeghem, H. (2004). The state of the art of nurse rostering. Journal of Scheduling, 7(6), 441\u2013499.","journal-title":"Journal of Scheduling"},{"issue":"12","key":"3527_CR5","doi-asserted-by":"publisher","first-page":"1695","DOI":"10.1057\/jors.2013.71","volume":"64","author":"EK Burke","year":"2013","unstructured":"Burke, E. K., Gendreau, M., Hyde, M., Kendall, G., Ochoa, G., \u00d6zcan, E., et al. (2013). Hyper-heuristics: A survey of the state of the art. Journal of the Operational Research Society, 64(12), 1695\u20131724.","journal-title":"Journal of the Operational Research Society"},{"key":"3527_CR6","unstructured":"Ceschia, S., Dang, N. T.\u00a0T., De\u00a0Causmaecker, P., Haspeslagh, S., & Schaerf, A. (2018). Second international nurse rostering competition: Mathematical model. Retrieved December 18, 2019, from http:\/\/mobiz.vives.be\/inrc2\/wp-content\/uploads\/2018\/07\/math_model-updated.pdf."},{"issue":"1\u20132","key":"3527_CR7","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s10479-018-2816-0","volume":"274","author":"S Ceschia","year":"2019","unstructured":"Ceschia, S., Dang, N. T. T., De Causmaecker, P., Haspeslagh, S., & Schaerf, A. (2019). The second international nurse rostering competition. Annals of Operations Research, 274(1\u20132), 171\u2013186.","journal-title":"Annals of Operations Research"},{"key":"3527_CR8","unstructured":"Dang, N. T. T., Ceschia, S., Schaerf, A., De\u00a0Causmaecker, P., & Haspeslagh, S. (2016). Solving the multi-stage nurse rostering problem. In Proceedings of the 11th international conference on the practice and theory of automated timetabling (PATAT-2016) (pp. 473\u2013475)."},{"issue":"1","key":"3527_CR9","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s10479-012-1235-x","volume":"218","author":"F Della Croce","year":"2014","unstructured":"Della Croce, F., & Salassa, F. (2014). A variable neighborhood search based matheuristic for nurse rostering problems. Annals of Operations Research, 218(1), 185\u2013199.","journal-title":"Annals of Operations Research"},{"key":"3527_CR10","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.cor.2018.12.015","volume":"104","author":"A Franzin","year":"2019","unstructured":"Franzin, A., & St\u00fctzle, T. (2019). Revisiting simulated annealing: A component-based analysis. Computers and Operations Research, 104, 191\u2013206.","journal-title":"Computers and Operations Research"},{"issue":"2","key":"3527_CR11","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/j.ejor.2009.05.046","volume":"202","author":"CA 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":"3527_CR12","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.endm.2017.03.005","volume":"58","author":"R Gomes","year":"2017","unstructured":"Gomes, R., Toffolo, T., & Santos, H. G. (2017). Variable neighborhood search accelerated column generation for the nurse rostering problem. Electronic Notes in Discrete Mathematics, 58, 31\u201338.","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"3527_CR13","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10479-012-1062-0","volume":"218","author":"S Haspeslagh","year":"2014","unstructured":"Haspeslagh, S., De Causmaecker, P., Schaerf, A., & St\u00f8levik, M. (2014). The first international nurse rostering competition 2010. Annals of Operations Research, 218, 221\u2013236.","journal-title":"Annals of Operations Research"},{"key":"3527_CR14","unstructured":"Jin, H., Post, G., & van\u00a0der Veen, E. (2016). ORTEC\u00e2\u2019s contribution to the second international nurse rostering competition. In Proceedings of the 11th international conference on the practice and theory of automated timetabling (PATAT-2016) (pp. 599\u2013501)."},{"key":"3527_CR15","unstructured":"Kheiri, A., \u00d6zcan, E., Lewis, R., & Thompson, J. (2016). A sequence-based selection hyper-heuristic: Case study in multi-stage nurse rostering problem. In Proceedings of the 11th international conference on the practice and theory of automated timetabling (PATAT-2016) (pp. 503\u2013505)."},{"key":"3527_CR16","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, D., & Vecchi, M. (1983). Optimization by simulated annealing. Science, 220, 671\u2013680.","journal-title":"Science"},{"key":"3527_CR17","unstructured":"Legrain, A., Omer, J., & Rosat, S. (2017). A rotation-based branch-and-price approach for the nurse scheduling problem. Working paper. Retrieved December 18, 2019, from https:\/\/hal.archives-ouvertes.fr\/hal-01545421."},{"key":"3527_CR18","unstructured":"Legrain, A., Omer, J., & Rosat, S. (2018). An online stochastic algorithm for a dynamic nurse scheduling problem. European Journal of Operational Research, 2018. https:\/\/hal.archives-ouvertes.fr\/hal-01763422\/document."},{"issue":"3","key":"3527_CR19","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1016\/j.ejor.2011.12.016","volume":"218","author":"Z L\u00fc","year":"2012","unstructured":"L\u00fc, Z., & Hao, J.-K. (2012). Adaptive neighborhood search for nurse rostering. European Journal of Operational Research, 218(3), 865\u2013876.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"3527_CR20","first-page":"123","volume":"275","author":"F Mischek","year":"2019","unstructured":"Mischek, F., & Musliu, N. (2019). Integer programming model extensions for a multi-stage nurse rostering problem. Annals of Operations Research, 275(1), 123\u2013143.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"3527_CR21","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1016\/j.ejor.2016.09.030","volume":"258","author":"E Rahimian","year":"2017","unstructured":"Rahimian, E., Akartunali, K., & Levine, J. (2017). A hybrid integer programming and variable neighbourhood search algorithm to solve nurse rostering problems. European Journal of Operational Research, 258(2), 411\u2013423.","journal-title":"European Journal of Operational Research"},{"key":"3527_CR22","unstructured":"R\u00f6mer, M., & Mellouli, T. (2016a). A direct MILP approach based on state-expanded network flows and anticipation for multi-stage nurse rostering under uncertainty. In Proceedings of the 11th international conference on the practice and theory of automated timetabling (PATAT-2016) (pp. 549\u2013551)."},{"key":"3527_CR23","doi-asserted-by":"crossref","unstructured":"R\u00f6mer, M., & Mellouli, T. (2016b). Future demand uncertainty in personnel scheduling: Investigating deterministic lookahead policies using optimization and simulation. In Proceedings of the 30th European conference on modelling and simulation (ECMS 2016) (pp. 502\u2013507).","DOI":"10.7148\/2016-0502"},{"issue":"1","key":"3527_CR24","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10479-014-1594-6","volume":"239","author":"HG Santos","year":"2016","unstructured":"Santos, H. G., Toffolo, T. A. M., Ribas, S., & Gomes, R. A. M. (2016). Integer programming techniques for the nurse rostering problem. Annals of Operations Research, 239(1), 225\u2013251.","journal-title":"Annals of Operations Research"},{"issue":"5","key":"3527_CR25","doi-asserted-by":"publisher","first-page":"1099","DOI":"10.1111\/itor.12357","volume":"24","author":"P Smet","year":"2017","unstructured":"Smet, P., Salassa, F., & Berghe, G. V. (2017). Local and global constraint consistency in personnel rostering. International Transactions in Operational Research, 24(5), 1099\u20131117.","journal-title":"International Transactions in Operational Research"},{"key":"3527_CR26","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/j.cor.2015.02.009","volume":"60","author":"IX Tassopoulos","year":"2015","unstructured":"Tassopoulos, I. X., Solos, I. P., & Beligiannis, G. N. (2015). A two-phase adaptive variable neighborhood approach for nurse rostering. Computers & Operations Research, 60, 150\u2013169.","journal-title":"Computers & Operations Research"},{"issue":"3","key":"3527_CR27","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. (2013). Personnel scheduling: A literature review. European Journal of Operational Research, 226(3), 367\u2013385.","journal-title":"European Journal of Operational Research"},{"key":"3527_CR28","unstructured":"Wickert, T., Sartori, C., & Buriol, L. (2016). A fix-and-optimize VNS algorithm applied to the nurse rostering problem. In Proceedings of matheuristics."},{"key":"3527_CR29","doi-asserted-by":"crossref","unstructured":"Wickert, T.\u00a0I., Smet, P., & Vanden\u00a0Berghe, G. (2019). The nurse rerostering problem: Strategies for reconstructing disrupted schedules. Computers & Operations Research, 104, 319\u2013337.","DOI":"10.1016\/j.cor.2018.12.014"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-020-03527-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-020-03527-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-020-03527-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,5]],"date-time":"2021-02-05T02:11:08Z","timestamp":1612491068000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-020-03527-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,6]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["3527"],"URL":"https:\/\/doi.org\/10.1007\/s10479-020-03527-6","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,6]]},"assertion":[{"value":"6 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}