Approximation Algorithms for Scheduling Unrelated Parallel Machines

Jan Karel Lenstra David B. Shmoys Éva Tardos

Published in: FOCS (1987)

Keyphrases

unrelated parallel machines
approximation algorithms
open shop
scheduling problem
np hard
parallel machines
special case
worst case
setup times
minimum cost
precedence constraints
job shop
primal dual
approximation ratio
single machine
flowshop
resource allocation
tabu search
constant factor approximation