976 search results - page 1 / 196 » The Complexity of Timetable Construction Problems |
PATAT
1995
Springer
13 years 8 months ago
1995
Springer
EPIA
2007
Springer
13 years 11 months ago
2007
Springer
Research in the field of examination timetabling has developed in two directions. The first looks at applying various methodologies to induce examination timetables. The second tak...
TCS
2011
12 years 11 months ago
2011
Abstract. We consider the complexity of the traveling tournament problem, which is a well-known benchmark problem in tournament timetabling. The problem was supposed to be computat...
EVOW
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. This paper describes the application of a hybrid genetic algorithm to a real-world instance of the university course timetabling problem. We address the timetabling of la...
GECCO
2009
Springer
13 years 11 months ago
2009
Springer
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...