A multi-start variable neighbourhood descent algorithm for hybrid flowshop rescheduling.
Kunkun PengQuan-Ke PanLiang GaoXinyu LiSwagatam DasBiao ZhangPublished in: Swarm Evol. Comput. (2019)
Keyphrases
- dynamic programming
- multi start
- computational complexity
- benchmark problems
- search space
- objective function
- scheduling problem
- particle swarm optimization
- vehicle routing problem with time windows
- monte carlo
- iterated local search
- bicriteria
- scatter search
- flowshop
- knapsack problem
- tabu search
- simulated annealing
- np hard
- evolutionary algorithm