Sign in
On the optimality of approximation schemes for the classical scheduling problem.
Lin Chen
Klaus Jansen
Guochuan Zhang
Published in:
CoRR (2013)
Keyphrases
</>
approximation schemes
scheduling problem
approximation algorithms
np hard
single machine
flowshop
optimal solution
setup times
numerical methods
minimizing makespan
tabu search
processing times
parallel machines
bin packing
permutation flowshop
dynamical systems
multiscale
image processing