IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v251y2016i2p624-639.html
   My bibliography  Save this article

A novel approach for nurse rerostering based on a parallel algorithm

Author

Listed:
  • Bäumelt, Zdeněk
  • Dvořák, Jan
  • Šůcha, Přemysl
  • Hanzálek, Zdeněk

Abstract

This paper addresses the Nurse Rerostering Problem (NRRP) that arises when a roster is disrupted by unexpected circumstances. The objective is to find a feasible roster having the minimal number of changes with respect to the original one. The problem is solved by a parallel algorithm executed on a graphics processing unit (GPU) to significantly accelerate its performance. To the best of our knowledge, this is the first parallel algorithm solving the NRRP on GPU. The core concept is a unique problem decomposition allowing efficient parallelization. Two parallel algorithms, homogeneous and heterogeneous, are proposed (available online), and their performance evaluated on benchmark datasets in terms of quality of the results compared to the state-of-the-art results and speedup. In general, higher acceleration was obtained by the homogeneous model with speedup 12.6 and 17.7 times on the NRRP dataset with 19 and 32 nurses respectively. These results encourage further research on parallel algorithms to solve Operational Research problems.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:251:y:2016:i:2:p:624-639
    DOI: 10.1016/j.ejor.2015.11.022
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221715010711
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2015.11.022?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.

    References listed on IDEAS

    as
    1. 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.
    2. Atle Riise & Edmund K Burke, 2015. "On parallel local search for permutations," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 66(5), pages 822-831, May.
    3. Cheang, B. & Li, H. & Lim, A. & Rodrigues, B., 2003. "Nurse rostering problems--a bibliographic survey," European Journal of Operational Research, Elsevier, vol. 151(3), pages 447-460, December.
    4. 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.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Karatetskaya Efrosiniya & Lakshina Valeriya, 2018. "Volatility Spillovers With Spatial Effects On The Oil And Gas Market," HSE Working papers WP BRP 72/FE/2018, National Research University Higher School of Economics.
    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. Schoenfelder, Jan & Bretthauer, Kurt M. & Wright, P. Daniel & Coe, Edwin, 2020. "Nurse scheduling with quick-response methods: Improving hospital performance, nurse workload, and patient experience," European Journal of Operational Research, Elsevier, vol. 283(1), pages 390-403.
    4. Schryen, Guido, 2020. "Parallel computational optimization in operations research: A new integrative framework, literature review and research directions," European Journal of Operational Research, Elsevier, vol. 287(1), pages 1-18.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Young-Chae Hong & Amy Cohn & Stephen Gorga & Edmond O’Brien & William Pozehl & Jennifer Zank, 2019. "Using Optimization Techniques and Multidisciplinary Collaboration to Solve a Challenging Real-World Residency Scheduling Problem," Interfaces, INFORMS, vol. 49(3), pages 201-212, May.
    2. Lotfi Hidri & Achraf Gazdar & Mohammed M. Mabkhot, 2020. "Optimized Procedure to Schedule Physicians in an Intensive Care Unit: A Case Study," Mathematics, MDPI, vol. 8(11), pages 1-24, November.
    3. Jan Schoenfelder & Christian Pfefferlen, 2018. "Decision Support for the Physician Scheduling Process at a German Hospital," Service Science, INFORMS, vol. 10(3), pages 215-229, September.
    4. Erhard, Melanie & Schoenfelder, Jan & Fügener, Andreas & Brunner, Jens O., 2018. "State of the art in physician scheduling," European Journal of Operational Research, Elsevier, vol. 265(1), pages 1-18.
    5. 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.
    6. Di Martinelly, Christine & Meskens, Nadine, 2017. "A bi-objective integrated approach to building surgical teams and nurse schedule rosters to maximise surgical team affinities and minimise nurses' idle time," International Journal of Production Economics, Elsevier, vol. 191(C), pages 323-334.
    7. 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.
    8. 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.
    9. Schoenfelder, Jan & Bretthauer, Kurt M. & Wright, P. Daniel & Coe, Edwin, 2020. "Nurse scheduling with quick-response methods: Improving hospital performance, nurse workload, and patient experience," European Journal of Operational Research, Elsevier, vol. 283(1), pages 390-403.
    10. Melissa R. Bowers & Charles E. Noon & Wei Wu & J. Kirk Bass, 2016. "Neonatal Physician Scheduling at the University of Tennessee Medical Center," Interfaces, INFORMS, vol. 46(2), pages 168-182, April.
    11. Volland, Jonas & Fügener, Andreas & Brunner, Jens O., 2017. "A column generation approach for the integrated shift and task scheduling problem of logistics assistants in hospitals," European Journal of Operational Research, Elsevier, vol. 260(1), pages 316-334.
    12. 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.
    13. Ağralı, Semra & Taşkın, Z. Caner & Ünal, A. Tamer, 2017. "Employee scheduling in service industries with flexible employee availability and demand," Omega, Elsevier, vol. 66(PA), pages 159-169.
    14. 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.
    15. Damcı-Kurt, Pelin & Zhang, Minjiao & Marentay, Brian & Govind, Nirmal, 2019. "Improving physician schedules by leveraging equalization: Cases from hospitals in U.S," Omega, Elsevier, vol. 85(C), pages 182-193.
    16. Wolbeck, Lena Antonia, 2019. "Fairness aspects in personnel scheduling," Discussion Papers 2019/16, Free University Berlin, School of Business & Economics.
    17. Rajeswari Muniyan & Rajakumar Ramalingam & Sultan S. Alshamrani & Durgaprasad Gangodkar & Ankur Dumka & Rajesh Singh & Anita Gehlot & Mamoon Rashid, 2022. "Artificial Bee Colony Algorithm with Nelder–Mead Method to Solve Nurse Scheduling Problem," Mathematics, MDPI, vol. 10(15), pages 1-24, July.
    18. Sophie Veldhoven & Gerhard Post & Egbert Veen & Tim Curtois, 2016. "An assessment of a days off decomposition approach to personnel shift scheduling," Annals of Operations Research, Springer, vol. 239(1), pages 207-223, April.
    19. Suk Ho Jin & Ho Yeong Yun & Suk Jae Jeong & Kyung Sup Kim, 2017. "Hybrid and Cooperative Strategies Using Harmony Search and Artificial Immune Systems for Solving the Nurse Rostering Problem," Sustainability, MDPI, vol. 9(7), pages 1-19, June.
    20. Deborah L. Kellogg & Steven Walczak, 2007. "Nurse Scheduling: From Academia to Implementation or Not?," Interfaces, INFORMS, vol. 37(4), pages 355-369, August.

    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:eee:ejores:v:251:y:2016:i:2:p:624-639. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.