Steelmaking-Refining-Continuous Casting Scheduling Algorithm Based On Scatter Search Algorithm

The Steelmaking-Refining-Continuous Casting is a critical process in iron and steel industry. Steelmaking-Refining-Continuous Casting Scheduling Problem (SRCCP) is very important for the improvement of quality and efficiency. The aim of SRCCP is resolve the produce sequence, distribute the equipments, and arrange the time. Currently, the SRCCP be abstracted to Hybrid Flow Shop scheduling problem (HFSP).First of all, this thesis investigates the HFSP, and aim to get an minimum the producing time. A strategy designed to realize the five major modules by employing the method of Scatter Search. The diversification generation method combined the Diversification Generator for Permutation and heuristic rule (FAM, MRPT) with the encoded mode of to generate the initial population. The improvement method employed the improved neighborhood search. The solution combination method employed order crossover (OX) of genetic operator, as well as the heuristic rule (FAM, MRPT) to generate the new results. Finally, the results of scheduling are judged by minimum value of total calculated process time.SRCCP belong to the problem of HFSP with industrial technology contrain. The SRCCP in this thesis take the temperature constrain and transportation time into consideration,also in clude limitation of continuous casting,and then reslove it with the method of advanced scatter search. The experiment results verified the effectiveness of the above mentioned method for the hybrid flow shop and SRCCP.