On the optimality of approximation schemes for the classical scheduling problem.

Lin Chen Klaus Jansen Guochuan Zhang

Published in: SODA (2014)

Keyphrases

approximation schemes
scheduling problem
approximation algorithms
np hard
single machine
flowshop
permutation flowshop
setup times
minimizing makespan
processing times
tabu search
numerical methods
worst case
lower bound
parallel machines
wavelet transform
search space