6 citations · 8 across the 7 of their papers we have counts for
3 papers · 1 filter
Approximating Weighted Completion Time for Order Scheduling with Setup Times
Alexander Mäcker, Friedhelm Meyer auf der Heide, Simon Pukrop
Consider a scheduling problem in which jobs need to be processed on a single machine. Each job has a weight and is composed of several operations belonging to different families. T…
Managing Multiple Mobile Resources
Björn Feldkord, Till Knollmann, Manuel Malatyali +1
We extend the Mobile Server Problem, introduced in SPAA'17, to a model where k identical mobile resources, here named servers, answer requests appearing at points in the Euclidean…
The Mobile Server Problem
Björn Feldkord, Friedhelm Meyer auf der Heide
We introduce the mobile server problem, inspired by current trends to move computational tasks from cloud structures to multiple devices close to the end user. An example for this…