Procedures for determining the efficiency of tandem queueing systems when operational times are variable
Methods of determining the operational parameters for finite storage tandem queue systems with Erlang service times were investigated. The effect on system utilization and the expected number of units residing in a system operating at steady-state as a function of (1) number of stations, (2) Erlang shape parameters, and (3) storage capacity was investigated.
The notation (N, K, S) is used to denote an N station finite storage tandem queue system in which each station experiences service times following the Erlang distribution with shape parameters K and allowing for a maximum of S units of storage between each of the adjacent stations.
A generator to count and provide a specified ordering of states for (N, 1, S) systems was developed. A solution method based on a partition of the transition intensity matrix was developed and is illustrated in detail for balanced (3, 1, S) systems. Computational efficiencies were realized which reduced computing time to one-third and storage requirements to one-sixth of those previously reported in the literature.
A method of solving for system utilization for two-station systems was developed for (2, 2, S) unbalanced systems. The work of Knott was extended by providing explicit functions for generating the steady-state probability vectors for (2, K, 0) systems.
A function which generates exact system utilization for the (2, K, 0) systems for K=l, 2, ..., 21 (all cases investigated) is given. Exact rational numbers are given for the operational statistics of other two-, three-, and four-station systems. These values in many cases have been previously available only as decimal approximations. For some systems, the solution values include nineteen significant digits.
Thesis74b.H398.pdf
4.29 MB
Adobe PDF
c885815e12bec53af128b570a6945696