Speed-robust scheduling revisited

DOI10.4230/LIPICS.APPROX/RANDOM.2024.8MaRDI QIDQ6920838zbMATH OpenFDO

Authors Josef Minařík, Jiří Sgall

Publication date 6 October 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.APPROX/RANDOM.2024.8

zbMATH Keywords

approximation algorithmsmakespanschedulinguniform speeds

Mathematics Subject Classification ID

Randomized algorithms (68W20) Approximation algorithms (68W25) Combinatorial optimization (90C27)

Cites work

• A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
• A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
• Algorithms for dynamic speed scaling
• An optimal algorithm for preemptive on-line scheduling
• scientific article; zbMATH DE number 2109192 (Why is no real title available?)
• scientific article; zbMATH DE number 1418274 (Why is no real title available?)
• Scheduling when you do not know the number of machines
• Speed-robust scheduling revisited
• Speed-robust scheduling. Sand, bricks, and rocks
• The design of approximation algorithms
• Universal sequencing on an unreliable machine

Cited in

(3)

• Speed-robust scheduling revisited
• Scheduling with speed predictions
• Efficient approximation schemes for scheduling on a stochastic number of machines

This page was built for publication: Speed-robust scheduling revisited

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