On a general mixed priority queue with server discretion |
| |
Authors: | Val Andrei Fajardo |
| |
Institution: | Department of Statistics and Actuarial Science, University of Waterloo, Waterloo, Ontario, Canada |
| |
Abstract: | We consider a single-server queueing system which attends to N priority classes that are classified into two distinct types: (i) urgent: classes which have preemptive resume priority over at least one lower priority class, and (ii) non-urgent: classes which only have non-preemptive priority among lower priority classes. While urgent customers have preemptive priority, the ultimate decision on whether to interrupt a current service is based on certain discretionary rules. An accumulating prioritization is also incorporated. The marginal waiting time distributions are obtained and numerical examples comparing the new model to other similar priority queueing systems are provided. |
| |
Keywords: | Accumulating priority Laplace–Stieltjes transform mixed priority queue server discretion rules waiting time distribution |
|
|