25 citations · 53 across the 11 of their papers we have counts for
20 papers
Scheduling to Maximize Weighted Throughput with an Active-Time Budget
Susanne Albers, G. Wessel van der Heijden
We study the active-time scheduling problem with weighted throughput maximization. In this setting, a set of jobs arrive at integer release times, each with an integer proc…
Tight Bounds for Online Matching in Bounded-Degree Graphs with Vertex Capacities
Susanne Albers, Sebastian Schubert
We study the -matching problem in bipartite graphs . Each vertex is a server with individual capacity . The vertices are requests that arrive o…
Machine Covering in the Random-Order Model
Susanne Albers, Waldo Gálvez, Maximilian Janke
In the Online Machine Covering problem jobs, defined by their sizes, arrive one by one and have to be assigned to parallel and identical machines, with the goal of maximizing t…
Algorithms for Right-Sizing Heterogeneous Data Centers
Susanne Albers, Jens Quedenfeld
Power consumption is a dominant and still growing cost factor in data centers. In time periods with low load, the energy consumption can be reduced by powering down unused servers.…
Algorithms for Energy Conservation in Heterogeneous Data Centers
Susanne Albers, Jens Quedenfeld
Power consumption is the major cost factor in data centers. It can be reduced by dynamically right-sizing the data center according to the currently arriving jobs. If there is a lo…
Scheduling with Testing on Multiple Identical Parallel Machines
Susanne Albers, Alexander Eckl
Scheduling with testing is a recent online problem within the framework of explorable uncertainty motivated by environments where some preliminary action can influence the duration…