On measuring fairness in queues

DOI10.1239/aap/1093962241zbMath1109.60074OpenAlexW2031879787MaRDI QIDQ4662245

Hanoch Levy, Benjamin Avi-Itzhak

Publication date: 30 March 2005

Published in: Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.aap/1093962241

zbMATH Keywords

fairnessQueueingqueue disciplineservice ordercustomer scheduling

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (11)

To Pool or Not to Pool: Queueing Design for Large-Scale Service Systems ⋮ Quantitative fairness for assessing perceived service quality in queues ⋮ A resource allocation queueing fairness measure: properties and bounds ⋮ Analysis of a last come first served queueing system with customer abandonment ⋮ Strategic behavior and social outcomes in a bottleneck queue: experimental evidence ⋮ Charging more for priority via two-part Tariff for accumulating priorities ⋮ Benchmark policies for utility-carrying queues with impatience ⋮ QUANTIFYING FAIRNESS IN QUEUING SYSTEMS ⋮ Locality of reference and the use of sojourn time variance for measuring queue unfairness ⋮ Online scheduling policies for multiclass call centers with impatient customers ⋮ On fairness in polling systems

Cites Work

• Unnamed Item
• Unnamed Item
• The amount of overtaking in a network of queues
• How fair is fair queuing

This page was built for publication: On measuring fairness in queues