Abstract
The problem of rerostering service schedules is very common in organizations that work shifts around the clock every day of the year with a set number of employees. Whenever one or more workers announce that they will not be able to attend to tasks previously assigned in their schedule, those tasks must be performed at the expense of alterations in the schedules of other workers. These changes should not conflict with the rules laid down by the administration and employment contracts and should affect the previous schedules as little as possible. This is a difficult real problem calling for a computational tool to cope with it easily. In the paper the issue is described in detail in the context of nurse scheduling and formulated as an integer multicommodity flow problem with additional constraints, in a multi-level acyclical network. A heuristic was implemented as a first approach to solving the problem. Subsequently the integer linear programming formulation of the multicommodity flow model and two linear relaxations were tested using CPLEX [2] optimizers. The computational results reported regard real instances from a Lisbon state hospital. Satisfactory rosters were obtained within acceptable computational times in all instances tested, either with the integer optimizer, or with the heuristic. This being so, refinements will be undertaken to embed these methodologies in a decision support system that may assist the head nurse in her daily rerostering activities.
Similar content being viewed by others
References
C. Barnhart, C. Hane and P. Vance, Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems, Operations Research 48(2) (2000) 318–326.
CPLEXR Division, ILOG, Inc., CPLEX Manual (Version 7.0), Using the CPLEX R Callable Library and CPLEX R Mixed Integer Library, Incline Village, NV (1998).
T.A. Feo and J.F. Bard, Flight scheduling and maintenance base planning, Management Science 35(12) (1989) 1415–1432.
K. Holmberg and J. Hellstrand, Solving the uncapacitated network design problem by a lagrangean heuristic and branch-and-bound, Operations Research 46(2) (1998) 247–259.
M. Moz, Um sistema para o planeamento e gestão das escalas do pessoal de enfermagem de uma unidade hospitalar, MSc Dissertation, Institute of Economics and Business Administration, Technical University of Lisbon (1993).
M. Moz and M.T. Almeida, Nurse scheduling – a mathematical programming based approach, Working paper 3/97, Center of Operational Research, Faculty of Science, University of Lisbon (1997).
M. Moz and M. Pato, Formalização do problema da substituição de pessoal de enfermagem em falta a escalas de serviço, Working paper 3/99, Center of Operational Research, Faculty of Science, University of Lisbon (1999).
M. Moz and M. Pato, Integer multicommodity flow model applied to the rerostering of service schedules, Working paper 7/2000, Center of Operational Research, Faculty of Science, University of Lisbon (2000).
S.P. Siferd and W.C. Benton, Workforce staffing and scheduling: hospital nursing specific models, European Journal of Operational Research 60 (1992) 233–246.
V.M. Trivedi and D.M. Warner, A branch and bound algorithm for optimum allocation of float nurses, Management Science 22 (1976) 972–981.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Moz, M., Pato, M.V. An Integer Multicommodity Flow Model Applied to the Rerostering of Nurse Schedules. Annals of Operations Research 119, 285–301 (2003). https://doi.org/10.1023/A:1022907212477
Issue Date:
DOI: https://doi.org/10.1023/A:1022907212477