| With the constant optimization of the steel-making industrial structure and the rapid industrial technological innovation,the consumption of resource and energy draws a great and incremental attention by humans.How to improve the production quality,to reduce production cost and to cut energy consumption are where the dominant competitive force for modern iron and steel enterprises.Steelmaking-continuous casting,which is an important manufacturing process in steel production line,however it also makes equipment prone to sudden failure due to its nature of tight process and high energy consumption.Considering the flexible maintenance of the equipment and the limitations of the process in the production process,develop a realistic production scheduling plan,which make a great practicable significance and value.In this thesis,the problem of steelmaking-continuous casting scheduling with flexible periodic maintenance is studied,and the Scatter Search Algorithm(SS)was designed for solving the above-mentioned problem.through experimental simulation verify the correctness of the model and the effectiveness of the algorithm.Firstly,the background and significance of steelmaking-continuous casting optimization scheduling problem and equipment preventive maintenance were elaborated.A major research frame was summarized with the analysis and conclusion of the current problem research characteristics and main framework,mathematical model and its solving method.Besides,the thesis gives the definition of steelmaking-continuous casting scheduling problem considering the flexible period preventive maintenance of equipment,multi-objective,and the nonlinear mathematical programming model of scheduling problem.Optimization goal is to minimize maximum completion time,maximize equipment utilization,and minimize furnace maximum waiting time.Moreover,the SS algorithm for solving research problems is designed.By using the ordering method of A Fast and Elitist Multi-objective Genetic Algorithm(NSGAII),the combination operator of arc combination and the generation method of diversity solution of reverse order were designed.Ultimately,simulation experiments were conducted based on randomly generated test cases of different sizes.Compared with the NSGAII algorithm,the efficiency of the designed SS algorithm in solving the scheduling problem studied in this thesis is proved. |