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

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