Variable neighborhood search for two-agent flow shop scheduling problem.
Deming LeiPublished in: Comput. Ind. Eng. (2015)
Keyphrases
- variable neighborhood search
- metaheuristic
- tabu search
- traveling salesman problem
- routing problem
- heuristic methods
- search procedure
- single machine scheduling problem
- path relinking
- vehicle routing problem
- benchmark instances
- hybrid method
- minimum spanning tree
- simulated annealing
- upper bound
- max min
- scatter search