IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v196y2009i3p996-1007.html
   My bibliography  Save this article

An analytic finite capacity queueing network model capturing the propagation of congestion and blocking

Author

Listed:
  • Osorio, Carolina
  • Bierlaire, Michel

Abstract

Analytic queueing network models often assume infinite capacity queues due to the difficulty of grasping the between-queue correlation. This correlation can help to explain the propagation of congestion. We present an analytic queueing network model which preserves the finite capacity of the queues and uses structural parameters to grasp the between-queue correlation. Unlike pre-existing models it maintains the network topology and the queue capacities exogenous. Additionally, congestion is directly modeled via a novel formulation of the state space of the queues which explicitly captures the blocking phase. The model can therefore describe the sources and effects of congestion. The model is formulated for networks with an arbitrary topology, multiple server queues and blocking-after-service. It is validated by comparison with both pre-existing methods and simulation results. It is then applied to study patient flow in a network of units of the Geneva University Hospital. The model has allowed us to identify three main sources of bed blocking and to quantify their impact upon the different hospital units.

Suggested Citation

  • Osorio, Carolina & Bierlaire, Michel, 2009. "An analytic finite capacity queueing network model capturing the propagation of congestion and blocking," European Journal of Operational Research, Elsevier, vol. 196(3), pages 996-1007, August.
  • Handle: RePEc:eee:ejores:v:196:y:2009:i:3:p:996-1007
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(08)00387-1
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Altiok, Tayfur, 1982. "Approximate analysis of exponential tandem queues with blocking," European Journal of Operational Research, Elsevier, vol. 11(4), pages 390-398, December.
    2. Papadopoulos, H. T. & Heavey, C., 1996. "Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines," European Journal of Operational Research, Elsevier, vol. 92(1), pages 1-27, July.
    3. Laoucine Kerbache & J.Macgregor Smith, 1987. "The generalized expansion method for open finite queueing networks," Post-Print hal-00484457, HAL.
    4. R Korporaal & A Ridder & P Kloprogge & R Dekker, 2000. "An analytic model for capacity planning of prisons in the Netherlands," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 51(11), pages 1228-1237, November.
    5. J B Jun & S H Jacobson & J R Swisher, 1999. "Application of discrete-event simulation in health care clinics: A survey," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 50(2), pages 109-123, February.
    6. Ger Koole & Avishai Mandelbaum, 2002. "Queueing Models of Call Centers: An Introduction," Annals of Operations Research, Springer, vol. 113(1), pages 41-59, July.
    7. Kerbachea, Laoucine & MacGregor Smith, J., 1987. "The generalized expansion method for open finite queueing networks," European Journal of Operational Research, Elsevier, vol. 32(3), pages 448-461, December.
    8. Laoucine Kerbache & J. Macgregor Smith, 1988. "Asymptotic behavior of the expansion method for open finite queueing networks," Post-Print hal-00484446, HAL.
    9. James R. Jackson, 1963. "Jobshop-Like Queueing Systems," Management Science, INFORMS, vol. 10(1), pages 131-142, October.
    10. James R. Jackson, 1957. "Networks of Waiting Lines," Operations Research, INFORMS, vol. 5(4), pages 518-521, August.
    11. Alexandre Brandwajn & Yung-Li Lily Jow, 1988. "An Approximation Method for Tandem Queues with Blocking," Operations Research, INFORMS, vol. 36(1), pages 73-83, February.
    12. Kerbache, Laoucine & Smith, J. MacGregor, 2000. "Multi-objective routing within large scale facilities using open finite queueing networks," European Journal of Operational Research, Elsevier, vol. 121(1), pages 105-123, February.
    13. H.S. Lee & A. Bouhchouch & Y. Dallery & Y. Frein, 1998. "Performance evaluation of open queueing networks with arbitrary configuration and finite buffers," Annals of Operations Research, Springer, vol. 79(0), pages 181-206, January.
    14. Schmidt, Linda C. & Jackman, John, 2000. "Modeling recirculating conveyors with blocking," European Journal of Operational Research, Elsevier, vol. 124(2), pages 422-436, July.
    15. Surendra Gupta & Ayse Kavusturucu, 2000. "Production systems with interruptions, arbitrary topology and finite buffers," Annals of Operations Research, Springer, vol. 93(1), pages 145-176, January.
    16. Jun, Kyung P. & Perros, Harry G., 1990. "An approximate analysis of open tandem queueing networks with blocking and general service times," European Journal of Operational Research, Elsevier, vol. 46(1), pages 123-135, May.
    17. Laoucine Kerbache & J. Macgregor Smith, 2000. "Multi-objective routing within large scale facilities using open finite queueing networks," Post-Print hal-00798811, HAL.
    18. John C. Hershey & Elliott N. Weiss & Morris A. Cohen, 1981. "A Stochastic Service Network Model with Application to Hospital Facilities," Operations Research, INFORMS, vol. 29(1), pages 1-22, February.
    19. Tayfur Altiok, 1989. "Approximate Analysis of Queues in Series with Phase-Type Service Times and Blocking," Operations Research, INFORMS, vol. 37(4), pages 601-610, August.
    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. Osorio, Carolina & Wang, Carter, 2017. "On the analytical approximation of joint aggregate queue-length distributions for traffic networks: A stationary finite capacity Markovian network approach," Transportation Research Part B: Methodological, Elsevier, vol. 95(C), pages 305-339.
    2. Papadopoulos, H. T. & Heavey, C., 1996. "Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines," European Journal of Operational Research, Elsevier, vol. 92(1), pages 1-27, July.
    3. Haskose, A. & Kingsman, B. G. & Worthington, D., 2002. "Modelling flow and jobbing shops as a queueing network for workload control," International Journal of Production Economics, Elsevier, vol. 78(3), pages 271-285, August.
    4. Osorio, Carolina & Bierlaire, Michel, 2012. "A tractable analytical model for large-scale congested protein synthesis networks," European Journal of Operational Research, Elsevier, vol. 219(3), pages 588-597.
    5. Jean-Sébastien Tancrez, 2020. "A decomposition method for assembly/disassembly systems with blocking and general distributions," Flexible Services and Manufacturing Journal, Springer, vol. 32(2), pages 272-296, June.
    6. Korporaal, R. & Ridder, A.A.N. & Kloprogge, P. & Dekker, R., 1999. "Capacity planning of prisons in the Netherlands," Econometric Institute Research Papers EI 9909-/A, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    7. Wu, Kan & McGinnis, Leon, 2012. "Performance evaluation for general queueing networks in manufacturing systems: Characterizing the trade-off between queue time and utilization," European Journal of Operational Research, Elsevier, vol. 221(2), pages 328-339.
    8. Hui-Yu Zhang & Qing-Xin Chen & James MacGregor Smith & Ning Mao & Ai-Lin Yu & Zhan-Tao Li, 2017. "Performance analysis of open general queuing networks with blocking and feedback," International Journal of Production Research, Taylor & Francis Journals, vol. 55(19), pages 5760-5781, October.
    9. Morabito, Reinaldo & de Souza, Mauricio C. & Vazquez, Mariana, 2014. "Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks," European Journal of Operational Research, Elsevier, vol. 232(3), pages 618-629.
    10. Stepanov, Alexander & Smith, James MacGregor, 2009. "Multi-objective evacuation routing in transportation networks," European Journal of Operational Research, Elsevier, vol. 198(2), pages 435-446, October.
    11. H. S. R. Martins & F. R. B. Cruz & A. R. Duarte & F. L. P. Oliveira, 2019. "Modeling and optimization of buffers and servers in finite queueing networks," OPSEARCH, Springer;Operational Research Society of India, vol. 56(1), pages 123-150, March.
    12. Sumi Kim & Seongmoon Kim, 2015. "Differentiated waiting time management according to patient class in an emergency care center using an open Jackson network integrated with pooling and prioritizing," Annals of Operations Research, Springer, vol. 230(1), pages 35-55, July.
    13. Saied Samiedaluie & Vedat Verter, 2019. "The impact of specialization of hospitals on patient access to care; a queuing analysis with an application to a neurological hospital," Health Care Management Science, Springer, vol. 22(4), pages 709-726, December.
    14. Remco Bierbooms & Ivo Adan & Marcel Vuuren, 2013. "Approximate analysis of single-server tandem queues with finite buffers," Annals of Operations Research, Springer, vol. 209(1), pages 67-84, October.
    15. Cruz, F.R.B. & Van Woensel, T. & Smith, J. MacGregor, 2010. "Buffer and throughput trade-offs in M/G/1/K queueing networks: A bi-criteria approach," International Journal of Production Economics, Elsevier, vol. 125(2), pages 224-234, June.
    16. Veneklaas, W. & Leeftink, A.G. & van Boekel, P.H.C.M. & Hans, E.W., 2021. "On the design, implementation, and feasibility of hospital admission services: The admission lounge case," Omega, Elsevier, vol. 100(C).
    17. Jean-Sébastien Tancrez & Philippe Chevalier & Pierre Semal, 2011. "Probability masses fitting in the analysis of manufacturing flow lines," Annals of Operations Research, Springer, vol. 182(1), pages 163-191, January.
    18. Kozlowski, Dawid & Worthington, Dave, 2015. "Use of queue modelling in the analysis of elective patient treatment governed by a maximum waiting time policy," European Journal of Operational Research, Elsevier, vol. 244(1), pages 331-338.
    19. Asaduzzaman, Md & Chaussalet, Thierry J., 2014. "Capacity planning of a perinatal network with generalised loss network model with overflow," European Journal of Operational Research, Elsevier, vol. 232(1), pages 178-185.
    20. Azaron, Amir & Katagiri, Hideki & Kato, Kosuke & Sakawa, Masatoshi, 2006. "Modelling complex assemblies as a queueing network for lead time control," European Journal of Operational Research, Elsevier, vol. 174(1), pages 150-168, October.

    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:eee:ejores:v:196:y:2009:i:3:p:996-1007. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.