A path relinking with tabu search algorithm for solving hybrid flow shop scheduling problem considering multiple critical paths.
Hao ZhouHui LiuChang LvChaoyong ZhangWeiming ShenPublished in: Comput. Oper. Res. (2024)
Keyphrases
- path relinking
- tabu search
- search algorithm for solving
- search procedure
- metaheuristic
- scatter search
- grasp with path relinking
- simulated annealing
- multi start
- simulated annealing and tabu search
- max min
- search algorithm
- feasible solution
- scheduling problem
- variable neighborhood search
- neighborhood search
- solution space
- shortest path