Abstract
This paper determines the mean waiting times for a single server multi-class queueing model with Poisson arrivals and relative priorities. If the server becomes idle, the probability that the next job is from class-i is proportional to the product between the number of class-i jobs present and their priority parameter.
Original language | English |
---|---|
Pages (from-to) | 591-594 |
Number of pages | 4 |
Journal | Operations Research Letters |
Volume | 35 |
Issue number | 5 |
DOIs | |
State | Published - Sep 2007 |
Keywords
- M | G | 1 queues
- Non-preemptive relative priorities