Variable Neighborhood Search for Scheduling of Cold Rolling Annealing Process of Silicon Steel*

Aiming at the production scheduling problem of cold rolling annealing process of silicon steel, a multi-objective optimization model of production scheduling is established, which considered various process constraints such as steel grade switch, width jump, annealing temperature jump, etc. The multi-objective functions are transformed into a single objective function by weighted sum method. Based on the characteristics of the problem, four kinds of neighborhood structures for local search are proposed. And a variable neighborhood search algorithm is proposed to solve the problem. The correctness of the model and the effectiveness of the algorithm are verified by practical production instances. The experimental results show that the approximate Pareto solution set with good distribution can be obtained by using the weighted sum method and solved by the variable neighborhood search algorithm proposed in this paper.