Polynomial algorithms for scheduling jobs with two processing times on unrelated machines

What is it about?

We propose a polynomial-time algorithm that solves the problem of scheduling jobs with only two possible specific processing times p and 2p on unrelated machines with the objective to minimize the maximal job completion time.

Featured Image