1 citations · 1 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2022
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…
cs.DS2020★ 1 cited
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…