Patrick Eschenfeldt, Ben Gross, Nicholas Pippenger
Published 2011-06-01Version 1
Kingman has shown, under very weak conditions on the interarrival- and sevice-time distributions, that First-Come-First-Served minimizes the variance of the waiting time among possible service disciplines. We show, under the same conditions, that Last-Come-First-Served maximizes the variance of the waiting time, thereby giving an upper bound on the variance among all disciplines.
A diffusion model of scheduling control in queueing systems with many servers
Scheduling control for queueing systems with many servers: asymptotic optimality in heavy traffic
An improved upper bound for critical value of the contact process on $\mathbb{Z}^d$ with $d\geq 3$
![QR code for arXiv:1106.0074 [math.PR]](http://oss.arxitics.com/images/favicon.svg)