Zobrazeno 1 - 10
of 49
pro vyhledávání: '"Maack, Marten"'
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 needs exactly one additional shared resource in order to be executed and h
Externí odkaz:
http://arxiv.org/abs/2210.01523
Autor:
Maack, Marten
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 given set of machines without knowledge about jobs that may arrive later
Externí odkaz:
http://arxiv.org/abs/2209.00565
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, and the jobs may only be assigned to eligible machines with the goal o
Externí odkaz:
http://arxiv.org/abs/2203.06171
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 famous list scheduling algorithm dating back to the 1960s. In this pr
Externí odkaz:
http://arxiv.org/abs/2201.05113
Consider a set of jobs connected to a directed acyclic task graph with a fixed source and sink. The edges of this graph model precedence constraints and the jobs have to be scheduled with respect to those. We introduce the Server Cloud Scheduling pro
Externí odkaz:
http://arxiv.org/abs/2108.02109
This paper considers parallel machine scheduling with incompatibilities between jobs. The jobs form a graph and no two jobs connected by an edge are allowed to be assigned to the same machine. In particular, we study the case where the graph is a col
Externí odkaz:
http://arxiv.org/abs/2011.06150
Autor:
Bannach, Max, Berndt, Sebastian, Maack, Marten, Mnich, Matthias, Lassota, Alexandra, Rau, Malin, Skambath, Malte
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 studied extensively from the viewpoint of approximation algorithms, but
Externí odkaz:
http://arxiv.org/abs/2007.02660
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 and data placement, we study a natural extension called Class Constra
Externí odkaz:
http://arxiv.org/abs/1909.11970
Autor:
Maack, Marten, Jansen, Klaus
In the restricted assignment problem, the input consists of a set of machines and a set of jobs each with a processing time and a subset of eligible machines. The goal is to find an assignment of the jobs to the machines minimizing the makespan, that
Externí odkaz:
http://arxiv.org/abs/1907.03526
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 often too restrictive to model real-world applications, where some changes
Externí odkaz:
http://arxiv.org/abs/1904.06543