11-33

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

by Vakhania, N.; Werner, F.

 

Preprint series: 11-33, Preprints

MSC:
90B35 Scheduling theory, See also {68M20}

 

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.

Letzte Änderung: 01.03.2018 - Ansprechpartner:

Sie können eine Nachricht versenden an: Pierre Krenzlin
Sicherheitsabfrage:
Captcha
 
Lösung: