Open problem: Size-based scheduling with estimation errors

DOI10.1287/STSY.2019.0041zbMATH Open1446.60065OpenAlexW2973716314MaRDI QIDQ5113903FDOQ5113903

Authors: Douglas G. Down 

Publication date: 18 June 2020

Published in: Stochastic Systems (Search for Journal in Brave)

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

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

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)

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

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)