Skip to Main Content
Bell-type batch annealing is a "bottle-neck" procedure with complicated resource constraints, energy constraints and working procedure constraints, which is obviously different from other procedures in the cold rolling line. Its mathematic model is difficult to formulate and optimal scheduling is hard to implement. Scheduling in bell-type batch annealing includes combinatorial stacking of coils and order optimization. Firstly, the combinatorial optimization problem of stacking of coils is investigated in this paper, and the width, thickness and hardness trips of rolling slab, delivery ahead of schedule, and delayed punishment based on minimum production constraints are set up. Secondly, the minimum model of cold rolling production scheduling is established based on TSP (Travelling salesman Problem), and an immune bee colony optimization algorithm is proposed to solve the problem. Lastly, combined above-mentioned two methods, new optimal colony is generated by injecting the vaccine into the bee colony to ensure the feasibility of balanced production of cold rolling production line.