IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v58y2012i7p1273-1291.html
   My bibliography  Save this article

On Fair Routing from Emergency Departments to Hospital Wards: QED Queues with Heterogeneous Servers

Author

Listed:
  • Avishai Mandelbaum

    (Faculty of Industrial Engineering and Management, Technion-Israel Institute of Technology, Haifa 32000, Israel)

  • Petar Momčilović

    (Department of Industrial and Systems Engineering, University of Florida, Gainesville, Florida 32611)

  • Yulia Tseytlin

    (Faculty of Industrial Engineering and Management, Technion-Israel Institute of Technology, Haifa 32000, Israel; and IBM Research Lab, Haifa University, Haifa 31905, Israel)

Abstract

The interface between an emergency department and internal wards is often a hospital's bottleneck. Motivated by this interaction in an anonymous hospital, we analyze queueing systems with heterogeneous server pools, where the pools represent the wards, and the servers are beds. Our queueing system, with a single centralized queue and several server pools, forms an inverted- V model. We introduce the randomized most-idle (RMI) routing policy and analyze it in the quality- and efficiency-driven regime, which is natural in our setting. The RMI policy results in the same server fairness (measured by idleness ratios) as the longest-idle-server-first (LISF) policy, which is commonly used in call centers and considered fair. However, the RMI policy utilizes only the information on the number of idle servers in different pools, whereas the LISF policy requires information that is unavailable in hospitals on a real-time basis. This paper was accepted by Assaf Zeevi, stochastic models and simulation.

Suggested Citation

  • Avishai Mandelbaum & Petar Momčilović & Yulia Tseytlin, 2012. "On Fair Routing from Emergency Departments to Hospital Wards: QED Queues with Heterogeneous Servers," Management Science, INFORMS, vol. 58(7), pages 1273-1291, July.
    • Handle: RePEc:inm:ormnsc:v:58:y:2012:i:7:p:1273-1291
    DOI: 10.1287/mnsc.1110.1491
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.1110.1491
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.1110.1491?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. Itay Gurvich & Ward Whitt, 2009. "Queue-and-Idleness-Ratio Controls in Many-Server Service Systems," Mathematics of Operations Research, INFORMS, vol. 34(2), pages 363-396, May.
    2. 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.
    3. Shlomo Halfin & Ward Whitt, 1981. "Heavy-Traffic Limits for Queues with Many Exponential Servers," Operations Research, INFORMS, vol. 29(3), pages 567-588, June.
    4. Diwas S. Kc & Christian Terwiesch, 2009. "Impact of Workload on Service Time and Patient Safety: An Econometric Analysis of Hospital Operations," Management Science, INFORMS, vol. 55(9), pages 1486-1498, September.
    5. A. Bruin & R. Bekker & L. Zanten & G. Koole, 2010. "Dimensioning hospital wards using the Erlang loss model," Annals of Operations Research, Springer, vol. 178(1), pages 23-43, July.
    6. Paula González & Carmen Herrero, 2004. "Optimal sharing of surgical costs in the presence of queues," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 59(3), pages 435-446, July.
    7. J. G. Dai & Tolga Tezcan, 2011. "State Space Collapse in Many-Server Diffusion Limits of Parallel Server Systems," Mathematics of Operations Research, INFORMS, vol. 36(2), pages 271-320, May.
    8. Sem Borst & Avi Mandelbaum & Martin I. Reiman, 2004. "Dimensioning Large Call Centers," Operations Research, INFORMS, vol. 52(1), pages 17-34, February.
    9. Noah Gans & Ger Koole & Avishai Mandelbaum, 2003. "Telephone Call Centers: Tutorial, Review, and Research Prospects," Manufacturing & Service Operations Management, INFORMS, vol. 5(2), pages 79-141, September.
    10. R. Bekker & A. Bruin, 2010. "Time-dependent analysis for refused admissions in clinical wards," Annals of Operations Research, Springer, vol. 178(1), pages 45-65, July.
    11. 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.
    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. Jinsheng Chen & Jing Dong & Pengyi Shi, 2020. "A survey on skill-based routing with applications to service operations management," Queueing Systems: Theory and Applications, Springer, vol. 96(1), pages 53-82, October.
    2. Noa Zychlinski, 2023. "Applications of fluid models in service operations management," Queueing Systems: Theory and Applications, Springer, vol. 103(1), pages 161-185, February.
    3. 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.
    4. 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.
    5. Ragavendran Gopalakrishnan & Sherwin Doroudi & Amy R. Ward & Adam Wierman, 2016. "Routing and Staffing When Servers Are Strategic," Operations Research, INFORMS, vol. 64(4), pages 1033-1050, August.
    6. Heemskerk, M. & Mandjes, M. & Mathijsen, B., 2022. "Staffing for many-server systems facing non-standard arrival processes," European Journal of Operational Research, Elsevier, vol. 296(3), pages 900-913.
    7. Zhong, Zhiheng & Cao, Ping, 2023. "Balanced routing with partial information in a distributed parallel many-server queueing system," European Journal of Operational Research, Elsevier, vol. 304(2), pages 618-633.
    8. Rouba Ibrahim & Mor Armony & Achal Bassamboo, 2017. "Does the Past Predict the Future? The Case of Delay Announcements in Service Systems," Management Science, INFORMS, vol. 63(6), pages 1762-1780, June.
    9. 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.
    10. Achal Bassamboo & Assaf Zeevi, 2009. "On a Data-Driven Method for Staffing Large Call Centers," Operations Research, INFORMS, vol. 57(3), pages 714-726, June.
    11. René Bekker & Dennis Moeke & Bas Schmidt, 2019. "Keeping pace with the ebbs and flows in daily nursing home operations," Health Care Management Science, Springer, vol. 22(2), pages 350-363, June.
    12. van Leeuwaarden, Johan S.H. & Knessl, Charles, 2011. "Transient behavior of the Halfin-Whitt diffusion," Stochastic Processes and their Applications, Elsevier, vol. 121(7), pages 1524-1545, July.
    13. Tom Fangyun Tan & Serguei Netessine, 2014. "When Does the Devil Make Work? An Empirical Study of the Impact of Workload on Worker Productivity," Management Science, INFORMS, vol. 60(6), pages 1574-1593, June.
    14. Francis de Véricourt & Otis B. Jennings, 2008. "Dimensioning Large-Scale Membership Services," Operations Research, INFORMS, vol. 56(1), pages 173-187, February.
    15. Merve Bodur & James R. Luedtke, 2017. "Mixed-Integer Rounding Enhanced Benders Decomposition for Multiclass Service-System Staffing and Scheduling with Arrival Rate Uncertainty," Management Science, INFORMS, vol. 63(7), pages 2073-2091, July.
    16. 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.
    17. 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.
    18. J. Michael Harrison & Assaf Zeevi, 2005. "A Method for Staffing Large Call Centers Based on Stochastic Fluid Models," Manufacturing & Service Operations Management, INFORMS, vol. 7(1), pages 20-36, September.
    19. 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.
    20. Sunil Kumar & Ramandeep S. Randhawa, 2010. "Exploiting Market Size in Service Systems," Manufacturing & Service Operations Management, INFORMS, vol. 12(3), pages 511-526, September.

    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:ormnsc:v:58:y:2012:i:7:p:1273-1291. 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.