22 citations · 40 across the 28 of their papers we have counts for
5 papers · 2 filters
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…
The Power of Duality: Response Time Analysis meets Integer Programming
Max A. Deppert, Klaus Jansen
We study a mutually enriching connection between response time analysis in real-time systems and the mixing set problem. Thereby generalizing over known results we present a new ap…
Structural Results for High-Multiplicity Scheduling on Uniform Machines
Hauke Brinkop, David Fischer, Klaus Jansen
Parameterizing by the largest processing time and the number of different job processing times , we propose a proximity technique for High-Multiplicity Scheduling on U…
A PTAS for Packing Hypercubes into a Knapsack
Klaus Jansen, Arindam Khan, Marvin Lira +1
We study the d-dimensional hypercube knapsack problem where we are given a set of d-dimensional hypercubes with associated profits, and a knapsack which is a unit d-dimensional hyp…
On the Complexity of Scheduling Problems With a Fixed Number of Parallel Identical Machines
Klaus Jansen, Kai Kahler
In parallel machine scheduling, we are given a set of jobs, together with a number of machines and our goal is to decide for each job, when and on which machine(s) it should be sch…