Preventing Large Sojourn Times Using SMART Scheduling
From MaRDI portal
Publication:3392158
DOI10.1287/opre.1070.0504zbMath1167.90457OpenAlexW2106992952MaRDI QIDQ3392158
Adam Wierman, Misja Nuyens, Bert Zwart
Publication date: 13 August 2009
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://resolver.caltech.edu/CaltechAUTHORS:20170408-151537902
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Stochastic scheduling theory in operations research (90B36)
Related Items (6)
Heavy-tailed limits for medium size jobs and comparison scheduling ⋮ Minimizing the mean slowdown in the M/G/1 queue ⋮ Heavy-Traffic Analysis of Sojourn Time Under the Foreground–Background Scheduling Policy ⋮ Sojourn time asymptotics in processor-sharing queues ⋮ 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: Preventing Large Sojourn Times Using SMART Scheduling