Waiting times in a queueing system with capacity constraints and preemptive priorities
We investigate a queueing system with K classes of units arriving in independent Poisson streams and being served under the preemptive resume discipline. Units belonging to the same class require service times subject to a general distribution and their number in the system is limited. The following results refer to the queueing processes in an arbitrary class. We consider the joint probabilities for the number of waiting units and the residual processing time in equilibrium and we derive the L.-S. transform of their generating function. The main result of the paper is the L.-S. transform of the stationary waiting time distribution for a unit admitted to the system.
scientific article; zbMATH DE number 4001161