2 papers
cs.DS2024
Speed-robust scheduling revisited
Josef MinaÅÃk, JiÅÃ Sgall
Speed-robust scheduling is the following two-stage problem of scheduling jobs on uniformly related machines. In the first stage, the algorithm receives the value of and…
cs.DS2024
Improved online load balancing with known makespan
Martin Böhm, Matej Lieskovský, Sören Schmitt +2
We break the barrier of for the problem of online load balancing with known makespan, also known as bin stretching. In this problem, identical machines and the optimal ma…