A shift sequence based approach for nurse scheduling and a new benchmark dataset

This paper investigates an adaptive constructive method for solving nurse rostering problems. The constraints considered in the problems are categorised into three classes: those that are sequence related, those that are nurse schedule related and those that are roster related. We propose a decomposition approach (to construct solutions) that consists of two stages: (1) to construct high quality sequences for nurses by only considering the sequence constraints, and (2) to iteratively construct schedules for nurses and the overall rosters, based on the sequences built and considering the schedule and roster constraints. In the second stage of the schedule construction, nurses are ordered and selected adaptively according to the quality of the schedules they were assigned to in the last iteration. Greedy local search is carried out during and after the roster construction, in order to improve the (partial) rosters built. We show that the local search heuristic during the roster construction can further improve the constructed solutions for the benchmark problems tested.In addition, we introduce new benchmark nurse rostering datasets which are based upon real world data. The data sets represent a variety of real world constraints. The publication of this problem data to the research community is aimed at closing the gap between theory and practice in nurse scheduling research. One of the main objectives is to encourage more research on these data sets.

[1]  Slim Abdennadher,et al.  Nurse Scheduling using Constraint Logic Programming , 1999, AAAI/IAAI.

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

[3]  Joseph Y.-T. Leung,et al.  Handbook of Scheduling: Algorithms, Models, and Performance Analysis , 2004 .

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

[5]  Edmund K. Burke,et al.  Novel Metaheuristic Approaches to Nurse Rostering Problems in Belgian Hospitals , 2004, Handbook of Scheduling.

[6]  Harvey H. Millar,et al.  Cyclic and non-cyclic scheduling of 12 h shift nurses by network programming , 1998 .

[7]  Sanja Petrovic,et al.  Storing and Adapting Repair Experiences in Employee Rostering , 2002, PATAT.

[8]  Graham Kendall,et al.  Hyper-Heuristics: An Emerging Direction in Modern Search Technology , 2003, Handbook of Metaheuristics.

[9]  Ehud Gudes,et al.  Employee Timetabling, Constraint Networks and Knowledge-Based Rules: A Mixed Approach , 1995, PATAT.

[10]  Larry W. Jacobs,et al.  Cost analysis of alternative formulations for personnel scheduling in continuously operating organizations , 1995 .

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

[12]  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..

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

[14]  Graham Kendall,et al.  A Tabu-Search Hyperheuristic for Timetabling and Rostering , 2003, J. Heuristics.

[15]  Uwe Aickelin,et al.  An Indirect Genetic Algorithm for a Nurse Scheduling Problem , 2004, Comput. Oper. Res..

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

[17]  E. Burke,et al.  Variable neighborhood search for nurse rostering problems , 2004 .

[18]  Masahito Yamamoto,et al.  Evolutionary algorithms for nurse scheduling problem , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[19]  J G Chen,et al.  Hybrid expert-system approach to nurse scheduling. , 1993, Computers in nursing.

[20]  Edmund K. Burke,et al.  A Decomposition, Construction and Post-processing Approach for a Specific Nurse Rostering Problem , 2005 .

[21]  Barry Smyth,et al.  Advances in Case-Based Reasoning , 1996, Lecture Notes in Computer Science.

[22]  Uwe Aickelin,et al.  Exploiting Problem Structure in a Genetic Algorithm Approach to a Nurse Rostering Problem , 2000, ArXiv.

[23]  Edmund K. Burke,et al.  A Hybrid Tabu Search Algorithm for the Nurse Rostering Problem , 1998, SEAL.

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

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

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

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

[28]  Jorge Pinho de Sousa,et al.  Metaheuristics: Computer Decision-Making , 2010 .

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

[30]  Steve Scott,et al.  Case-Bases Incorporating Scheduling Constraint Dimensions - Experiences in Nurse Rostering , 1998, EWCBR.

[31]  Gerhard F. Post,et al.  Harmonious personnel scheduling , 2006 .

[32]  M Warner,et al.  Automated nurse scheduling. , 1991, Journal of the Society for Health Systems.

[33]  Sanja Petrovic,et al.  Determining feature weights using a genetic algorithm in a case-based reasoning approach to personnel rostering , 2004 .

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

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

[36]  Nicholas Beaumont,et al.  Scheduling staff using mixed integer programming , 1997 .

[37]  E. M. L. Beale.  Operational Research and Computers: A Personal View , 1980 .

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

[39]  Kathryn A. Dowsland,et al.  Nurse scheduling with tabu search and strategic oscillation , 1998, Eur. J. Oper. Res..

[40]  Gustave J. Rath,et al.  Nurse Scheduling Using Mathematical Programming , 1976, Oper. Res..