1 citations · 1 across the 4 of their papers we have counts for
8 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…
(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…
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…
Approximation Algorithms for Scheduling with Class Constraints
Klaus Jansen, Alexandra Lassota, Marten Maack
Assigning jobs onto identical machines with the objective to minimize the maximal load is one of the most basic problems in combinatorial optimization. Motivated by product planing…
Online Bin Covering with Limited Migration
Sebastian Berndt, Leah Epstein, Klaus Jansen +3
Semi-online models where decisions may be revoked in a limited way have been studied extensively in the last years. This is motivated by the fact that the pure online model is ofte…