Abstract: In the steelmaking and continuous casting processes, machine failures occur from time to time. Thus, rescheduling is necessary. In this paper, the rescheduling problem for such processes is addressed. By mapping machine failures to resource constraints, a dynamic constraint satisfaction model is developed for this problem to maximize the quantity of continuous casting and the similarity between the initial schedule and the adjust one. Based on this model and by analyzing the characteristics of the problem, a mixed algorithm that combines constraint satisfaction technology with neighborhood search is proposed. Simulation experiments show that the model and algorithm are effective.    

Key words: steelmaking-continuous casting, rescheduling, dynamic constraint satisfaction, neighborhood search