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 journalArticlepeer-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 languageAmerican English
Pages (from-to)498-502
Number of pages5
JournalOperations Research Letters
Volume45
Issue number5
DOIs
StatePublished - Sep 2017
Externally publishedYes

Bibliographical note

Publisher Copyright:
© 2017 Elsevier B.V.

Keywords

  • Queueing network
  • Relative priorities
  • Selfish routing

Fingerprint

Dive into the research topics of 'The advantage of relative priority regimes in multi-class multi-server queueing systems with strategic customers'. Together they form a unique fingerprint.

Cite this