A queueing network approach to health care planning with an application to burn care in New York State

doi:10.1016/0038-0121(81)90041-0

Socio-Economic Planning Sciences

Volume 15, Issue 5, 1981, Pages 207-216

https://doi.org/10.1016/0038-0121(81)90041-0 Get rights and content

Abstract

Treatment of severe thermal burns is a medical care problem which has not previously received the support and attention required on both the national and state level. With the advent of the Health Systems Agencies and the Systems Perspective to Health Care Planning, there will be a need for analytical planning and evaluation models which produce results with respect to controlling health care costs.

A descriptive planning model has been developed based on the theory of finite capacity multiserver queues and continuous-time Markov chains, which can be used to describe the operations of a system of burn care facilities linked together by a referral policy to accommodate patient overflow. This model has been combined with a heuristic optimization procedure to answer the relevant questions for burn care in New York State.

References (13)

National Commission on Fire Prevention and Control
America Burning
(1973)
Comprehensive Health Planning Agency of Southern N.J.
Burn Care in Southern N.J.
(1975)
Comprehensive Health Planning Association of Western Pa., Inc.
Guidelines for the Planning and Development of Burn Care in Western Pennsylvania
(1974)
I. Feller et al.
Planning and Designing a Burn Care Facility
(1971)
P. Greenwald
Need for burn-care facilities in New York State
New York State Journal of Medicine
(1972)
Orkand Corporation
Planning Approaches, Criteria, and Standards for Specialized Burn Facilities
(1976)

There are more references available in the full text version of this article.

Cited by (11)

A sequential direct hybrid algorithm to compute stationary distribution of continuous-time Markov chain
2022, Expert Systems with Applications
Citation Excerpt :
Modeling of stochastic systems using continuous-time Markov chains (CTMCs) (Bhattacharya & Waymire, 2009; Norris, 1998) is useful in a wide variety of fields. They are used as analysis tool in queueing theory, which is applied in the fields of telecommunications (László Lakatos et al., 2019), production, healthcare (Blair & Lawrence, 1981), and more. A specific type of CTMCs, the Stochastic Reaction Networks (SRNs) (Wiuf & Xu, 2020; Xu et al., 2019), is extensively used in the field of biochemistry (Anderson & Kurtz, 2011; Cinquemani, 2019; Murphy et al., 2018).
In modeling a wide variety of problems of the real world using Markov processes, we usually get large sparse Markov chains. In the case of non-Markovian process, the behavior of a stochastic phenomenon or system can be approximated by continuous-time Markov chains (CTMC) using Phase-type distributions. However, this substantially increases the number of states, which requires a large amount of computation time and operational memory resources. Even the most recent computer hardware is not enough to provide a solution in almost real time, unless a specific algorithm is designed.
In this paper, a new hybrid algorithm for the computation of a stationary distribution of a large ergodic homogeneous Markov chains with a finite state space and continuous time is suggested. This algorithm would solve the aforementioned challenges. Depending on model size and sparsity, it significantly reduces a computational time when compared with other recent methods, such as the SparseLU solver from Eigen library (version 3.9.9) and the MUMPS solver (MUltifrontal Massively Parallel sparse direct Solver, version 5.4.0). It is important to note that the algorithm works well independently on the structure of the generator matrix of a continuous-time Markov chain. For the study of the developed hybrid algorithm, the generator matrix is constructed randomly using a special algorithm, based on combining two methods: the slightly modified Grassmann, Taskar and Heyman (GTH) algorithm and the Gauss elimination method. The new idea is to remove the majority of states in a near-optimal order by the GTH method and complete computations for the remaining states by the Gauss method. The robust approach to identify a switching position from one algorithm to another one has been proposed and tested.
Surrogate models for performance evaluation of multi-skill multi-layer overflow loss systems
2016, Performance Evaluation
We consider a model of overflow loss systems in which server groups are arranged into layers, and alternate routing within each layer creates mutual overflow effects, increasing the amount of traffic that can be carried by the system. Such a model has wide applications in communications and service systems. However, the presence of both hierarchical inter-layer overflow and mutual intra-layer overflow makes accurate, robust, yet scalable blocking probability evaluation of such systems a difficult challenge. To address this challenge, we apply and extend the recently developed Information Exchange Surrogate Approximation (IESA) framework to a multi-layer system, adding new surrogate models to the framework and incorporating moment-matching techniques. In contrast to the conventional fixed-point approximation (FPA) approach, which directly decomposes the overflow loss system into independent subsystems with inherent problems of convergence and uniqueness, IESA performs decomposition on a carefully designed surrogate model with guaranteed convergence and uniqueness. Extensive numerical results demonstrate that IESA is consistently more accurate than the conventional FPA approach, showing an improvement in accuracy of several orders of magnitude in many cases. Furthermore, the new extensions to IESA introduced in this paper provide consistent improvements in accuracy relative to the current state-of-the-art of the IESA framework.
Application of queueing theory in health care: A literature review
2013, Operations Research for Health Care
This paper reviews the contributions and applications of queueing theory in the field of health care management problems. This review proposes a system of classification of health care areas which are examined with the assistance of queueing models. The categories described in the literature are expanded and a detailed taxonomy for subgroups is formulated. The goal is to provide sufficient information to analysts who are interested in using queueing theory to model a health care process and who want to locate the details of relevant models.
A Century-Long Challenge in Teletraffic Theory: Blocking Probability Evaluation for Overflow Loss Systems with Mutual Overflow
2023, TechRxiv
A Century-Long Challenge in Teletraffic Theory: Blocking Probability Evaluation for Overflow Loss Systems With Mutual Overflow
2023, IEEE Access
Overflow models for the admission of intensive care patients
2018, Health Care Management Science

View all citing articles on Scopus

View full text

A queueing network approach to health care planning with an application to burn care in New York State

Abstract

America Burning

Burn Care in Southern N.J.

Guidelines for the Planning and Development of Burn Care in Western Pennsylvania

Planning and Designing a Burn Care Facility

Need for burn-care facilities in New York State

New York State Journal of Medicine

Planning Approaches, Criteria, and Standards for Specialized Burn Facilities