An improved Pareto local search for solving bi-objective scheduling problems in hot rolling mills.
Sheng-Long JiangWeigang LiXuejun ZhangChuanpei XuPublished in: Comput. Ind. Eng. (2022)
Keyphrases
- bi objective
- pareto local search
- scheduling problem
- efficient solutions
- multi objective
- set covering problem
- network design
- multi objective optimization
- knapsack problem
- ant colony optimization
- shortest path problem
- multiple objectives
- processing times
- flowshop
- evolutionary algorithm
- combinatorial optimization problems
- nsga ii
- np hard
- neural network
- single machine
- precedence constraints