4 citations · 11 across the 8 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.DS2021
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…
cs.DS2021★ 1 cited
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…