Case-based heuristic selection for timetabling problems

@misc{citeulike:1734852, abstract = {This paper presents a case-based heuristic selection approach for automated university course and exam timetabling. The method described in this paper is motivated by the goal of developing timetabling systems that are fundamentally more general than the current state of the art. Heuristics that worked well in previous similar situations are memorized in a case base and are retrieved for solving the new problem in hand. Knowledge discovery techniques are employed in two distinct scenarios....}, author = {Burke, E. and Petrovic, S. and Qu, R. }, citeulike-article-id = {1734852}, keywords = {problems, timetabling}, posted-at = {2007-10-07 03:09:30}, priority = {2}, title = {Case-based heuristic selection for timetabling problems}, url = {http://citeseer.ist.psu.edu/646141.html}, year = {2003} }

TY - GEN ID - citeulike:1734852 L3 - citeulike-article-id:1734852 N2 - This paper presents a case-based heuristic selection approach for automated university course and exam timetabling. The method described in this paper is motivated by the goal of developing timetabling systems that are fundamentally more general than the current state of the art. Heuristics that worked well in previous similar situations are memorized in a case base and are retrieved for solving the new problem in hand. Knowledge discovery techniques are employed in two distinct scenarios.... TI - Case-based heuristic selection for timetabling problems KW - problems KW - timetabling AU - Burke, E AU - Petrovic, S AU - Qu, R PY - 2003/// UR - http://citeseer.ist.psu.edu/646141.html ER -