1 citations · 1 across the 3 of their papers we have counts for
4 papers
Competitive Kill-and-Restart and Preemptive Strategies for Non-Clairvoyant Scheduling
Sven Jäger, Guillaume Sagnol, Daniel Schmidt genannt Waldschmidt +1
We study kill-and-restart and preemptive strategies for the fundamental scheduling problem of minimizing the sum of weighted completion times on a single machine in the non-clairvo…
Restricted Adaptivity in Stochastic Scheduling
Guillaume Sagnol, Daniel Schmidt genannt Waldschmidt
We consider the stochastic scheduling problem of minimizing the expected makespan on parallel identical machines. While the (adaptive) list scheduling policy achieves an approx…
Scheduling with Machine Conflicts
Moritz Buchem, Linda Kleist, Daniel Schmidt genannt Waldschmidt
We study the scheduling problem of makespan minimization while taking machine conflicts into account. Machine conflicts arise in various settings, e.g., shared resources for pre- a…
Stochastic Extensible Bin Packing
Guillaume Sagnol, Daniel Schmidt genannt Waldschmidt
We consider the stochastic extensible bin packing problem (SEBP) in which items of stochastic size are packed into bins of unit capacity. In contrast to the classical bin p…