A categorisation of nurse rostering problems

Personnel rostering has received ample attention in recent years. Due to its social and economic relevance and due to its intrinsic complexity, it has become a major subject for scheduling and timetabling researchers. Among the personnel rostering problems, nurse rostering turned out to be particularly complex and difficult. In this paper, we propose a notation for nurse rostering problems along the lines of the α|β|γ notation for scheduling. The system allows extension as well as refinement. It is the aim of the notation to facilitate problem description, classification and systematic study. It enables authors to position the problems in the vaster body of research on the subject. By developing this notation for nurse rostering, we hope that an extension of it will be applicable to a broader domain of personnel rostering.

[1]  Ender Özcan,et al.  Memetic Algorithms for Nurse Rostering , 2005, ISCIS.

[2]  Jan H. van Vuuren,et al.  Finding good nurse duty schedules: a case study , 2007, J. Sched..

[3]  Mario Vanhoucke,et al.  Characterisation and Generation of Nurse Scheduling Problem Instances , 2005 .

[4]  Gerhard Wäscher,et al.  An improved typology of cutting and packing problems , 2007, Eur. J. Oper. Res..

[5]  J. Bard,et al.  Incremental changes in the workforce to accommodate changes in demand , 2006, Health care management science.

[6]  E.K. Burke,et al.  Fitness evaluation for nurse scheduling problems , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[7]  Mario Vanhoucke,et al.  On the characterization and generation of nurse scheduling problem instances , 2009, Eur. J. Oper. Res..

[8]  Mario Vanhoucke,et al.  Comparison and hybridization of crossover operators for the nurse scheduling problem , 2008, Ann. Oper. Res..

[9]  Patrick De Causmaecker,et al.  Local search neighbourhoods for dealing with a novel nurse rostering model , 2012, Ann. Oper. Res..

[10]  P. Brucker,et al.  No . NOTTCS-TR-20071 Adaptive Construction of Nurse Schedules : A Shift Sequence Based Approach , 2007 .

[11]  Andy Hon Wai Chun,et al.  Nurse Rostering at the Hospital Authority of Hong Kong , 2000, AAAI/IAAI.

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

[13]  Peter Brucker,et al.  Scheduling Algorithms , 1995 .

[14]  Patrick De Causmaecker,et al.  Towards a reference model for timetabling and rostering , 2012, Ann. Oper. Res..

[15]  Peter Brucker.  Scheduling algorithms (4. ed.) , 2004 .

[16]  J. M. Thompson,et al.  Solving the multi-objective nurse scheduling problem with a weighted cost function , 2007, Ann. Oper. Res..

[17]  W. C. Benton,et al.  Workforce staffing and scheduling: Hospital nursing specific models , 1992 .

[18]  Toon Calders,et al.  Proceedings of the 21st Benelux conference on Artificial Intelligence , 2009 .

[19]  Jonathan F. Bard,et al.  Hospital-wide reactive scheduling of nurses with preference considerations , 2005 .

[20]  Gilles Pesant,et al.  HIBISCUS: A Constraint Programming Application to Staff Scheduling in Health Care , 2003, CP.

[21]  Patrick De Causmaecker,et al.  Local search neighbourhoods to deal with a novel nurse rostering model , 2008 .

[22]  Xiaochun Jiang,et al.  Taxonomy for integrating scheduling theory and human factors: Review and research opportunities , 2009 .

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

[24]  Cid C. de Souza,et al.  Constructing nurse schedules at large hospitals , 2003 .

[25]  Marco Chiarandini,et al.  Solving Employee Timetabling Problems with Flexible Workload using Tabu Search , 2002 .

[26]  Nottingham Ng.  A Time Pre-defined Variable Depth Search for Nurse Rostering , 2007 .

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

[28]  Hasan Selim,et al.  Nurse Scheduling Using Fuzzy Multiple Objective Programming , 2007, IEA/AIE.

[29]  Mario Vanhoucke,et al.  NSPLib: a Nurse Scheduling Problem Library: a tool to evaluate (meta-)heuristic procedures , 2007 .

[30]  Peter I. Cowling,et al.  A Memetic Approach to the Nurse Rostering Problem , 2001, Applied Intelligence.

[31]  Sanja Petrovic,et al.  Selecting and weighting features using a genetic algorithm in a case-based reasoning approach to personnel rostering , 2006, Eur. J. Oper. Res..

[32]  Nottingham Ng,et al.  A Hybrid Heuristic Ordering and Variable Neighbourhood Search for the Nurse Rostering Problem , 2005 .

[33]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[34]  Xiaodong Li,et al.  Special issue on simulated evolution and learning , 2009, Evol. Intell..

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

[36]  Patrick Brézillon,et al.  Lecture Notes in Artificial Intelligence , 1999 .

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

[38]  Uwe Aickelin,et al.  An estimation of distribution algorithm with intelligent local search for rule-based nurse rostering , 2007, J. Oper. Res. Soc..

[39]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[40]  Jan Węglarz,et al.  Project scheduling : recent models, algorithms, and applications , 1999 .

[41]  Harald Dyckhoff,et al.  A typology of cutting and packing problems , 1990 .

[42]  J. Bard,et al.  A column generation-based approach to solve the preference scheduling problem for nurses with downgrading , 2005 .

[43]  Erik Demeulemeester,et al.  A classification scheme for project scheduling , 1999 .

[44]  Walter J. Gutjahr,et al.  An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria , 2007, Comput. Oper. Res..

[45]  Uwe Aickelin,et al.  An estimation of distribution algorithm for nurse scheduling , 2007, Ann. Oper. Res..

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

[47]  C. Monma,et al.  Handbook in Operations Research and Management Science Volume on \networks" Chapter on \design of Survivable Networks" , 1993 .

[48]  Patrick De Causmaecker,et al.  Towards prediction of algorithm performance in real world optimisation problems , 2009 .

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

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

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

[52]  Sanja Petrovic,et al.  METAHEURISTICS FOR HANDLING TIME INTERVAL COVERAGE CONSTRAINTS IN NURSE SCHEDULING , 2006, Appl. Artif. Intell..

[53]  Gary Yat Chung Wong,et al.  Constraint-based rostering using meta-level reasoning and probability-based ordering , 2004, Eng. Appl. Artif. Intell..

[54]  Rolf H. Möhring,et al.  Resource-constrained project scheduling: Notation, classification, models, and methods , 1999, Eur. J. Oper. Res..

[55]  Sanja Petrovic,et al.  A hybrid metaheuristic case-based reasoning system for nurse rostering , 2009, J. Sched..

[56]  Jonathan F. Bard,et al.  Cyclic preference scheduling of nurses using a Lagrangian-based heuristic , 2007, J. Sched..

[57]  Hiroshi Imai,et al.  Classification of Various Neighborhood Operations for the Nurse Scheduling Problem , 2000, ISAAC.

[58]  Patrick De Causmaecker,et al.  Relaxation of Coverage Constraints in Hospital Personnel Rostering , 2002, PATAT.