IDEAS home Printed from https://ideas.repec.org/h/spr/lnopch/978-3-031-92575-7_57.html
   My bibliography  Save this book chapter

An Erlang Loss Bound for Finite Tandem Queues with Intensive-Medium Care Application

Author

Listed:
  • Nico Dijk

    (University of Amsterdam
    University of Twente)

  • Yufan Cui

    (University of Amsterdam)

Abstract

Finite tandem queues are known to be widely applicable but also hard to solve analytically. Particularly by the Covid-19 pandemic these revived as of practical and solvability interest. An Intensive Care system in a hospital can be regarded as a finite tandem queue with a finite Intensive Care (ICU) and a finite Medium Care Unit (MCU) (also known as Step-Down Unit). This may lead to losses or a hold up at the ICU. An ICU patient might pass both stages for recovery and observation. A key-indicator is the ICU congestion probability. The present paper aims to provide: a first-order if not reasonably accurate lower bound by a simple Erlang loss expression and numerical support for a realistic ICU-MCU application.

Suggested Citation

  • Nico Dijk & Yufan Cui, 2025. "An Erlang Loss Bound for Finite Tandem Queues with Intensive-Medium Care Application," Lecture Notes in Operations Research,, Springer.
    • Handle: RePEc:spr:lnopch:978-3-031-92575-7_57
    DOI: 10.1007/978-3-031-92575-7_57
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    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:spr:lnopch:978-3-031-92575-7_57. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.