Zurück zu den Preprints des Jahres 2011


2011-33

Solving Efficiently a Special Case of Scheduling Jobs on Unrelated Machines to Minimize the Makespan

by Vakhania, N.; Werner, F..


Series: 2011-33, Preprints

MSC:
90B35 Scheduling theory, deterministic

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