IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0286501.html
   My bibliography  Save this article

Flattening the curve: Insights from queueing theory

Author

Listed:
  • Sergio Palomo
  • Jamol J Pender
  • William A Massey
  • Robert C Hampshire

Abstract

The worldwide outbreak of the coronavirus was first identified in 2019 in Wuhan, China. Since then, the disease has spread worldwide. As it is currently spreading in the United States, policy makers, public health officials and citizens are racing to understand the impact of this virus on the United States healthcare system. They fear a rapid influx of patients overwhelming the healthcare system and leading to unnecessary fatalities. Most countries and states in America have introduced mitigation strategies, such as using social distancing to decrease the rate of newly infected people. This is what is usually meant by flattening the curve. In this paper, we use queueing theoretic methods to analyze the time evolution of the number of people hospitalized due to the coronavirus. Given that the rate of new infections varies over time as the pandemic evolves, we model the number of coronavirus patients as a dynamical system based on the theory of infinite server queues with time inhomogeneous Poisson arrival rates. With this model we are able to quantify how flattening the curve affects the peak demand for hospital resources. This allows us to characterize how aggressive societal policy needs to be to avoid overwhelming the capacity of healthcare system. We also demonstrate how curve flattening impacts the elapsed lag between the times of the peak rate of hospitalizations and the peak demand for the hospital resources. Finally, we present empirical evidence from Italy and the United States that supports the insights from our model analysis.

Suggested Citation

  • Sergio Palomo & Jamol J Pender & William A Massey & Robert C Hampshire, 2023. "Flattening the curve: Insights from queueing theory," PLOS ONE, Public Library of Science, vol. 18(6), pages 1-30, June.
    • Handle: RePEc:plo:pone00:0286501
    DOI: 10.1371/journal.pone.0286501
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0286501
    Download Restriction: no
    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0286501&type=printable
    Download Restriction: no
    File URL: https://libkey.io/10.1371/journal.pone.0286501?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. William A. Massey & Jamol Pender, 2018. "Dynamic rate Erlang-A queues," Queueing Systems: Theory and Applications, Springer, vol. 89(1), pages 127-164, June.
    2. Jerome Niyirora & Jamol Pender, 2016. "Optimal staffing in nonstationary service centers with constraints," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(8), pages 615-630, December.
    3. Pender, Jamol, 2016. "Risk measures and their application to staffing nonstationary service systems," European Journal of Operational Research, Elsevier, vol. 254(1), pages 113-126.
    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. Eugene Furman & Adam Diamant & Murat Kristal, 2021. "Customer Acquisition and Retention: A Fluid Approach for Staffing," Production and Operations Management, Production and Operations Management Society, vol. 30(11), pages 4236-4257, November.
    2. Furman, Eugene & Diamant, Adam, 2025. "Optimal capacity planning for cloud service providers with periodic, time-varying demand," European Journal of Operational Research, Elsevier, vol. 322(1), pages 133-146.
    3. Pei, Zhi & Dai, Xu & Yuan, Yilun & Du, Rui & Liu, Changchun, 2021. "Managing price and fleet size for courier service with shared drones," Omega, Elsevier, vol. 104(C).
    4. Ward Whitt, 2018. "A broad view of queueing theory through one issue," Queueing Systems: Theory and Applications, Springer, vol. 89(1), pages 3-14, June.
    5. Vincent Tsz Fai Chow & Zheng Cui & Daniel Zhuoyu Long, 2022. "Target-Oriented Distributionally Robust Optimization and Its Applications to Surgery Allocation," INFORMS Journal on Computing, INFORMS, vol. 34(4), pages 2058-2072, July.
    6. Li, Dongmin & Hu, Qingpei & Wang, Lujia & Yu, Dan, 2019. "Statistical inference for Mt/G/Infinity queueing systems under incomplete observations," European Journal of Operational Research, Elsevier, vol. 279(3), pages 882-901.
    7. Eugene Furman & Alex Cressman & Saeha Shin & Alexey Kuznetsov & Fahad Razak & Amol Verma & Adam Diamant, 2021. "Prediction of personal protective equipment use in hospitals during COVID-19," Health Care Management Science, Springer, vol. 24(2), pages 439-453, June.
    8. Jerome Niyirora & Jamol Pender, 2016. "Optimal staffing in nonstationary service centers with constraints," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(8), pages 615-630, December.
    9. Zhang, Xin & Huang, Ning & Sun, Lina & Zheng, Xiangyu & Guo, Ziyue, 2022. "Modeling congestion considering sequential coupling applications: A network-cell-based method," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 604(C).
    10. William A. Massey & Jamol Pender, 2018. "Dynamic rate Erlang-A queues," Queueing Systems: Theory and Applications, Springer, vol. 89(1), pages 127-164, June.
    11. Gregor Selinka & Raik Stolletz & Thomas I. Maindl, 2022. "Performance Approximation for Time-Dependent Queues with Generally Distributed Abandonments," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 20-38, January.

    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:plo:pone00:0286501. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.