Ara
Toplam kayıt 2, listelenen: 1-2
Integer Programming Versus Constraint Programming: a Course Timetabling Case Study
(University of Cincinnati Industrial Engineering, 2019)
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 ...
Minimum Penalty Perturbation Heuristics for Curriculum-Based Timetables Subject to Multiple Disruptions
(Elsevier, 2021)
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 ...