New approaches to nurse rostering benchmark instances

This paper presents the results of developing a branch and price algorithm and an ejection chain method for nurse rostering problems. The approach is general enough to be able to apply it to a wide range of benchmark nurse rostering instances. The majority of the instances are real world applications. They have been collected from a variety of sources including industrial collaborators, other researchers and various publications. The results of entering these algorithms in the 2010 International Nurse Rostering Competition are also presented and discussed. In addition, incorporated within both algorithms is a dynamic programming method which we present. The algorithm contains a number of heuristics and other features which make it very effective on the broad rostering model introduced.

[1]  Gilles Pesant,et al.  A Regular Language Membership Constraint for Finite Sequences of Variables , 2004, CP.

[2]  Jonathan F. Bard,et al.  Preference scheduling for nurses using column generation , 2005, Eur. J. Oper. Res..

[3]  Efthymios Housos,et al.  Hybrid optimization techniques for the workshift and rest assignment of nursing personnel , 2000, Artif. Intell. Medicine.

[4]  Atsuko Ikegami,et al.  A subproblem-centric model and approach to the nurse scheduling problem , 2003, Math. Program..

[5]  S J Darmoni,et al.  HOROPLAN: computer-assisted nurse scheduling using constraint-based programming. , 1995, Journal of the Society for Health Systems.

[6]  Hendrik Van Landeghem,et al.  The State of the Art of Nurse Rostering , 2004, J. Sched..

[7]  Alberto Gómez,et al.  Medical doctor rostering problem in a hospital emergency department by means of genetic algorithms , 2009, Comput. Ind. Eng..

[8]  Roberto Tadei,et al.  A greedy-based neighborhood search approach to a nurse rostering problem , 2004, Eur. J. Oper. Res..

[9]  Gilles Pesant,et al.  A Cost-Regular Based Hybrid Column Generation Approach , 2006, Constraints.

[10]  Harald Meyer auf'm Hofe.  Solving Rostering Tasks as Constraint Optimization , 2000, PATAT.

[11]  Edmund K. Burke,et al.  A scatter search methodology for the nurse rostering problem , 2010, J. Oper. Res. Soc..

[12]  Margarida Moz,et al.  A genetic algorithm approach to a nurse rerostering problem , 2007, Comput. Oper. Res..

[13]  Edmund K. Burke,et al.  A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem , 2004, Eur. J. Oper. Res..

[14]  Fang He,et al.  A Hybrid Constraint Programming Approach for Nurse Rostering Problems , 2008, SGAI Conf..

[15]  Umesh Saxena,et al.  Scheduling Nurses Using Goal-Programming Techniques , 1984 .

[16]  Stefan Irnich,et al.  Shortest Path Problems with Resource Constraints , 2005 .

[17]  P Lagasse.  Physician productivity measurement, methodology and implementation. , 1996, Journal of the Society for Health Systems.

[18]  Andreas T. Ernst,et al.  Staff scheduling and rostering: A review of applications, methods and models , 2004, Eur. J. Oper. Res..

[19]  Edmund K. Burke,et al.  A Time Predefined Variable Depth Search for Nurse Rostering , 2013, INFORMS J. Comput..

[20]  Louis-Martin Rousseau,et al.  Formal languages for integer programming modeling of shift scheduling problems , 2009, Constraints.

[21]  A. Mason,et al.  A Nested Column Generator for solving Rostering Problems with Integer Programming , 1998 .

[22]  Marcus Poggi de Aragão,et al.  Stabilized branch-and-cut-and-price for the generalized assignment problem , 2005, Electron. Notes Discret. Math..

[23]  Jacques Desrosiers,et al.  Selected Topics in Column Generation , 2002, Oper. Res..

[24]  Andrew Lim,et al.  A hybrid AI approach for nurse rostering problem , 2003, SAC '03.

[25]  Georges Weil,et al.  Constraint programming for nurse scheduling , 1995 .

[26]  Mikael Rönnqvist,et al.  Scheduler – A System for Staff Planning , 2004, Ann. Oper. Res..

[27]  Mario Vanhoucke,et al.  Branching strategies in a branch-and-price approach for a multiple objective nurse scheduling problem , 2010, J. Sched..

[28]  Andreas T. Ernst,et al.  An Annotated Bibliography of Personnel Scheduling and Rostering , 2004, Ann. Oper. Res..

[29]  Richard Ellis,et al.  Applications and Innovations in Intelligent Systems VII , 2000, Springer London.

[30]  Edmund K. Burke,et al.  A shift sequence based approach for nurse scheduling and a new benchmark dataset , 2010, J. Heuristics.

[31]  Edmund K. Burke,et al.  A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems , 2010, Eur. J. Oper. Res..

[32]  Sanja Petrovic,et al.  Enhancing case-based reasoning for personnel rostering with selected tabu search concepts , 2007, J. Oper. Res. Soc..

[33]  Brigitte Jaumard,et al.  A generalized linear programming model for nurse scheduling , 1996, Eur. J. Oper. Res..

[34]  Jeffrey E. F. Friedl.  Mastering Regular Expressions , 1997 .

[35]  S. S. Al Sharif,et al.  A 0-1 goal programming model for nurse scheduling , 2005, Comput. Oper. Res..

[36]  I Ozkarahan,et al.  A flexible nurse scheduling support system. , 1987, Computer methods and programs in biomedicine.