Ara
Toplam kayıt 3, listelenen: 1-3
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 ...
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 ...
A Bi-criteria Hybrid Genetic Algorithm with Robustness Objective for the Course Timetabling Problem
(Patat, 2016)
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 ...