Analysis of a finite capacity non preemptive priority queue

Abstract

In this paper a finite capacity priority queue with multiple servers and non preemptive service discipline is analysed. The arrival and service processes were assumed Markovian and only two priority classes were considered. An analytical solution for blocking probabilities for the customers in the two classes is obtained under the assumption that a high priority customer upon arrival can displace a low priority customer from the waiting line if the queue is full.