2 papers
cs.DS2025
Online busy time scheduling with flexible jobs
Susanne Albers, G. Wessel van der Heijden
We consider the online busy time scheduling problem motivated by energy and cost minimization in cloud computing systems. The input is a set of jobs where each jo…
cs.DS2025
On the 2D Demand Bin Packing Problem: Hardness and Approximation Algorithms
Susanne Albers, Waldo Gálvez, Ãmer Behic Ãzdemir
We study a two-dimensional generalization of the classical Bin Packing problem, denoted as 2D Demand Bin Packing. In this context, each bin is a horizontal timeline, and rectangula…