25 citations · 39 across the 3 of their papers we have counts for
4 papers
Scheduling with Testing on Multiple Identical Parallel Machines
Susanne Albers, Alexander Eckl
Scheduling with testing is a recent online problem within the framework of explorable uncertainty motivated by environments where some preliminary action can influence the duration…
A Stronger Impossibility for Fully Online Matching
Alexander Eckl, Anja Kirschbaum, Marilena Leichter +1
We revisit the fully online matching model (Huang et al., J.\ ACM, 2020), an extension of the classic online matching model due to Karp, Vazirani, and Vazirani (STOC 1990), which h…
Explorable Uncertainty in Scheduling with Non-Uniform Testing Times
Susanne Albers, Alexander Eckl
The problem of scheduling with testing in the framework of explorable uncertainty models environments where some preliminary action can influence the duration of a task. In the mod…
Minimization of Weighted Completion Times in Path-based Coflow Scheduling
Alexander Eckl, Luisa Peter, Maximilian Schiffer +1
Coflow scheduling models communication requests in parallel computing frameworks where multiple data flows between shared resources need to be completed before computation can cont…