1 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.DS2023★ 1 cited
Speed-Oblivious Online Scheduling: Knowing (Precise) Speeds is not Necessary
Alexander Lindermayr, Nicole Megow, Martin Rapp
We consider online scheduling on unrelated (heterogeneous) machines in a speed-oblivious setting, where an algorithm is unaware of the exact job-dependent processing speeds. We sho…
cs.DS2023★ 1 cited
Minimalistic Predictions to Schedule Jobs with Online Precedence Constraints
Alexandra Lassota, Alexander Lindermayr, Nicole Megow +1
We consider non-clairvoyant scheduling with online precedence constraints, where an algorithm is oblivious to any job dependencies and learns about a job only if all of its predece…