Is Tail-Optimal Scheduling Possible?

DOI10.1287/opre.1120.1086zbMath1257.90028OpenAlexW2141510310MaRDI QIDQ4904587

Adam Wierman, Bert Zwart

Publication date: 30 January 2013

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://resolver.caltech.edu/CaltechAUTHORS:20121221-104528945

zbMATH Keywords

competitive analysislarge deviations

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Stochastic scheduling theory in operations research (90B36)

Related Items (4)

On competitive analysis for polling systems ⋮ Instability of sharing systems in the presence of retransmissions ⋮ Achievable Performance of Blind Policies in Heavy Traffic ⋮ Approximately optimal scheduling of an \(\mathrm{M}/\mathrm{G}/1\) queue with heavy tails

This page was built for publication: Is Tail-Optimal Scheduling Possible?