An asynchronous genetic local search algorithm for the permutation flowshop scheduling problem with total flowtime minimization.
Xiao XuZhenhao XuXingsheng GuPublished in: Expert Syst. Appl. (2011)
Keyphrases
- search algorithm
- total flowtime
- scheduling problem
- permutation flowshop
- minimizing makespan
- distributed constraint satisfaction problems
- flowshop scheduling problems
- flowshop
- flowshop scheduling
- tabu search
- objective function
- greedy algorithm
- genetic algorithm
- single machine
- branch and bound
- heuristic search
- upper bound
- np hard
- search space
- processing times
- neural network
- setup times
- parallel algorithm
- search procedure
- constraint satisfaction problems
- graphical models