On The Parameterized Tractability of the Just-In-Time Flow-Shop Scheduling Problem.

Danny Hermelin Dvir Shabtay Nimrod Talmon

Published in: CoRR (2017)

Keyphrases

constraint satisfaction
np complete
computational complexity
genetic algorithm
learning algorithm
neural network
three dimensional
high level
search algorithm
training set
semi supervised