IRUS Total

Approximate Queueing Network Analysis of Patient Treatment Times

File Description SizeFormat 
agfa-valuetools.pdfAccepted version213.34 kBAdobe PDFView/Open
Title: Approximate Queueing Network Analysis of Patient Treatment Times
Authors: Au-Yeung, S
Knottenbelt, W
Harrison, P
Item 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 hospitals 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. Copyright 2007 ICST.
Issue Date: 1-Jan-2007
URI: http://hdl.handle.net/10044/1/5886
Publisher Link: http://eudl.eu/article.php?id=1775
ISBN: 978-963-9799-00-4
Publisher: ICST
Presented At: 2nd International Conference on Performance Evaluation Methodologies and Tools
Published Proceedings: Value Tools : Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
Start Page: 1
End Page: 12
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}
Conference Location: Nantes, France
Appears in Collections:Computing
High Performance Informatics