2011/06/01 by Patrick Eschenfeldt, Eschenfeldt, Patrick, Ben Gross +3
Business, Management and Accounting · Engineering · #60K26 #90B22 #Advanced Manufacturing and Logistics Optimization #Advanced Queuing Theory Analysis #FOS: Mathematics #Probability (math.PR) #Scheduling and Optimization Algorithms
paper · pdf · doi:10.48550/arxiv.1106.0074
openalex publication_date 2011/06/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.