IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v59y2011i6p1320-1331.html
   My bibliography  Save this article

Nurse Staffing in Medical Units: A Queueing Perspective

Author

Listed:
  • Francis de Véricourt

    (INSEAD, Singapore 138673, Republic of Singapore)

  • Otis B. Jennings

    (Fuqua School of Business, Duke University, Durham, North Carolina 27708)

Abstract

In this paper, we present a closed queueing model to determine efficient nurse staffing policies. We explicitly model the workload experienced by s nurses within a single medical unit with n homogeneous patients as a closed M / M / s // n queueing system, where each patient alternates between requiring assistance and not. The performance of the medical unit is based on the probability of excessive delay, the relative frequency with which the delay between the onset of patient neediness and the provision of care from a nurse exceeds a given time threshold. Using new many-server asymptotic results, we find that effective staffing policies should deviate from threshold-specific nurse-to-patient ratios by factors that take into account the total number of patients present in the unit. In particular, our staffing rule significantly differs from California Bill AB 394, legislation that mandates fixed nurse-to-patient staffing ratios. Simulations show that our results are robust to delay-dependent service times, generally distributed service times, and nonhomogeneous patients, i.e., those with different acuity levels.

Suggested Citation

  • Francis de Véricourt & Otis B. Jennings, 2011. "Nurse Staffing in Medical Units: A Queueing Perspective," Operations Research, INFORMS, vol. 59(6), pages 1320-1331, December.
    • Handle: RePEc:inm:oropre:v:59:y:2011:i:6:p:1320-1331
    DOI: 10.1287/opre.1110.0968
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.1110.0968
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.1110.0968?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
    ---><---

    References listed on IDEAS

    as
    1. Shlomo Halfin & Ward Whitt, 1981. "Heavy-Traffic Limits for Queues with Many Exponential Servers," Operations Research, INFORMS, vol. 29(3), pages 567-588, June.
    2. Opher Baron & Joseph Milner, 2009. "Staffing to Maximize Profit for Call Centers with Alternate Service-Level Agreements," Operations Research, INFORMS, vol. 57(3), pages 685-700, June.
    3. Yifan Liu & Lawrence M. Wein, 2008. "A Queueing Analysis to Determine How Many Additional Beds Are Needed for the Detention and Removal of Illegal Aliens," Management Science, INFORMS, vol. 54(1), pages 1-15, January.
    4. Francis de Véricourt & Otis B. Jennings, 2008. "Dimensioning Large-Scale Membership Services," Operations Research, INFORMS, vol. 56(1), pages 173-187, February.
    5. Avishai Mandelbaum & Sergey Zeltyn, 2009. "Staffing Many-Server Queues with Impatient Customers: Constraint Satisfaction in Call Centers," Operations Research, INFORMS, vol. 57(5), pages 1189-1205, October.
    Full references (including those not matched with items on IDEAS)

    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. Amy R. Ward & Mor Armony, 2013. "Blind Fair Routing in Large-Scale Service Systems with Heterogeneous Customers and Servers," Operations Research, INFORMS, vol. 61(1), pages 228-243, February.
    2. Avishai Mandelbaum & Sergey Zeltyn, 2009. "Staffing Many-Server Queues with Impatient Customers: Constraint Satisfaction in Call Centers," Operations Research, INFORMS, vol. 57(5), pages 1189-1205, October.
    3. Ying Chen & John J. Hasenbein, 2017. "Staffing large-scale service systems with distributional uncertainty," Queueing Systems: Theory and Applications, Springer, vol. 87(1), pages 55-79, October.
    4. Mor Armony & Avishai Mandelbaum, 2011. "Routing and Staffing in Large-Scale Service Systems: The Case of Homogeneous Impatient Customers and Heterogeneous Servers," Operations Research, INFORMS, vol. 59(1), pages 50-65, February.
    5. Niyirora, Jerome & Zhuang, Jun, 2017. "Fluid approximations and control of queues in emergency departments," European Journal of Operational Research, Elsevier, vol. 261(3), pages 1110-1124.
    6. A. J. E. M. Janssen & J. S. H. van Leeuwaarden & Bert Zwart, 2011. "Refining Square-Root Safety Staffing by Expanding Erlang C," Operations Research, INFORMS, vol. 59(6), pages 1512-1522, December.
    7. Josh Reed & Bo Zhang, 2017. "Managing capacity and inventory jointly for multi-server make-to-stock queues," Queueing Systems: Theory and Applications, Springer, vol. 86(1), pages 61-94, June.
    8. Ramandeep S. Randhawa & Sunil Kumar, 2009. "Multiserver Loss Systems with Subscribers," Mathematics of Operations Research, INFORMS, vol. 34(1), pages 142-179, February.
    9. Defraeye, Mieke & Van Nieuwenhuyse, Inneke, 2016. "Staffing and scheduling under nonstationary demand for service: A literature review," Omega, Elsevier, vol. 58(C), pages 4-25.
    10. Noa Zychlinski, 2023. "Applications of fluid models in service operations management," Queueing Systems: Theory and Applications, Springer, vol. 103(1), pages 161-185, February.
    11. Fiona Sloothaak & James Cruise & Seva Shneer & Maria Vlasiou & Bert Zwart, 2021. "Complete resource pooling of a load-balancing policy for a network of battery swapping stations," Queueing Systems: Theory and Applications, Springer, vol. 99(1), pages 65-120, October.
    12. Itay Gurvich & Mor Armony & Constantinos Maglaras, 2009. "Cross-Selling in a Call Center with a Heterogeneous Customer Population," Operations Research, INFORMS, vol. 57(2), pages 299-313, April.
    13. Jouini, Oualid & Pot, Auke & Koole, Ger & Dallery, Yves, 2010. "Online scheduling policies for multiclass call centers with impatient customers," European Journal of Operational Research, Elsevier, vol. 207(1), pages 258-268, November.
    14. Young Myoung Ko & Natarajan Gautam, 2013. "Critically Loaded Time-Varying Multiserver Queues: Computational Challenges and Approximations," INFORMS Journal on Computing, INFORMS, vol. 25(2), pages 285-301, May.
    15. Bo Zhang & Johan S. H. van Leeuwaarden & Bert Zwart, 2012. "Staffing Call Centers with Impatient Customers: Refinements to Many-Server Asymptotics," Operations Research, INFORMS, vol. 60(2), pages 461-474, April.
    16. Achal Bassamboo & Ramandeep S. Randhawa & Assaf Zeevi, 2010. "Capacity Sizing Under Parameter Uncertainty: Safety Staffing Principles Revisited," Management Science, INFORMS, vol. 56(10), pages 1668-1686, October.
    17. Itai Gurvich & Ohad Perry, 2012. "Overflow Networks: Approximations and Implications to Call Center Outsourcing," Operations Research, INFORMS, vol. 60(4), pages 996-1009, August.
    18. Li Xiao & Susan H. Xu & David D. Yao & Hanqin Zhang, 2022. "Optimal staffing for ticket queues," Queueing Systems: Theory and Applications, Springer, vol. 102(1), pages 309-351, October.
    19. Saif Benjaafar & Shining Wu & Hanlin Liu & Einar Bjarki Gunnarsson, 2022. "Dimensioning On-Demand Vehicle Sharing Systems," Management Science, INFORMS, vol. 68(2), pages 1218-1232, February.
    20. Guodong Pang & Ohad Perry, 2015. "A Logarithmic Safety Staffing Rule for Contact Centers with Call Blending," Management Science, INFORMS, vol. 61(1), pages 73-91, January.

    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:inm:oropre:v:59:y:2011:i:6:p:1320-1331. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.