84 citations · 88 across the 9 of their papers we have counts for
3 papers · 1 filter
Improved Analysis of two Algorithms for Min-Weighted Sum Bin Packing
Guillaume Sagnol
We study the Min-Weighted Sum Bin Packing problem, a variant of the classical Bin Packing problem in which items have a weight, and each item induces a cost equal to its weight mul…
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…
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…