Single Server Markovian Non Preemptive Priority Queue with Restricted Admissibility
Abstract
In this paper, we consider a single server Markovian queue with two classes of customers, Class I (priority) and Class II (non-priority) customers. The number of arrivals and the number of service completions follows Poisson processes with rates and respectively. In addition, it is assumed that all class I(class II) arrivals are allowed to enter into the system, there is a restriction at the entering point. Also class I customers has non-preemptive priority over class II customers. This model has been completely analyzed in steady state, by obtaining the probability distribution for the number of customers in the system and some related system performance measures. Besides, we provide some numerical illustrations to make the theoretical consequences.