Variable Neighborhood Search for Minimizing the Makespan in a Uniform Parallel Machine Scheduling.
Khaled BamatrafAnis GharbiPublished in: Syst. (2024)
Keyphrases
- variable neighborhood search
- tabu search
- metaheuristic
- traveling salesman problem
- heuristic methods
- routing problem
- hybrid method
- minimum spanning tree
- single machine scheduling problem
- vehicle routing problem
- benchmark instances
- path relinking
- processing times
- simulated annealing
- branch and bound algorithm
- scheduling problem
- feasible solution
- combinatorial optimization problems
- combinatorial problems
- ant colony optimization