Series: 2011-33, Preprints
Abstract:
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.
Keywords:
scheduling, unrelated machines, linear programming, minimization, makespan, algorithm