Scheduling with speed predictions

DOI10.1007/978-3-031-49815-2_6MaRDI QIDQ6574930zbMATH OpenFDO

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

Publication date 19 July 2024

Full work available at URL https://doi.org/10.1007/978-3-031-49815-2_6

zbMATH Keywords

algorithms with predictionapproximation algorithmscheduling

Mathematics Subject Classification ID

Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Recommendations

• Speed-robust scheduling. Sand, bricks, and rocks
• Speed-robust scheduling: sand, bricks, and rocks
• Algorithms with Predictions
• Contract scheduling with predictions

Cites work

• A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
• Algorithms with Predictions
• Distortion-oblivious algorithms for minimizing flow time
• Flow time scheduling with uncertain processing time
• Online Scheduling via Learned Weights
• Scheduling when you do not know the number of machines
• Scheduling with Predictions and the Price of Misprediction
• Scheduling with unexpected machine breakdowns
• Speed-robust scheduling. Sand, bricks, and rocks
• Universal sequencing on an unreliable machine

Cited in

(3)

• Speed-robust scheduling: sand, bricks, and rocks
• Contract scheduling with predictions
• Scheduling on a stochastic number of machines

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 Q6574930)