Using a variable neighborhood search to solve a bi-objective identical parallel machine scheduling problem.
Leandro Resende MundimThiago Alves de QueirozPublished in: Electron. Notes Discret. Math. (2018)
Keyphrases
- bi objective
- variable neighborhood search
- total weighted tardiness
- single machine
- multi objective
- efficient solutions
- heuristic methods
- routing problem
- metaheuristic
- single machine scheduling problem
- tabu search
- multi objective optimization
- multiple objectives
- ant colony optimization
- lagrangian relaxation
- scheduling problem
- sequence dependent setup times
- processing times
- network design
- evolutionary algorithm
- knapsack problem
- minimum spanning tree
- particle swarm optimization
- optimal solution
- combinatorial optimization
- shortest path problem
- mathematical model
- path relinking
- release dates