Start-up class models in multiple-class queues with \(N\)-policy
The authors consider multiple-class queueing systems with \(N\)-policy in which the idle server starts service as soon as the number of customers in the ``start-up class'' reaches threshold \(N\). The consider the cases of FCFS and nonpreemptive priority. The obtain the Laplace-Stieltjes transform of the waiting times of each class of customers. The authors also show some results for the general behavior of such systems.
scientific article; zbMATH DE number 1310872