Approximate Queueing Network Analysis of Patient Treatment Times
File(s)agfa-valuetools.pdf (213.34 KB)
Accepted version
Author(s)
Au-Yeung, S
Knottenbelt, W
Harrison, P
Type
Conference Paper
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.
Date Issued
2007-10
Citation
Value Tools : Proceedings of the 2nd international conference on Performance evaluation methodologies and tools, 2007, 321 (Article No. 45), pp.1-12
ISBN
978-963-9799-00-4
Publisher
ICST
Source Title
2nd International Conference on Performance Evaluation Methodologies and Tools
Conference
Value Tools : Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
Start Page
1
End Page
12
Journal / Book Title
Value Tools : Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
Volume
321
Issue
Article No. 45
Copyright Statement
© 2007 ICST. This is the author's version of the work. It is posted here by permission of ICST for your personal use. Not for redistribution. The definitive version was published in VALUE TOOLS {VOL:321, ARTICLE NO. 45, 2007}
Source
2nd International Conference on Performance Evaluation Methodologies and Tools
Source Place
Nantes, France
Start Date
2007-10-23
Finish Date
2007-10-25
Coverage Spatial
Nantes, France