Approximate Queueing Network Analysis of Patient Treatment Times

S.W.M Au-Yeung; P.G Harrison; W.J Knottenbelt

2nd International ICST Conference on Performance Evaluation Methodologies and Tools

Research Article

Approximate Queueing Network Analysis of Patient Treatment Times

Download338 downloads

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.4108/valuetools.2007.1775,
    author={S.W.M Au-Yeung and P.G Harrison and W.J Knottenbelt},
    title={Approximate Queueing Network Analysis of Patient Treatment Times},
    proceedings={2nd International ICST Conference on Performance Evaluation Methodologies and Tools},
    proceedings_a={VALUETOOLS},
    year={2010},
    month={5},
    keywords={Queueing Theory Analytical Models and Approximation Methods},
    doi={10.4108/valuetools.2007.1775}
}

S.W.M Au-Yeung
P.G Harrison
W.J Knottenbelt
Year: 2010
Approximate Queueing Network Analysis of Patient Treatment Times
VALUETOOLS
ICST
DOI: 10.4108/valuetools.2007.1775

S.W.M Au-Yeung¹, P.G Harrison¹, W.J Knottenbelt¹

1: Department of Computing, Imperial College London, SW7 2AZ, UK

Abstract

We develop an approximate generating function analysis (AGFA) technique which approximates the Laplace transform of the probability density function of customer response time in networks of queues with class-based priorities. From the approximated Laplace transform, we derive the first two moments of customer response time. This technique is applied to a model of a large hospital's Accident and Emergency department for which we obtain the mean and standard deviation of total patient service time. We experiment with different patient-handling priority schemes and compare the AGFA moments with the results from a discrete event simulation.

Keywords: Queueing Theory Analytical Models and Approximation Methods

Published: 2010-05-16
Modified: 2011-09-14

: http://dx.doi.org/10.4108/valuetools.2007.1775