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 ...

University course timetables are often finalized in stages, in between which, changes in the data make the earlier version infeasible. As each version is announced to the community, it is desirable to have a robust initial ...

Traditional methods of generating timetables may yield high-quality solutions, but they may not yield robust solutions that may easily be adapted to changing inputs. Incorporating late changes by making minimum modifications ...

A bi-criteria version of the curriculum-based university timetabling problem of ITC-2007 is solved using a multi-objective simulated annealing (MOSA) algorithm that identifies an approximation to the optimal Pareto front. ...

Traditional methods of generating timetables may not yield robust solutions that may easily be adapted to changing inputs. Incorporating late changes by making minimum modifications is an important need in many ...

For many combinatorial optimization problems, it is important to identify solutions that can be repaired without degrading solution quality in case changes in the data associated with the constraints make the initial ...

In the process of developing a university’s weekly course timetable, changes in the data, such as the available time periods of professors or rooms, render the timetable infeasible, requiring the administrators to repair ...