1 citations · 3 across the 5 of their papers we have counts for
5 papers · 1 filter
Scheduling with Many Shared Resources
Max A. Deppert, Klaus Jansen, Marten Maack +2
Consider the many shared resource scheduling problem where jobs have to be scheduled on identical parallel machines with the goal of minimizing the makespan. However, each job need…
Closing the gap for single resource constraint scheduling
Klaus Jansen, Malin Rau
In the problem called single resource constraint scheduling, we are given identical machines and a set of jobs, each needing one machine to be processed as well as a share of a…
Peak Demand Minimization via Sliced Strip Packing
Max A. Deppert, Klaus Jansen, Arindam Khan +2
We study Nonpreemptive Peak Demand Minimization (NPDM) problem, where we are given a set of jobs, specified by their processing times and energy requirements. The goal is to schedu…
Solving Packing Problems with Few Small Items Using Rainbow Matchings
Max Bannach, Sebastian Berndt, Marten Maack +4
An important area of combinatorial optimization is the study of packing and covering problems, such as Bin Packing, Multiple Knapsack, and Bin Covering. Those problems have been st…
Linear Time Algorithms for Multiple Cluster Scheduling and Multiple Strip Packing
Klaus Jansen, Malin Rau
We study the Multiple Cluster Scheduling problem and the Multiple Strip Packing problem. For both problems, there is no algorithm with approximation ratio better than unless $P…