In this study, two solution approaches are compared for a real-world, moderate-size but a highly constrained university course timetabling problem. The first approach is developing an integer programming model and solving ...

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

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

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

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