Abstract: A rescheduling problem of steelmaking-continuous casting with new tasks arrival was studied in this paper. By mapping new tasks that would be insert an initial schedule to the added time constraint, a dynamic constraint satisfaction model was established to minimize the difference of the start time of the old jobs between the initial schedule and the adjust one. And according to this model, a local repair rescheduling algorithm based on dynamic constraint satisfaction techniques was put forward. In this method, the Little Freedom First(LFF) strategy was used to select variables and the Biggest Idle time Feasible Distribution(BIFD) strategy to assign one value to a variable. The conflict identification and elimination principles were used to identify and eliminate the time conflicts and resource conflicts in the assignment. In simulation experiment, three different insertion time points were generated randomly. Target value were all zero. The results demonstrate that the algorithm can satisfy the needs of realtime and stability as much as possible.

Key words: schedule repair, dynamic constraint satisfaction, rescheduling, steelmaking and continuous casting