A NONPREEMPTIVE PRIORITY MAP/G/1 QUEUE WITH TWO CLASSES OF CUSTOMERS

Tetsuya Takine
1996 Journal of the Operations Research Society of Japan  
This paper eonsiders a nunpreemptive priority queue with two ciasses of customers, Customers m each priority c]ass arrive to the system according to a Markovian arrival process (MAP ). Since the MA.P is weakly dense in the class of stationary point processes, it is a fairly general arrival process. The service times of customers in each priority class are independent and identically distributed according to a general distribution function which may difur among two priority classes. Using both
more » ... asses. Using both the generating function technique and the matrix analytic method, we derive va::ious formulas for the queue length and waiting time distributions. We also discuss the algorithmic iniplementation of the analytical results a}ong with numerical examples.
doi:10.15807/jorsj.39.266 fatcat:fwkeefr3undgbftqsgc3r75rl4