Showing 1 - 10 of 36
Persistent link: https://www.econbiz.de/10006648674
Persistent link: https://www.econbiz.de/10006132508
University timetabling is an NP-hard problem, which means that the amount of computation required to find solutions increases exponentially with problem size. Timetabling is subject to hard constraints that must be satisfied in order to produce feasible timetables and soft constraints, which are...
Persistent link: https://www.econbiz.de/10005339964
Persistent link: https://www.econbiz.de/10005347385
Persistent link: https://www.econbiz.de/10005348140
Persistent link: https://www.econbiz.de/10007917000
Persistent link: https://www.econbiz.de/10008900795
Conventional optimization approaches, such as Linear Programming, Dynamic Programming and Branch-and-Bound methods are well established for solving relatively simple scheduling problems. Algorithms such as Simulated Annealing, Taboo Search and Genetic Algorithms (GA) have recently been applied...
Persistent link: https://www.econbiz.de/10005458409
Persistent link: https://www.econbiz.de/10006024690
Persistent link: https://www.econbiz.de/10006970681