25 citations · 46 across the 15 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2021
A Constant-Factor Approximation for Generalized Malleable Scheduling under -Concave Processing Speeds
Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos
In generalized malleable scheduling, jobs can be allocated and processed simultaneously on multiple machines so as to reduce the overall makespan of the schedule. The required proc…
cs.DM2021★ 1 cited
Assigning and Scheduling Generalized Malleable Jobs under Subadditive or Submodular Processing Speeds
Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos
Malleable scheduling is a model that captures the possibility of parallelization to expedite the completion of time-critical tasks. A malleable job can be allocated and processed s…