6 citations · 7 across the 3 of their papers we have counts for
3 papers
cs.DS2013★ 6 cited
Online Makespan Minimization with Parallel Schedules
Susanne Albers, Matthias Hellwig
In online makespan minimization a sequence of jobs has to be scheduled on identical parallel machines so as to minimize the maximum completion time of any job…
cs.DS2011
On the Value of Job Migration in Online Makespan Minimization
Susanne Albers, Matthias Hellwig
Makespan minimization on identical parallel machines is a classical scheduling problem. We consider the online scenario where a sequence of jobs has to be scheduled non-preempt…
cs.DS2011★ 1 cited
Approximation Algorithms for Variable-Sized and Generalized Bin Covering
Matthias Hellwig, Alexander Souza
We consider the Generalized Bin Covering (GBC) problem: We are given bin types, where each bin of type has profit and demand . Furthermore, there are items,…