Stable priority purchasing in queues

Amihai Glazer; Refael Hassin

doi:10.1016/0167-6377(86)90030-1

Stable priority purchasing in queues

Amihai Glazer, Refael Hassin

School of Mathematical Sciences

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

Abstract

We consider an M G1 queueing system where each customer can purchase the priority with which he will be served. Customers may differ in their time valuation. They know the statistical distrubution of the queue length and amounts paid by others, but not their actual values. We determine the payment policy from which no customer will deviate as long as the others use it, and compare it to the first-come first-served discipline.

Original language	English
Pages (from-to)	285-288
Number of pages	4
Journal	Operations Research Letters
Volume	4
Issue number	6
DOIs	https://doi.org/10.1016/0167-6377(86)90030-1
State	Published - Apr 1986

Keywords

priority purchasing
priority queues

Access to Document

10.1016/0167-6377(86)90030-1

Cite this

@article{c9b0e869c4174e02919319eefca90547,

title = "Stable priority purchasing in queues",

abstract = "We consider an M G1 queueing system where each customer can purchase the priority with which he will be served. Customers may differ in their time valuation. They know the statistical distrubution of the queue length and amounts paid by others, but not their actual values. We determine the payment policy from which no customer will deviate as long as the others use it, and compare it to the first-come first-served discipline.",

keywords = "priority purchasing, priority queues",

author = "Amihai Glazer and Refael Hassin",

year = "1986",

month = apr,

doi = "10.1016/0167-6377(86)90030-1",

language = "אנגלית",

volume = "4",

pages = "285--288",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier",

number = "6",

}

TY - JOUR

T1 - Stable priority purchasing in queues

AU - Glazer, Amihai

AU - Hassin, Refael

PY - 1986/4

Y1 - 1986/4

N2 - We consider an M G1 queueing system where each customer can purchase the priority with which he will be served. Customers may differ in their time valuation. They know the statistical distrubution of the queue length and amounts paid by others, but not their actual values. We determine the payment policy from which no customer will deviate as long as the others use it, and compare it to the first-come first-served discipline.

AB - We consider an M G1 queueing system where each customer can purchase the priority with which he will be served. Customers may differ in their time valuation. They know the statistical distrubution of the queue length and amounts paid by others, but not their actual values. We determine the payment policy from which no customer will deviate as long as the others use it, and compare it to the first-come first-served discipline.

KW - priority purchasing

KW - priority queues

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

U2 - 10.1016/0167-6377(86)90030-1

DO - 10.1016/0167-6377(86)90030-1

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.letter???

AN - SCOPUS:0022693702

VL - 4

SP - 285

EP - 288

JO - Operations Research Letters

JF - Operations Research Letters

SN - 0167-6377

IS - 6

ER -

Stable priority purchasing in queues

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this