{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T04:14:28Z","timestamp":1777090468653,"version":"3.51.4"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2018,3,20]],"date-time":"2018-03-20T00:00:00Z","timestamp":1521504000000},"content-version":"tdm","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":[[2019,3]]},"DOI":"10.1007\/s10479-018-2816-0","type":"journal-article","created":{"date-parts":[[2018,3,20]],"date-time":"2018-03-20T03:20:57Z","timestamp":1521516057000},"page":"171-186","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":43,"title":["The Second International Nurse Rostering Competition"],"prefix":"10.1007","volume":"274","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-0002-2693-6953","authenticated-orcid":false,"given":"Nguyen","family":"Dang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6763-1945","authenticated-orcid":false,"given":"Patrick","family":"De Causmaecker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8088-2135","authenticated-orcid":false,"given":"Stefaan","family":"Haspeslagh","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":[[2018,3,20]]},"reference":[{"key":"2816_CR1","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1016\/j.asoc.2015.07.004","volume":"35","author":"MA Awadallah","year":"2015","unstructured":"Awadallah, M. A., Bolaji, A. L., & Al-Betar, M. A. (2015). A hybrid artificial bee colony for a nurse rostering problem. Applied Soft Computing, 35, 726\u2013739.","journal-title":"Applied Soft Computing"},{"issue":"4","key":"2816_CR2","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s10729-005-4141-9","volume":"8","author":"JF Bard","year":"2005","unstructured":"Bard, J. F., & Purnomo, H. W. (2005). Short-term nurse scheduling in response to daily fluctuations in supply and demand. Health Care Management Science, 8(4), 315\u2013324.","journal-title":"Health Care Management Science"},{"issue":"1","key":"2816_CR3","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.ejor.2014.01.039","volume":"237","author":"EK Burke","year":"2014","unstructured":"Burke, E. K., & Curtois, T. (2014). New approaches to nurse rostering benchmark instances. European Journal of Operational Research, 237(1), 71\u201381.","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"2816_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., Vanden Berghe, G., & Landeghem, H. V. (2004). The state of the art of nurse rostering. Journal of Scheduling, 7(6), 441\u2013499.","journal-title":"Journal of Scheduling"},{"key":"2816_CR5","unstructured":"Ceschia, S., Dang, N. T. T., De Causmaecker, P., Haspeslagh, S., & Schaerf, A. (2015). Second international nurse rostering competition (INRC-II), problem description and rules. CoRR. arXiv:1501.04177 ."},{"key":"2816_CR6","unstructured":"CPLEX. (2012). CPLEX optimizer. v. 12.5. http:\/\/www-01.ibm.com\/software\/integration\/optimization\/cplex-optimizer\/ . Accessed 13 Mar 2018"},{"issue":"1","key":"2816_CR7","doi-asserted-by":"publisher","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"},{"issue":"1","key":"2816_CR8","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"},{"issue":"8","key":"2816_CR9","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1002\/spe.524","volume":"33","author":"L Gaspero Di","year":"2003","unstructured":"Di Gaspero, L., & Schaerf, A. (2003). EasyLocal++: An object-oriented framework for flexible design of local search algorithms. Software-Practice and Experience, 33(8), 733\u2013765.","journal-title":"Software-Practice and Experience"},{"key":"2816_CR10","doi-asserted-by":"crossref","unstructured":"Geiger, M. J. (2011). Personnel rostering by means of variable neighborhood search. In B. Hu, K. Morasch, S. Pickl, M. Siegle (Eds.), Operations research proceedings 2010 (pp. 219\u2013224). Berlin, Heidelberg: Springer.","DOI":"10.1007\/978-3-642-20009-0_35"},{"issue":"2","key":"2816_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. (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":"2816_CR12","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"},{"issue":"3","key":"2816_CR13","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/s10107-003-0426-2","volume":"97","author":"A Ikegami","year":"2003","unstructured":"Ikegami, A., & Niwa, A. (2003). A subproblem-centric model and approach to the nurse scheduling problem. Mathematical Programming, 97(3), 517\u2013541.","journal-title":"Mathematical Programming"},{"key":"2816_CR14","unstructured":"Jin, H., Post, G., & van\u00a0der Veen, E. (2016). ORTEC\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":"2816_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":"2816_CR16","unstructured":"Legrain, A., Omer, J., & Rosat, S. (2017). A rotation-based branch-and-price approach for the nurse scheduling problem. Working paper. https:\/\/hal.archives-ouvertes.fr\/hal-01545421 . Accessed 13 Mar 2018"},{"issue":"3","key":"2816_CR17","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":"2816_CR18","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1287\/ijoc.1090.0320","volume":"22","author":"B McCollum","year":"2010","unstructured":"McCollum, B., Schaerf, A., Paechter, B., McMullan, P., Lewis, R., Parkes, A. J., et al. (2010). Setting the research agenda in automated timetabling: The second international timetabling competition. INFORMS Journal on Computing, 22(1), 120\u2013130.","journal-title":"INFORMS Journal on Computing"},{"issue":"1","key":"2816_CR19","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10479-013-1340-5","volume":"239","author":"G Post","year":"2016","unstructured":"Post, G., Di Gaspero, L., Kingston, J. H., McCollum, B., & Schaerf, A. (2016). The third international timetabling competition. Annals of Operations Research, 239(1), 69\u201375.","journal-title":"Annals of Operations Research"},{"key":"2816_CR20","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":"2816_CR21","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"},{"key":"2816_CR22","unstructured":"Salassa, F., & Vanden Berghe, G. (2012). A stepping horizon view on nurse rostering. In Proceedings of the 9th international conference on the practice and theory of automated timetabling (PATAT-2012), pp. 161\u2013173."},{"issue":"1","key":"2816_CR23","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., Gomes, R. A. M., & Ribas, S. (2016). Integer programming techniques for the nurse rostering problem. Annals of Operations Research, 239(1), 225\u2013251.","journal-title":"Annals of Operations Research"},{"key":"2816_CR24","unstructured":"Schaerf, A., & Di Gaspero, L. (2007). Measurability and reproducibility in timetabling research: Discussion and proposals. In E.\u00a0Burke & H.\u00a0Rudov\u00e1 (Eds.), Proceedings of the 6th international conference on the practice and theory of automated timetabling (PATAT-2006), selected papers, Volumne 3867 of Lecture Notes in Computer Science (pp. 40\u201349). Berlin: Springer."},{"issue":"1","key":"2816_CR25","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s10479-012-1116-3","volume":"218","author":"P Smet","year":"2014","unstructured":"Smet, P., Bilgin, B., De Causmaecker, P., & Vanden Berghe, G. (2014). Modelling and evaluation issues in nurse rostering. Annals of Operations Research, 218(1), 303\u2013326.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"2816_CR26","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.ejor.2015.08.025","volume":"249","author":"P Smet","year":"2016","unstructured":"Smet, P., Brucker, P., De Causmaecker, P., & Vanden Berghe, G. (2016). Polynomially solvable personnel rostering problems. European Journal of Operational Research, 249(1), 67\u201375.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"2816_CR27","doi-asserted-by":"publisher","first-page":"278","DOI":"10.3390\/a6020278","volume":"6","author":"IP Solos","year":"2013","unstructured":"Solos, I. P., Tassopoulos, I. X., & Beligiannis, G. N. (2013). A generic two-phase stochastic variable neighborhood approach for effectively solving the nurse rostering problem. Algorithms, 6(2), 278\u2013308.","journal-title":"Algorithms"},{"issue":"7","key":"2816_CR28","doi-asserted-by":"crossref","first-page":"834","DOI":"10.1360\/N112015-00284","volume":"46","author":"S Zhouxing","year":"2016","unstructured":"Zhouxing, S., Zhuo, W., & Zhipeng, L. (2016). Weighted tabu search for multi-stage nurse rostering problem. SCIENTIA SINICA Informationis, 46(7), 834\u2013854.","journal-title":"SCIENTIA SINICA Informationis"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-018-2816-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-018-2816-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-018-2816-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,13]],"date-time":"2019-10-13T00:37:17Z","timestamp":1570927037000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-018-2816-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,20]]},"references-count":28,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["2816"],"URL":"https:\/\/doi.org\/10.1007\/s10479-018-2816-0","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,3,20]]},"assertion":[{"value":"20 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}