Abstract
This paper reports on the Second International Nurse Rostering Competition (INRC-II). Its contributions are (1) a new problem formulation which, differently from INRC-I, is a multi-stage procedure, (2) a competition environment that, as in INRC-I, will continue to serve as a growing testbed for search approaches to the INRC-II problem, and (3) final results of the competition. We discuss also the competition environment, which is an infrastructure including problem and instance definitions, testbeds, validation/simulation tools and rules. The hardness of the competition instances has been evaluated through the behaviour of our own solvers, and confirmed by the solvers of the participants. Finally, we discuss general issues about both nurse rostering problems and optimisation competitions in general.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
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–739.
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–324.
Burke, E. K., & Curtois, T. (2014). New approaches to nurse rostering benchmark instances. European Journal of Operational Research, 237(1), 71–81.
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–499.
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.
CPLEX. (2012). CPLEX optimizer. v. 12.5. http://www-01.ibm.com/software/integration/optimization/cplex-optimizer/. Accessed 13 Mar 2018
De Causmaecker, P., & Vanden Berghe, G. (2011). A categorisation of nurse rostering problems. Journal of Scheduling, 14(1), 3–16.
Della Croce, F., & Salassa, F. (2014). A variable neighborhood search based matheuristic for nurse rostering problems. Annals of Operations Research, 218(1), 185–199.
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–765.
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–224). Berlin, Heidelberg: Springer.
Glass, C. A. (2010). The nurse rostering problem: A critical appraisal of the problem structure. European Journal of Operational Research, 202(2), 379–389.
Haspeslagh, S., De Causmaecker, P., Schaerf, A., & Stølevik, M. (2014). The first international nurse rostering competition 2010. Annals of Operations Research, 218, 221–236.
Ikegami, A., & Niwa, A. (2003). A subproblem-centric model and approach to the nurse scheduling problem. Mathematical Programming, 97(3), 517–541.
Jin, H., Post, G., & van der Veen, E. (2016). ORTEC’s 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–501.
Kheiri, A., Özcan, 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–505.
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
Lü, Z., & Hao, J.-K. (2012). Adaptive neighborhood search for nurse rostering. European Journal of Operational Research, 218(3), 865–876.
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–130.
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–75.
Römer, 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–551.
Römer, 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–507.
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–173.
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–251.
Schaerf, A., & Di Gaspero, L. (2007). Measurability and reproducibility in timetabling research: Discussion and proposals. In E. Burke & H. Rudová (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–49). Berlin: Springer.
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–326.
Smet, P., Brucker, P., De Causmaecker, P., & Vanden Berghe, G. (2016). Polynomially solvable personnel rostering problems. European Journal of Operational Research, 249(1), 67–75.
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–308.
Zhouxing, S., Zhuo, W., & Zhipeng, L. (2016). Weighted tabu search for multi-stage nurse rostering problem. SCIENTIA SINICA Informationis, 46(7), 834–854.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ceschia, S., Dang, N., De Causmaecker, P. et al. The Second International Nurse Rostering Competition. Ann Oper Res 274, 171–186 (2019). https://doi.org/10.1007/s10479-018-2816-0
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-018-2816-0