IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v128y2004i1p179-19710.1023-banor.0000019104.39239.ed.html
   My bibliography  Save this article

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

Author

Listed:
  • Margarida Moz
  • Margarida Pato

Abstract

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. Copyright Kluwer Academic Publishers 2004

Suggested Citation

  • Margarida Moz & Margarida Pato, 2004. "Solving the Problem of Rerostering Nurse Schedules with Hard Constraints: New Multicommodity Flow Models," Annals of Operations Research, Springer, vol. 128(1), pages 179-197, April.
    • Handle: RePEc:spr:annopr:v:128:y:2004:i:1:p:179-197:10.1023/b:anor.0000019104.39239.ed
    DOI: 10.1023/B:ANOR.0000019104.39239.ed
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/B:ANOR.0000019104.39239.ed
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/B:ANOR.0000019104.39239.ed?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Yücel Öztürkoğlu, 2020. "A Different Approach to Nurse Scheduling Problem: Lagrangian Relaxation," Alphanumeric Journal, Bahadir Fatih Yildirim, vol. 8(2), pages 237-248, December.
    2. Wolbeck, Lena & Kliewer, Natalia & Marques, Inês, 2020. "Fair shift change penalization scheme for nurse rescheduling problems," European Journal of Operational Research, Elsevier, vol. 284(3), pages 1121-1135.
    3. Sanja Petrovic & Greet Berghe, 2012. "A comparison of two approaches to nurse rostering problems," Annals of Operations Research, Springer, vol. 194(1), pages 365-384, April.
    4. Yiting Xing & Ling Li & Zhuming Bi & Marzena Wilamowska‐Korsak & Li Zhang, 2013. "Operations Research (OR) in Service Industries: A Comprehensive Review," Systems Research and Behavioral Science, Wiley Blackwell, vol. 30(3), pages 300-353, May.
    5. Deborah L. Kellogg & Steven Walczak, 2007. "Nurse Scheduling: From Academia to Implementation or Not?," Interfaces, INFORMS, vol. 37(4), pages 355-369, August.
    6. Hassani, Rachid & Desaulniers, Guy & Elhallaoui, Issmail, 2021. "Real-time bi-objective personnel re-scheduling in the retail industry," European Journal of Operational Research, Elsevier, vol. 293(1), pages 93-108.
    7. E. Veen & J. L. Hurink & J. M. J. Schutten & S. T. Uijland, 2016. "A flexible iterative improvement heuristic to support creation of feasible shift rosters in self-rostering," Annals of Operations Research, Springer, vol. 239(1), pages 189-206, April.
    8. Marta Rocha & José Oliveira & Maria Carravilla, 2014. "A constructive heuristic for staff scheduling in the glass industry," Annals of Operations Research, Springer, vol. 217(1), pages 463-478, June.
    9. Van den Bergh, Jorne & Beliën, Jeroen & De Bruecker, Philippe & Demeulemeester, Erik & De Boeck, Liesje, 2013. "Personnel scheduling: A literature review," European Journal of Operational Research, Elsevier, vol. 226(3), pages 367-385.
    10. Khodakaram Salimifard & Sara Bigharaz, 2022. "The multicommodity network flow problem: state of the art classification, applications, and solution methods," Operational Research, Springer, vol. 22(1), pages 1-47, March.
    11. Sanja Petrovic, 2019. "“You have to get wet to learn how to swim” applied to bridging the gap between research into personnel scheduling and its implementation in practice," Annals of Operations Research, Springer, vol. 275(1), pages 161-179, April.
    12. Wang, Wen-Ya & Gupta, Diwakar & Potthoff, Sandra, 2009. "On evaluating the impact of flexibility enhancing strategies on the performance of nurse schedules," Health Policy, Elsevier, vol. 93(2-3), pages 188-200, December.
    13. Maenhout, Broos & Vanhoucke, Mario, 2018. "A perturbation matheuristic for the integrated personnel shift and task re-scheduling problem," European Journal of Operational Research, Elsevier, vol. 269(3), pages 806-823.
    14. Bäumelt, Zdeněk & Dvořák, Jan & Šůcha, Přemysl & Hanzálek, Zdeněk, 2016. "A novel approach for nurse rerostering based on a parallel algorithm," European Journal of Operational Research, Elsevier, vol. 251(2), pages 624-639.
    15. Christopher N. Gross & Andreas Fügener & Jens O. Brunner, 2018. "Online rescheduling of physicians in hospitals," Flexible Services and Manufacturing Journal, Springer, vol. 30(1), pages 296-328, June.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:128:y:2004:i:1:p:179-197:10.1023/b:anor.0000019104.39239.ed. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.