Open problem: Size-based scheduling with estimation errors

DOI10.1287/STSY.2019.0041MaRDI QIDQ5113903zbMATH OpenOpenAlexFDO

Authors Douglas G. Down

Publication date 18 June 2020

Published in Stochastic Systems (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1287/stsy.2019.0041

zbMATH Keywords

shortest remaining processing timeestimation errorsserver scheduling

Mathematics Subject Classification ID

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

Recommendations

• SEH: size estimate hedging for single-server queues
• Open problem: \(M/G/k/SRPT\) under medium load
• Open Problem—M/G/1 Scheduling with Preemption Delays
• On the average sojourn time under \(M/M/1/\)SRPT
• Size- and state-aware dispatching problem with queue-specific job sizes

Cites work

• The Queue M/G/1 with the Shortest Remaining Processing Time Discipline

Cited in

(7)

• SEH: size estimate hedging for single-server queues
• PSBS: Practical Size-Based Scheduling
• On the Variance of the Least Attained Service Policy and Its Use in Multiple Bottleneck Networks
• SEH: size estimate hedging scheduling of queues
• Open problem: \(M/G/k/SRPT\) under medium load
• Introduction to the Applied Probability Society’s “Open Problems in Applied Probability” Session at the INFORMS Annual Meeting, Phoenix, Arizona, November 4–7, 2018
• Size- and state-aware dispatching problem with queue-specific job sizes

This page was built for publication: Open problem: Size-based scheduling with estimation errors

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