Solving Efficiently a Special Case of Scheduling Jobs on Unrelated Machines to Minimize the Makespan
Preprint series: 11-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
The author(s) agree, that this abstract may be stored as full text and distributed as such by abstracting services.