No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem.
Marcin MuchaMaxim SviridenkoPublished in: Math. Oper. Res. (2016)
Keyphrases
- flowshop scheduling
- flowshop scheduling problems
- flowshop
- branch and bound algorithm
- databases
- combinatorial optimization problems
- decision making
- data sets
- decision trees
- data structure
- video sequences
- cooperative
- hidden markov models
- upper bound
- simulated annealing
- artificial intelligence
- machine learning
- computationally hard
- neural network