| Article ID: | iaor20043662 |
| Country: | Netherlands |
| Volume: | 128 |
| Issue: | 1 |
| Start Page Number: | 179 |
| End Page Number: | 197 |
| Publication Date: | Apr 2004 |
| Journal: | Annals of Operations Research |
| Authors: | Pato Margarida Vaz, Moz Margarida |
| Keywords: | personnel & manpower planning, networks, programming: integer |
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.