Approximating nonstationary ph(t)⧸ph(t)⧸1⧸c queueing systems

Kim L. Ong and Michael R. Taaffe

Mathematics and Computers in Simulation (MATCOM), 1988, vol. 30, issue 5, 441-452

Abstract: A state space partitioning and surrogate distribution approximation (SDA) approach for analyzing the time-dependent behavior of queueing systems is described for finite-capacity, single server queueing systems with time-dependent phase arrival and service processes. Regardless of the system capacity, c, the approximation requires the numerical solution of only k1 + 3k1k2 differential equations, where k1 is the number of phases in the arrival process and k2 is the number of phases in the service process, compared to the k1 + ck1k2 Kolmogorov-forward equations required for the classic method of solution. Time-dependent approximations of mean and standard deviation of the number of entities in the system are obtained. Empirical test results over a wide range of systems indicate that the approximation is extremely accurate.

Date: 1988
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0378475488900572
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:30:y:1988:i:5:p:441-452

DOI: 10.1016/0378-4754(88)90057-2

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().