Abstract
In hospitals, patients can be rejected at both the operating theater (OT) and the intensive care unit (ICU) due to limited ICU capacity. The corresponding ICU rejection probability is an important service factor for hospitals. Rejection of an ICU request may lead to health deterioration for patients, and for hospitals to costly actions and a loss of precious capacity when an operation is canceled.
There is no simple expression available for this ICU rejection probability that takes the interaction with the OT into account. With c the ICU capacity (number of ICU beds), this paper proves and numerically illustrates a lower bound by an M|G|c|c system and an upper bound by an M|G|c-1|c-1 system, hence by simple Erlang loss expressions.
The result is based on a product form modification for a special OT–ICU tandem formulation and proved by a technically complicated Markov reward comparison approach. The upper bound result is of particular practical interest for dimensioning an ICU to secure a prespecified service quality. The numerical results include a case study.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Adan, I.J.B.F., Van der Wal, J.: Monotonicity of the throughput of a closed queueing network in the number of jobs. Oper. Res. 37, 935–957 (1989)
Baskett, F., Chandy, M., Muntz, R., Palacios, J.: Open, closed and mixed networks of queues with different classes of customers. J. ACM 22, 248–260 (1975)
Chandy, K.M., Martin, A.J.: A characterization of product-form queueing networks. J. ACM 30(2), 286–299 (1983)
Chandy, K.M., Howard, J.H., Towsley, D.F.: Product form and local balance in queueing networks. J. ACM 24, 250–263 (1977)
Costa, A.X., Ridley, S.A., Shahani, A.K., Harper, P.R., De Senna, V., Nielsen, M.S.: Mathematical modelling and simulation for planning critical care capacity. Anaesthesia 58, 320–327 (2003)
Faddy, M.J., McClean, S.I.: Analyzing data on lengths of stay of hospital patients using phase-type distributions. Stoch. Models Bus. Ind. 15, 311–317 (1999)
Foschini, G.J., Gopinath, B.: Sharing memory optimally. IEEE Trans. Commun. 31, 352–359 (1983)
Griffiths, J.D., Price-Lloyd, N., Smithies, M., Williams, J.: A queueing model of activities in an intensive care unit. IMA J. Manag. Math. 17, 277–288 (2006)
Hautvast, J.L.A., Bakker, J., Boekema-Bakker, N., Faber, J.A.J., Grobbee, D.E., Schrijvers, A.J.P.: Plaats in de herberg, een studie naar determinanten van opname- en ontslagproblemen in IC-afdelingen in Nederland. Julius Centrum voor Huisartsgeneeskunde en Patientgebonden Onderzoek, Utrecht (in Dutch) (2001)
Hordijk, A., Van Dijk, N.M.: Networks of queues with blocking. In: Kylstra, F.J. (ed.) Performance, vol. 81, pp. 51–65. North-Holland, Amsterdam (1981)
Hordijk, A., Van Dijk, N.M.: Networks of queues, Part I: Job-local-balance and the adjoint process. Part II: General routing and service characteristics. In: Lecture Notes in Control and Information Sciences, vol. 60, pp. 158–205. Springer, Berlin (1983)
Keilson, J., Kester, A.: Monotone matrices and monotone Markov processes. Stoch. Process. Appl. 5, 231–245 (1977)
Kelly, F.P.: Reversibility and Stochastic Networks. Wiley, New York (1979)
Kim, S.C., Horowitz, I., Young, K.K., Buckley, T.A.: Analysis of capacity management of the intensive care unit in a hospital. Eur. J. Oper. Res. 115, 36–46 (1999)
Kim, S.C., Horowitz, I., Young, K.K., Buckley, T.A.: Flexible bed allocation and performance in the intensive care unit. J. Oper. Manag. 18, 427–443 (2000)
Lam, S.S.: Queueing networks with population size constraints. IBM J. Res. Dev. 370–378 (1977)
Litvak, N., Rijsbergen, M., Boucherie, R.J., Houdenhoven, M.: Managing the overflow of intensive care patients. Eur. J. Oper. Res. 14, 998–1010 (2008)
Massey, W.A.: Stochastic orderings for Markov processes on partially ordered spaces. Math. Oper. Res. 12, 350–367 (1987)
McManus, M.L., Long, M.C., Copper, A., Litvak, E.: Queuing theory accurately models the need for critical care. Anesthesiology 100, 1271–1276 (2004)
Pham, D.N., Klinkert, A.: Surgical case scheduling as a generalized job shop scheduling problem. Eur. J. Oper. Res. 185, 1011–1025 (2008)
Pittel, B.: Closed exponential networks of queues with saturation. The Jackson-type stationary distribution and its asymptotic analysis. Math. Oper. Res. 4, 357–378 (1979)
Puterman, M.L.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley, New York (2005)
Ridge, J.C., Jones, S.K., Nielsen, M.S., Shahani, A.K.: Capacity planning for intensive care units. Eur. J. Oper. Res. 105, 346–355 (1998)
Scheffer, G.J. e.a.: Richtlijn: Organisatie en werkwijze op intensive care-afdelingen voor volwassenen in Nederland, Van Zuiden (In Dutch) (2006)
Shanthikumar, J.G., Yao, D.D.: The effect of increasing service rates in closed queueing network. J. Appl. Probab. 23, 474–483 (1987)
Shanthikumar, J.G., Yao, D.D.: Stochastic monotonicity of the queue lengths in closed queueing networks. Oper. Res. 35, 583–588 (1987)
Sonderman, D.: Comparing multi-server queues with finite waiting rooms, II: Different number of servers. Adv. Appl. Probab. 11, 448–455 (1979)
Stoyan, D.: Bounds and approximations in queueing through monotonicity and continuity. Oper. Res. 25, 851–863 (1977)
Stoyan, D.: Comparison Methods for Queues and Other Stochastic Models. Wiley, New York (1983)
Szekli, R.: Stochastic Ordering and Dependence in Applied Probability. Lecture Notes in Statist., vol. 97. Springer, New York (1995)
Tijms, H.C.: Stochastic Models: An Algorithmic Approach. Wiley, New York (1994)
Van Dijk, N.M.: A formal proof for the insensitivity of simple bounds for multi-server non-exponential tandem queues based on monotonicity results. Stoch. Process. Appl. 27, 261–277 (1988)
Van Dijk, N.M.: Stop = Repeat for non-exponential stochastic networks with blocking. J. Appl. Probab. 28, 159–173 (1991)
Van Dijk, N.M.: Queueing Networks and Product Forms: A Systems Approach. Wiley, Chichester (1993)
Van Dijk, N.M.: Bounds and error bounds for queueing networks. Ann. Oper. Res. 79, 295–319 (1998)
Van Dijk, N.M.: Error bounds and comparison results: the Markov reward approach for queueing networks. Research Report, Department of Economics and Business, University of Amsterdam (2008)
Van Dijk, N.M., Kortbeek, N.: Approximation and bounds for the ICU-rejection probability in OT–ICU tandem systems. Research Report, Department of Economics and Business, University of Amsterdam (2007)
Van Dijk, N.M., Lamond, B.F.: Bounds for the call congestion of finite single-server exponential tandem queues. Oper. Res. 36, 470–477 (1988)
Van Dijk, N.M., Taylor, P.G.: Strong stochastic bounds for the stationary distribution of a class of multicomponent performability models. Oper. Res. 46, 665–674 (1998)
Van Dijk, N.M., Van der Wal, J.: Simple bounds and monotonicity results for finite multi-server exponential tandem queues. Queueing Syst. 4, 1–16 (1989)
Van Dijk, N.M., Tsoucas, P., Walrand, J.: Simple bounds and monotonicity of the call congestion of infinite multiserver delay systems. Probab. Eng. Inf. Sci. 2, 129–138 (1988)
Vohra, S., Dutta, G., Gush, D.K.: Capacity management of Intensive Care Units in a multi-specialty hospital in India. IIMA Working Papers, available at http://ideas.repec.org/p/iim/iimawp/2006-07-04.html (2006)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
van Dijk, N.M., Kortbeek, N. Erlang loss bounds for OT–ICU systems. Queueing Syst 63, 253 (2009). https://doi.org/10.1007/s11134-009-9149-2
Received:
Revised:
Published:
DOI: https://doi.org/10.1007/s11134-009-9149-2
- Tandem queues
- Markov reward approach
- Health services
- Capacity planning
- Intensive care units
- Operating rooms