Abstract
We derive the waiting time distribution of the lowest class in an accumulating priority (AP) queue with positive Lévy input. The priority of an infinitesimal customer (particle) is a function of their class and waiting time in the system, and the particles with the highest AP are the next to be processed. To this end we introduce a new method that relies on the construction of a workload overtaking process and solving a first-passage problem using an appropriate stopping time.
Original language | English |
---|---|
Pages (from-to) | 40-45 |
Number of pages | 6 |
Journal | Operations Research Letters |
Volume | 45 |
Issue number | 1 |
DOIs | |
State | Published - 1 Jan 2017 |
Bibliographical note
Publisher Copyright:© 2016 Elsevier B.V.
Keywords
- Accumulating priority
- First passage time
- Lévy driven queues
- Lévy processes
- Priority queues