Course timetables are often rendered infeasible due to unexpected changes in requirements and must be repaired. Given an initial timetable, planners prefer a repaired timetable whose quality is worsened as little as possible while its structural difference is also as little as possible. This paper formulates this problem as one of minimizing the quality degradation subject to an upper limit on the structural difference and presents one simulated annealing algorithm and a set of integer programming-based algorithms to solve it. These algorithms are tested on instances comprised of the ITC-2007 curriculum-based course timetabling test-bed and a set of randomly generated disruption scenarios, where each disruption scenario is based on a set of four disruption types that affect teacher and room availability. The results are analyzed with respect to two main goals, one being repairing a timetable after a single disruption scenario, and the other being the calculation of an estimated robustness of a solution based on a sample of disruption scenarios.

由于不可预料的需求变化，课程时间表常常变得不可行，必须予以修复。给定一个初始时间表，计划人员更喜欢一个经过修复的时间表，该时间表的质量应尽可能少地恶化，而其结构差异也应尽可能小。本文将此问题表述为最大程度地降低结构差异上限导致的质量下降，并提出了一种模拟退火算法和一组基于整数编程的算法来解决该问题。这些算法在由ITC-2007基于课程的课程时间表测试台和一组随机生成的中断方案组成的实例上进行了测试，其中，每个中断方案都基于影响教师和房间可用性的四种中断类型。