Abstract
We show that relative priorities can reduce queueing costs in systems that are multi-server and multi-class as long as customers choose their routing policy strategically. This is demonstrated in two models with multi-class Poisson arrivals and parallel memoryless servers with linear cost functions of class mean waiting times. For each model we investigate the Nash equilibria under a given relative priority rule. The central planner's optimal policy is characterized and shown to be of strictly relative priorities in some cases.
Original language | American English |
---|---|
Pages (from-to) | 498-502 |
Number of pages | 5 |
Journal | Operations Research Letters |
Volume | 45 |
Issue number | 5 |
DOIs | |
State | Published - Sep 2017 |
Externally published | Yes |
Bibliographical note
Funding Information:The majority of this work was done while the first author was a Ph.D. student in the Department of Statistics and the Federmann Center for the Study of Rationality, the Hebrew University of Jerusalem. Research was partially funded by the Programme of Canadian Studies , Co-sponsored by the Government of Canada and Ralph and Roz Halbert of Toronto.
Funding Information:
The majority of this work was done while the first author was a Ph.D. student in the Department of Statistics and the Federmann Center for the Study of Rationality, the Hebrew University of Jerusalem. Research was partially funded by the Programme of Canadian Studies, Co-sponsored by the Government of Canada and Ralph and Roz Halbert of Toronto.
Publisher Copyright:
© 2017 Elsevier B.V.
Keywords
- Queueing network
- Relative priorities
- Selfish routing