A Finite Capacity Dynamic Priority Queueing Model
Computers and Industrial Engineering
A single server queueing model with two types of arrivals is discussed under the assumptions of Poisson arrivals, (possibly different) general services and finite waiting room for each type of customer. Under a dynamic non-preemptive priority service rule, the steady state analysis of the model is performed. A number of interesting and intuitive results are obtained. In the case when the services are of phase type, implementable algorithms are developed for computing various system performance measures. The recursive computational schemes can be used interactively in the design of such queuing systems. A number of numerical examples are discussed.
© 1992 Published by Elsevier Ltd.
Chakravarthy, Srinivas R., "A Finite Capacity Dynamic Priority Queueing Model" (1992). Industrial & Manufacturing Engineering Publications. 87.
This research was partially supported by GMI Research Initiation/Improvement Grant.