5 citations · 12 across the 3 of their papers we have counts for
1 paper · 2 filters
Pál András Papp, Georg Anegg, A. N. Yzelman
We study the problem of scheduling an arbitrary computational DAG on a fixed number of processors while minimizing the makespan. While previous works have mostly studied this probl…