Iterative Greedy Algorithm for Scheduling of Continuous Annealing Process in Cold Rolling

With the rapid improvement of the overall manufacturing level in China, the demand for steel products by downstream manufacturing enterprises is more personalized. This trend has brought greater difficulties to the production planning and scheduling of steel enterprises. In order to solve production scheduling problems of continuous annealing process in cold rolling, a mathematical model is established by converting violations of width jump, thickness jump and annealing temperature jump into penalty values. An iterative greedy algorithm is designed according to the characteristics of the model. The model and algorithm are verified and tested by taking use of actual production instances of iron and steel enterprises. The experimental results show that the model is correct and the algorithm is effective. Scheduling plans obtained by the proposed algorithm is obviously better than scheduling plans based on human experience.