IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v41y2013i5p903-918.html
   My bibliography  Save this article

Reconstructing nurse schedules: Computational insights in the problem size parameters

Author

Listed:
  • Maenhout, Broos
  • Vanhoucke, Mario

Abstract

Managing nursing personnel properly is of critical importance as these resources comprise a vast share of the hospital's operational costs. The organisational support and the managerial policy decisions on the scheduling level are important determinants for the nurses' working conditions and the related quality of care. In this paper, we gain insights and understanding in the consequences and outcomes of various personnel re-rostering characteristics and strategies. We explore the boundaries of the time horizon and the nurse staffing size to consider for the nurse re-rostering problem based on computational experiments in a real-life problem environment.

Suggested Citation

  • Maenhout, Broos & Vanhoucke, Mario, 2013. "Reconstructing nurse schedules: Computational insights in the problem size parameters," Omega, Elsevier, vol. 41(5), pages 903-918.
  • Handle: RePEc:eee:jomega:v:41:y:2013:i:5:p:903-918
    DOI: 10.1016/j.omega.2012.10.010
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305048312002058
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.omega.2012.10.010?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, 2003. "An Integer Multicommodity Flow Model Applied to the Rerostering of Nurse Schedules," Annals of Operations Research, Springer, vol. 119(1), pages 285-301, March.
    2. Medard, Claude P. & Sawhney, Nidhi, 2007. "Airline crew scheduling from planning to operations," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1013-1027, December.
    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. B. Maenhout & M. Vanhoucke, 2008. "Branching Strategies in a Branch-and-Price Approach for a Multiple Objective Nurse Scheduling Problem," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 08/495, Ghent University, Faculty of Economics and Business Administration.
    5. Huisman, Dennis, 2007. "A column generation approach for the rail crew re-scheduling problem," European Journal of Operational Research, Elsevier, vol. 180(1), pages 163-173, July.
    6. Bard, Jonathan F. & Purnomo, Hadi W., 2005. "Preference scheduling for nurses using column generation," European Journal of Operational Research, Elsevier, vol. 164(2), pages 510-534, July.
    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. 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.
    2. Caballini, Claudia & Paolucci, Massimo, 2020. "A rostering approach to minimize health risks for workers: An application to a container terminal in the Italian port of Genoa," Omega, Elsevier, vol. 95(C).
    3. Pieter Smet & Annelies Lejon & Greet Vanden Berghe, 2021. "Demand smoothing in shift design," Flexible Services and Manufacturing Journal, Springer, vol. 33(2), pages 457-484, June.
    4. Ingels, Jonas & Maenhout, Broos, 2019. "Optimised buffer allocation to construct stable personnel shift rosters," Omega, Elsevier, vol. 82(C), pages 102-117.
    5. Ana Paias & Marta Mesquita & Margarida Moz & Margarida Pato, 2021. "A network flow-based algorithm for bus driver rerostering," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(2), pages 543-576, June.
    6. 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.

    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. Dohn, Anders & Mason, Andrew, 2013. "Branch-and-price for staff rostering: An efficient implementation using generic programming and nested column generation," European Journal of Operational Research, Elsevier, vol. 230(1), pages 157-169.
    2. Vanhoucke, Mario & Maenhout, Broos, 2009. "On the characterization and generation of nurse scheduling problem instances," European Journal of Operational Research, Elsevier, vol. 196(2), pages 457-467, July.
    3. Borgonjon, Tessa & Maenhout, Broos, 2022. "An exact approach for the personnel task rescheduling problem with task retiming," European Journal of Operational Research, Elsevier, vol. 296(2), pages 465-484.
    4. B Maenhout & M Vanhoucke, 2009. "The impact of incorporating nurse-specific characteristics in a cyclical scheduling approach," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(12), pages 1683-1698, December.
    5. 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.
    6. Belií«n, Jeroen & Demeulemeester, Erik, 2008. "A branch-and-price approach for integrating nurse and surgery scheduling," European Journal of Operational Research, Elsevier, vol. 189(3), pages 652-668, September.
    7. Alejandro Cataldo & Juan-Carlos Ferrer & Jaime Miranda & Pablo A. Rey & Antoine Sauré, 2017. "An integer programming approach to curriculum-based examination timetabling," Annals of Operations Research, Springer, vol. 258(2), pages 369-393, November.
    8. Edmund Burke & Jingpeng Li & Rong Qu, 2012. "A Pareto-based search methodology for multi-objective nurse scheduling," Annals of Operations Research, Springer, vol. 196(1), pages 91-109, July.
    9. Deborah L. Kellogg & Steven Walczak, 2007. "Nurse Scheduling: From Academia to Implementation or Not?," Interfaces, INFORMS, vol. 37(4), pages 355-369, August.
    10. Ran Liu & Xiaolan Xie, 2018. "Physician Staffing for Emergency Departments with Time-Varying Demand," INFORMS Journal on Computing, INFORMS, vol. 30(3), pages 588-607, August.
    11. Potthoff, D. & Huisman, D. & Desaulniers, G., 2008. "Column generation with dynamic duty selection for railway crew rescheduling," Econometric Institute Research Papers EI 2008-28, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    12. Broos Maenhout & Mario Vanhoucke, 2013. "Analyzing the nursing organizational structure and process from a scheduling perspective," Health Care Management Science, Springer, vol. 16(3), pages 177-196, September.
    13. Topaloglu, Seyda, 2009. "A shift scheduling model for employees with different seniority levels and an application in healthcare," European Journal of Operational Research, Elsevier, vol. 198(3), pages 943-957, November.
    14. Jens Brunner & Günther Edenharter, 2011. "Long term staff scheduling of physicians with different experience levels in hospitals using column generation," Health Care Management Science, Springer, vol. 14(2), pages 189-202, June.
    15. Burke, Edmund K. & Li, Jingpeng & Qu, Rong, 2010. "A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems," European Journal of Operational Research, Elsevier, vol. 203(2), pages 484-493, June.
    16. Hadi W. Purnomo & Jonathan F. Bard, 2007. "Cyclic preference scheduling for nurses using branch and price," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(2), pages 200-220, March.
    17. Frederik Knust & Lin Xie, 2019. "Simulated annealing approach to nurse rostering benchmark and real-world instances," Annals of Operations Research, Springer, vol. 272(1), pages 187-216, January.
    18. Maenhout, Broos & Vanhoucke, Mario, 2013. "An integrated nurse staffing and scheduling analysis for longer-term nursing staff allocation problems," Omega, Elsevier, vol. 41(2), pages 485-499.
    19. 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.
    20. Turhan, Aykut Melih & Bilgen, Bilge, 2022. "A mat-heuristic based solution approach for an extended nurse rostering problem with skills and units," Socio-Economic Planning Sciences, Elsevier, vol. 82(PB).

    More about this item

    Keywords

    Personnel planning; Re-rostering;

    Statistics

    Access and download statistics

    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:jomega:v:41:y:2013:i:5:p:903-918. 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/wps/find/journaldescription.cws_home/375/description#description .

    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.