IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v74y2023i1p310-329.html
   My bibliography  Save this article

Short-Term nurse schedule adjustments under dynamic patient demand

Author

Listed:
  • Osman T. Aydas
  • Anthony D. Ross
  • Matthew C. Scanlon
  • Buket Aydas

Abstract

We study two-stage short-term staffing adjustments for the upcoming nursing shift. Our proposed adjustments are first used at the beginning of each 4-hour nursing shift, shift t, for the upcoming shift, shift t + 1. Then, after observing actual patient demand for nursing at the start of shift t + 1, we make our final staffing adjustments to meet the patient demand. We model six different adjustment options for the two-stage stochastic programming model, five options available as first-stage decisions and one option available as the second-stage decision. We develop a two-stage stochastic integer programming model, which minimizes total nurse staffing costs and the cost of adjustments to the original schedules, while ensuring the coverage of nursing demand. Our experimental results, using the data from an urban Children’s Hospital, indicate that the developed stochastic nurse schedule adjustment model can deliver cost savings up to 18% for the medical units, compared to alternative no short-term adjustment scheduling models. The proposed stochastic adjustments model successfully keeps average understaffing percentages under 2% throughout the staffing horizon.

Suggested Citation

  • Osman T. Aydas & Anthony D. Ross & Matthew C. Scanlon & Buket Aydas, 2023. "Short-Term nurse schedule adjustments under dynamic patient demand," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 74(1), pages 310-329, January.
  • Handle: RePEc:taf:tjorxx:v:74:y:2023:i:1:p:310-329
    DOI: 10.1080/01605682.2022.2039566
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2022.2039566
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/01605682.2022.2039566?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.

    More about this item

    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:taf:tjorxx:v:74:y:2023:i:1:p:310-329. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    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.