Approximating nonstationary two-priority non-preemptive queueing systems

An approximation for analyzing transient and nonstationary two-priority non-preemptive queueing systems is presented. This system has a three-dimensional state space, and through use of state-space partitioning in conjunction with use of conditional surrogate distributions with constant parameters an approximation is designed. Regardless of system capacity K, the approximation requires the numerical solution of only ten differential equations, compared to the K²+K+1 Kolmogorov-forward equations required for the classic solution. Time-dependent approximation of the mean number of entities of type i and of the probability of a type-i entity being in service are obtained. Empirical test results over a wide range of systems indicate the approximation is quite accurate.