Preventing Large Sojourn Times Using SMART Scheduling

DOI10.1287/OPRE.1070.0504MaRDI QIDQ3392158zbMATH OpenOpenAlexFDO

Authors Misja Nuyens, Adam Wierman, 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

Mathematics Subject Classification ID

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

Recommendations

• Heavy-traffic analysis of sojourn time under the foreground-background scheduling policy
• Is tail-optimal scheduling possible?
• Heavy-tailed limits for medium size jobs and comparison scheduling
• On the average sojourn time under \(M/M/1/\)SRPT
• Large deviations of sojourn times in processor sharing queues

Cited in

(10)

• Approximately optimal scheduling of an \(\mathrm{M}/\mathrm{G}/1\) queue with heavy tails
• Sojourn time asymptotics in processor-sharing queues
• Is tail-optimal scheduling possible?
• Heavy-traffic analysis of sojourn time under the foreground-background scheduling policy
• Achievable performance of blind policies in heavy traffic
• Minimizing the mean slowdown in the M/G/1 queue
• SEH: size estimate hedging scheduling of queues
• LookAhead: the optimal non-decreasing index policy for a time-varying holding cost problem
• Minimizing the sojourn time of open shop scheduling problems with unit-time operations
• Heavy-tailed limits for medium size jobs and comparison scheduling

This page was built for publication: Preventing Large Sojourn Times Using SMART Scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3392158)