AESOP home


Approximate Queueing Network Analysis of Patient Treatment Times

Susanna Wau Men Au-Yeung, Peter G. Harrison, William J. Knottenbelt

Conference or Workshop Paper
2nd International Conference on Performance Evaluation Methodologies and Tools
September, 2007

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.

PDF of full publication (213.3 kilobytes)
(need help viewing PDF files?)

Information from