Ara
Toplam kayıt 3, listelenen: 1-3
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 ...
Search Space Sampling by Simulated Annealing for Identifying Robust Solutions in Course Timetabling
(Institute of Electrical and Electronics Engineers Inc., 2020)
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 ...