Ara
Toplam kayıt 4, listelenen: 1-4
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 ...
Robust University Course Timetabling Problem Subject to Single and Multiple Disruptions
(Elsevier, 2020)
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 ...
A Bi-criteria Hybrid Genetic Algorithm with Robustness Objective for the Course Timetabling Problem
(Elsevier, 2018)
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 ...
Bi-criteria Simulated Annealing for the Curriculum-based Course Timetabling Problem With Robustness Approximation
(Springer, 2022)
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 ...