This is a preview. Log in through your library . Abstract We consider a nonpreemptive priority queue with a finite number of priority classes, Poisson arrival processes, and general service time ...
This paper considers the nonpreemptive priority queue with MAP (Markovian Arrival Process) arrivals. Since MAP is weakly dense in the class of stationary point processes, it is a fairly general ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback