Login / Signup
A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates.
K. N. Kashyrskikh
Chris N. Potts
Sergey V. Sevastianov
Published in:
Discret. Appl. Math. (2001)
Keyphrases
</>
scheduling problem
computational complexity
dynamic programming
processing times
release dates
objective function
optimal solution
search space
np hard
worst case
convex hull
parallel machines
single machine scheduling problem
genetic algorithm
cost function
polynomial time approximation