Login / Signup

Exact, Approximate, and Guaranteed Accuracy Algorithms for the Flow-Shop Problem n/2/F/\bar F.

Walter H. KohlerKenneth Steiglitz
Published in: J. ACM (1975)
Keyphrases
  • scheduling problem
  • exact and approximate
  • flowshop
  • computational complexity
  • optimization problems
  • tabu search
  • worst case
  • benchmark problems
  • exact computation