A bi-objective heuristic approach for green identical parallel machine scheduling.
Davide AnghinolfiMassimo PaolucciRoberto RoncoPublished in: Eur. J. Oper. Res. (2021)
Keyphrases
- bi objective
- set covering problem
- efficient solutions
- multi objective
- network design
- ant colony optimization
- heuristic methods
- multi objective optimization
- optimal solution
- dynamic programming
- shortest path problem
- multiple objectives
- knapsack problem
- simulated annealing
- genetic algorithm
- setup times
- routing problem
- tabu search
- shortest path
- search algorithm
- nsga ii
- search procedure
- variable neighborhood search
- neural network