1 paper · 1 filter
Dor Arad, Yael Mordechai, Hadas Shachnai
We consider the problem of scheduling n jobs to minimize the makespan on m unrelated machines, where job j requires time pij if processed on machine i. A classic algor…