10 search results - page 1 / 2 » Solving Examination Timetabling Problems through Adaption of... |
ANOR
2004
13 years 4 months ago
2004
ISCIS
2009
Springer
13 years 11 months ago
2009
Springer
—In this paper, we combine graph coloring heuristics, namely largest degree and saturation degree with the concept of a heuristic modifier under the framework of squeaky wheel op...
ICCSA
2007
Springer
13 years 11 months ago
2007
Springer
This paper presents a Greedy-Least Saturation Degree (G-LSD) heuristic (which is an adaptation of the least saturation degree heuristic) to solve a real-world examination timetabli...
COCOA
2009
Springer
13 years 11 months ago
2009
Springer
This work presents a simple graph based heuristic that employs a roulette wheel selection mechanism for solving examination timetabling problems. We arrange exams in non-increasing...
IJAMCIGI
2010
13 years 2 months ago
2010
Hyper-heuristics are identified as the methodologies that search the space generated by a finite set of low level heuristics for solving difficult problems. One of the iterative h...