Conflict-Based Repair Techniques for Solving Dynamic Scheduling Problems

Scheduling problems have been studied a lot over the last decade. Due to the complexity and the variety of such problems, most work consider static problems in which activities are known in advance and constraints are fixed. However, every schedule is subject to unexpected events (consider for example a new activity to schedule or a machine breakdown). In these cases, a new solution taking these events into account is needed in a preferably short time and as close as possible to the current solution.