Showing cs.DSShow all
2 papers · 1 filter
cs.DS2024
A Tight ()-Approximation Algorithm for Demand Strip Packing
Franziska Eberle, Felix Hommelsheim, Malin Rau +1
We consider the Demand Strip Packing problem (DSP), in which we are given a set of jobs, each specified by a processing time and a demand. The task is to schedule all jobs such tha…
cs.DS2024★ 1 cited
Hardness and Tight Approximations of Demand Strip Packing
Klaus Jansen, Malin Rau, Malte Tutas
We settle the pseudo-polynomial complexity of the Demand Strip Packing (DSP) problem: Given a strip of fixed width and a set of items with widths and heights, the items must be pla…