The advantage of relative priority regimes in multi-class multi-server queueing systems with strategic customers

Binyamin Oz; Moshe Haviv; Martin L. Puterman

doi:10.1016/j.orl.2017.07.005

The advantage of relative priority regimes in multi-class multi-server queueing systems with strategic customers

Binyamin Oz^*, Moshe Haviv, Martin L. Puterman

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

3 Scopus citations

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	https://doi.org/10.1016/j.orl.2017.07.005
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

Access to Document

10.1016/j.orl.2017.07.005

Cite this

@article{e6e980fc5c214905a585a549d8144cef,

title = "The advantage of relative priority regimes in multi-class multi-server queueing systems with strategic customers",

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.",

keywords = "Queueing network, Relative priorities, Selfish routing",

author = "Binyamin Oz and Moshe Haviv and Puterman, {Martin L.}",

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: {\textcopyright} 2017 Elsevier B.V.",

year = "2017",

month = sep,

doi = "10.1016/j.orl.2017.07.005",

language = "American English",

volume = "45",

pages = "498--502",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier",

number = "5",

}

TY - JOUR

T1 - The advantage of relative priority regimes in multi-class multi-server queueing systems with strategic customers

AU - Oz, Binyamin

AU - Haviv, Moshe

AU - Puterman, Martin L.

N1 - 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.

PY - 2017/9

Y1 - 2017/9

N2 - 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.

AB - 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.

KW - Queueing network

KW - Relative priorities

KW - Selfish routing

UR - http://www.scopus.com/inward/record.url?scp=85027833608&partnerID=8YFLogxK

U2 - 10.1016/j.orl.2017.07.005

DO - 10.1016/j.orl.2017.07.005

M3 - Article

AN - SCOPUS:85027833608

SN - 0167-6377

VL - 45

SP - 498

EP - 502

JO - Operations Research Letters

JF - Operations Research Letters

IS - 5

ER -

The advantage of relative priority regimes in multi-class multi-server queueing systems with strategic customers

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this