Who should be given priority in a queue?

Refael Hassin; Moshe Haviv

doi:10.1016/j.orl.2005.04.007

Who should be given priority in a queue?

Refael Hassin
, Moshe Haviv^*

^*Corresponding author for this work

Department of Statistics

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

21 Scopus citations

Abstract

We consider a memoryless single server queue with two classes of customers, each having its fixed entry fee. We show that profit and social welfare may benefit from a service discipline based on relative priorities.

Original language	English
Pages (from-to)	191-198
Number of pages	8
Journal	Operations Research Letters
Volume	34
Issue number	2
DOIs	https://doi.org/10.1016/j.orl.2005.04.007
State	Published - Mar 2006

Keywords

Discriminatory processor sharing (DPS)
Equilibrium behavior
Relative priorities
Single server queues

Access to Document

10.1016/j.orl.2005.04.007

Cite this

@article{0c6ee02d3ac94c71ba4660cb29cc6713,

title = "Who should be given priority in a queue?",

abstract = "We consider a memoryless single server queue with two classes of customers, each having its fixed entry fee. We show that profit and social welfare may benefit from a service discipline based on relative priorities.",

keywords = "Discriminatory processor sharing (DPS), Equilibrium behavior, Relative priorities, Single server queues",

author = "Refael Hassin and Moshe Haviv",

year = "2006",

month = mar,

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

language = "אנגלית",

volume = "34",

pages = "191--198",

journal = "Operations Research Letters",

issn = "0167-6377",