TY - JOUR
T1 - Who should be given priority in a queue?
AU - Hassin, Refael
AU - Haviv, Moshe
PY - 2006/3
Y1 - 2006/3
N2 - 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.
AB - 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.
KW - Discriminatory processor sharing (DPS)
KW - Equilibrium behavior
KW - Relative priorities
KW - Single server queues
UR - http://www.scopus.com/inward/record.url?scp=29144508871&partnerID=8YFLogxK
U2 - 10.1016/j.orl.2005.04.007
DO - 10.1016/j.orl.2005.04.007
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:29144508871
SN - 0167-6377
VL - 34
SP - 191
EP - 198
JO - Operations Research Letters
JF - Operations Research Letters
IS - 2
ER -