1 citations · 1 across the 5 of their papers we have counts for
4 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…
Online Load Balancing on Uniform Machines with Limited Migration
Marten Maack
In the problem of online load balancing on uniformly related machines with bounded migration, jobs arrive online one after another and have to be immediately placed on one of a giv…
(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling
Marten Maack, Simon Pukrop, Anna Rodriguez Rasmussen
We consider variants of the restricted assignment problem where a set of jobs has to be assigned to a set of machines, for each job a size and a set of eligible machines is given,…
Cardinality Constrained Scheduling in Online Models
Leah Epstein, Alexandra Lassota, Asaf Levin +2
Makespan minimization on parallel identical machines is a classical and intensively studied problem in scheduling, and a classic example for online algorithm analysis with Graham's…