Flattening Fixed-Angle Chains Is Strongly NP-Hard.

Erik D. Demaine Sarah Eisenstat

Published in: WADS (2011)

Keyphrases

strongly np hard
scheduling problem
setup times
lower bound
approximation algorithms
branch and bound algorithm
flowshop
np hard
fixed number
identical parallel machines
permutation flowshop
upper bound
sequence dependent setup times
neural network
cost function
tabu search