A Dynamic Non-preemptive Priority Queueing Model with Two Types of Customers
In this paper, we study a single-server non-preemptive priority queueing model with two types of customers. The customers arrive according to two independent Poisson processes, and the service times are exponential with possibly different parameters. While Type 1 customers, who have non-preemptive priority over Type 2 customers, have a finite waiting room, Type 2 customers have no such restriction. A new dynamic rule based on a predetermined threshold is applied in offering services to lower-priority customers (when higher-priority customers are present) whenever the server becomes free. Using matrix-analytic methods, we analyze the model in steady state and bring out some qualitative and interesting aspects of the model under study. We also compare our model to the classical two-customer non-preemptive priority model to show a marked improvement in the quality of service to customers under the proposed threshold model.
KeywordsQueueing Dynamic non-preemptive priority Matrix-analytic method Algorithmic probability
- 5.Drekic, S., Stanford, D.A.: Threshold-based interventions to optimize performance in preemptive priority queues. Queueing Syst.35, 289–315 (2000)Google Scholar
- 7.Jaiswal, N.K.: Priority queues. Acadameic Press, USA (1968)Google Scholar
- 9.Latouche, G., Ramaswami, V.: Introduction to Matrix Analytic Methods in Stochastic Modeling. SIAM (1999)Google Scholar
- 10.Neuts, M.F.: Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach. The Johns Hopkins University Press, Baltimore, MD. [1994 version is Dover Edition] (1981)Google Scholar
- 14.Takagi, H.: Analysis of Polling Systems. MIT, USA (1986)Google Scholar