Approximating nonstationary Ph(t)/M(t)/s/c queueing systems

Approximating nonstationary Ph(t)/M(t)/s/c queueing systems

0.00 Avg rating0 Votes
Article ID: iaor1988323
Country: Switzerland
Volume: 8
Start Page Number: 103
End Page Number: 116
Publication Date: Nov 1987
Journal: Annals of Operations Research
Authors: ,
Keywords: service
Abstract:

Nonstationary phase processes are defined and a surrogate distribution approximation (SDA) method for analyzing transient and nonstationary queueing systems with nonstationary phase arrival processes is presented. Regardless of system capacity c, the SDA method requires the numerical solution of only 6K differential equations, where K is the number of phases in the arrival process, compared to the K(c+1) Kolmogorov forward equations required for the classical method of solution. Time-dependent approximations of mean and variance of the number of entities in the system and the number of busy servers are obtained. Empirical test results over a wide range of systems indicate the SDA is quite accurate.

Reviews

Required fields are marked *. Your email address will not be published.