Name
Abstract | ||
|---|---|---|
We consider a multi-server queue with K priority classes. In this system, customers of the P highest priorities (PK) can preempt customers with lower priorities, ejecting them from service and sending them back into the queue. Service times are assumed exponential with the same mean for all classes.The Laplace---Stieltjes transforms of waiting times are calculated explicitly and the Laplace---Stieltjes transforms of sojourn times are provided in an implicit form via a system of functional equations. In both cases, moments of any order can be easily calculated. Specifically, we provide formulae for the steady state means and the second moments of waiting times for all priority classes. We also study some approximations of sojourn-time distributions via their moments. In a practical part of our paper, we discuss the use of mixed priorities for different types of Service Level Agreements, including an example based on a real scheduling problem of IT support teams. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/s11134-009-9110-4 | Queueing Systems |
Keywords | Field | DocType |
functional equation,k priority class,sojourn time,priority class,multi-server queue,p highest priority,queues · priority queues · workforce management · it support systems · contact centers,service level agreements,lower priority,mixed priority,different type,service time,steady state,priority queues,laplace stieltjes transform,queues,priority queue,scheduling problem,type of service | Mathematical optimization,Exponential function,Job shop scheduling,Type of service,Computer science,Queue,Approximations of π,Real-time computing,Priority queue,Workforce management,Functional equation | Journal |
Volume | Issue | ISSN |
61 | 4 | 0257-0130 |
Citations | PageRank | References |
5 | 0.46 | 17 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sergey Zeltyn | 1 | 174 | 15.09 |
| Zohar Feldman | 2 | 197 | 11.85 |
| Segev Wasserkrug | 3 | 140 | 12.25 |