Ara
Toplam kayıt 2, listelenen: 1-2
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 ...
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 ...