Solving the Problem of Rerostering Nurse Schedules with Hard Constraints: New Multicommodity Flow Models

The problem of rerostering nurse schedules arises in hospitals when at least one nurse informs that she will be unable to perform the shifts assigned to her on one or more future work days. As a result, the current roster must be rebuilt in accordance with labour contract rules and institutional requirements. All such restraints are regarded as hard constraints. However, major alterations in the previously assigned nurse schedules must be avoided. This paper is based on a case study of a public hospital in Portugal. It presents two new integer multicommodity flow formulations for the rerostering problem, besides a computational experiment performed using real data. The first model is based on a directed multilevel acyclic network. The aggregation of nodes in this network led to the second model. The results obtained show that the second integer multicommodity flow formulation outperforms the first, both in terms of solution quality, as well as in computational time.

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

[2]  James M. Tien,et al.  On Manpower Scheduling Algorithms , 1982 .

[3]  G. Gallo,et al.  A multi-level bottleneck assignment approach to the bus drivers' rostering problem , 1984 .

[4]  Matteo Fischetti,et al.  Algorithms for railway crew management , 1997, Math. Program..

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

[6]  Antonio Sassano,et al.  A Lagrangian-based heuristic for large-scale set covering problems , 1998, Math. Program..

[7]  Matteo Fischetti,et al.  Algorithms for the Set Covering Problem , 2000, Ann. Oper. Res..

[8]  Ana Paias,et al.  State space relaxation for set covering problems related to bus driver scheduling , 1993 .

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

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

[11]  WarnerD. Michael.  Scheduling Nursing Personnel According to Nursing Preference , 1976 .

[12]  Turgut Aykin,et al.  A comparative evaluation of modeling approaches to the labor shift scheduling problem , 2000, Eur. J. Oper. Res..

[13]  Jonathan F. Bard,et al.  Flight Scheduling and Maintenance Base Planning , 1989 .

[14]  M. V. Pato,et al.  A structural lagrangean relaxation for two-duty period bus driver scheduling problems , 1989 .

[15]  Cynthia Barnhart,et al.  Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems , 2000, Oper. Res..

[16]  Stephen E. Bechtold.  IMPLICIT OPTIMAL AND HEURISTIC LABOR STAFFING IN A MULTIOBJECTIVE, MULTILOCATION ENVIRONMENT* , 1988 .

[17]  Dorit S. Hochbaum,et al.  The multicovering problem , 1992 .