A repairing heuristic procedure to multi-mode resource-constrained project scheduling problem

A common practice in project scheduling ?eld was of solving deterministic problems where possible disturbance occurrences are not considered. In this study, the multi-mode resource-constrained project scheduling is considered. When the project is online, a mode of a not yet executed job has to be changed. This change would also necessitate other job mode changes to save the schedule feasibility. We propose a quick repairing heuristic that provides a feasible schedule, which should be as close as possible to initial baseline schedule to maintain stability.