Scheduling with speed predictions

DOI10.1007/S00224-024-10200-ZMaRDI QIDQ6996517zbMATH OpenFDO

Authors Eric Balkanski, Tingting Ou, Clifford Stein, Hao-Ting Wei

Publication date 15 April 2025

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00224-024-10200-Z

zbMATH Keywords

algorithms with predictionapproximation algorithmscheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic scheduling theory in operations research (90B35)

Cites work

• A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
• Competitive Caching with Machine Learned Advice
• Distortion-oblivious algorithms for minimizing flow time
• Flow time scheduling with uncertain processing time
• Online graph algorithms with predictions
• Online Nash social welfare maximization with predictions
• Online Scheduling via Learned Weights
• Parallel Machine Scheduling: Impact of Adding Extra Machines
• Scheduling on a stochastic number of machines
• Scheduling when you do not know the number of machines
• Scheduling with Predictions and the Price of Misprediction
• Scheduling with unexpected machine breakdowns
• Scheduling. Theory, algorithms, and systems.
• Secretaries with advice
• Speed-robust scheduling revisited
• Speed-robust scheduling: sand, bricks, and rocks
• Universal sequencing on an unreliable machine

This page was built for publication: Scheduling with speed predictions

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