Nurse rescheduling with shift preferences and minimal disruption

Hospital wards must be staffed 24 hours a day by a limited number of nurses. With a well documented shortage of nurses in many countries, effective scheduling of nurse shifts is crucial. Recent research on nurse scheduling has focused on creating flexible schedules that are attractive to nurses, with the joint aims of improving the quality of care and increasing staff retention. To achieve this, some level of preference scheduling is desirable in a nurse scheduling model. Furthermore, if a nurse is unable to work their assigned shifts or nursing cover requirements change, then gaps will occur in the overall schedule that must be filled by rescheduling in a manner that disrupts a little as possible the existing schedule. Little research has been carried out on rescheduling nurses while considering their own preferences as well as minimising disruption. This paper will present some models for nurse scheduling and rescheduling that consider nurses' preferences, along with some preliminary computational results

[1]  R. Gomory,et al.  A Linear Programming Approach to the Cutting-Stock Problem , 1961 .

[2]  D. Michael Warner,et al.  Scheduling Nursing Personnel According to Nursing Preference: A Mathematical Programming Approach , 1976, Oper. Res..

[3]  Brian W. Kernighan,et al.  AMPL: A Modeling Language for Mathematical Programming , 1993 .

[4]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[5]  Robert Fourer.  Optimization as an Internet Resource , 2000 .

[6]  Michael Kostreva,et al.  Using a circadian rhythms model to evaluate shift schedules , 2002, Ergonomics.

[7]  Margarida Moz,et al.  An Integer Multicommodity Flow Model Applied to the Rerostering of Nurse Schedules , 2003, Ann. Oper. Res..

[8]  Alistair Clark,et al.  Optimization approximations for capacity constrained material requirements planning , 2003 .

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

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

[11]  Margarida Moz,et al.  Solving the Problem of Rerostering Nurse Schedules with Hard Constraints: New Multicommodity Flow Models , 2004, Ann. Oper. Res..

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

[13]  L. Aiken,et al.  The working hours of hospital staff nurses and patient safety. , 2004, Health affairs.

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

[15]  Alistair Clark,et al.  Rolling horizon heuristics for production and setup planning with backlogs and error-prone demand forecasts , 2005 .

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

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

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

[19]  Jeff Linderoth,et al.  Noncommercial Software for Mixed-Integer Linear Programming , 2005 .

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

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

[22]  A. Clark.  Rolling horizon heuristics for production planning and set-up scheduling with backlogs and error-prone demand forecasts , 2005 .

[23]  Kurt M. Bretthauer,et al.  Reexamining the Nurse Scheduling Problem: Staffing Ratios and Nursing Shortages , 2006, Decis. Sci..

[24]  K. Nielsen,et al.  Evaluation of an open-rota system in a Danish psychiatric hospital: a mechanism for improving job satisfaction and work-life balance. , 2006, Journal of nursing management.

[25]  Yang Song,et al.  Self-scheduling for hospital nurses: an attempt and its difficulties. , 2007, Journal of nursing management.

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

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

[28]  D. Medeiros,et al.  Accommodating individual preferences in nurse scheduling via auctions and optimization , 2009, Health Care Management Science.