1 citations · 1 across the 5 of their papers we have counts for
7 papers
A -Approximation for Preemptive Scheduling with Batch Setup Times
Max A. Deppert, David Fischer, Klaus Jansen
We consider the -hard problem , the problem of scheduling jobs, which are div…
A -Approximation for Multiple TSP with a Variable Number of Depots
Max Deppert, Matthias Kaul, Matthias Mnich
One of the most studied extensions of the famous Traveling Salesperson Problem (TSP) is the {\sc Multiple TSP}: a set of salespersons collectively traverses a set of …
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…
Load Balancing: The Long Road from Theory to Practice
Sebastian Berndt, Max A. Deppert, Klaus Jansen +1
There is a long history of approximation schemes for the problem of scheduling jobs on identical machines to minimize the makespan. Such a scheme grants a -approximation sol…
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…
Fuzzy Simultaneous Congruences
Max A. Deppert, Klaus Jansen, Kim-Manuel Klein
We introduce a very natural generalization of the well-known problem of simultaneous congruences. Instead of searching for a positive integer that is specified by fixed rem…