2 papers
cs.DS2026
Refining the Complexity Landscape of Speed Scaling: Hardness and Algorithms
Antonios Antoniadis, Denise Graafsma, Ruben Hoeksma +1
We study the computational complexity of scheduling jobs on a single speed-scalable processor with the objective of capturing the trade-off between the (weighted) flow time and the…
cs.DS2025
Stochastic scheduling with Bernoulli-type jobs through policy stratification
Antonios Antoniadis, Ruben Hoeksma, Kevin Schewior +1
This paper addresses the problem of computing a scheduling policy that minimizes the total expected completion time of a set of jobs with stochastic processing times on par…