Solving Examination Timetabling Problems through Adaptation of Heuristic Orderings

@misc{citeulike:1734902, abstract = {Heuristic ordering based methods, very similar to those used for graph colouring problems, have long been applied successfully to the examination timetabling problem. Despite the success of these methods on real life problems, even with limited computing resources, the approach has the fundamental flaw that it is only as effective as the heuristic that is used. One of the motivations of this paper is to attempt to develop approaches that can operate at a higher level of generality and that ...}, author = {Burke, E. and Newell, J. }, citeulike-article-id = {1734902}, keywords = {problems, timetabling}, posted-at = {2007-10-07 03:35:44}, priority = {2}, title = {Solving Examination Timetabling Problems through Adaptation of Heuristic Orderings}, url = {http://citeseer.ist.psu.edu/burke03solving.html}, year = {2003} }

TY - GEN ID - citeulike:1734902 L3 - citeulike-article-id:1734902 N2 - Heuristic ordering based methods, very similar to those used for graph colouring problems, have long been applied successfully to the examination timetabling problem. Despite the success of these methods on real life problems, even with limited computing resources, the approach has the fundamental flaw that it is only as effective as the heuristic that is used. One of the motivations of this paper is to attempt to develop approaches that can operate at a higher level of generality and that ... TI - Solving Examination Timetabling Problems through Adaptation of Heuristic Orderings KW - problems KW - timetabling AU - Burke, E AU - Newell, J PY - 2003/// UR - http://citeseer.ist.psu.edu/burke03solving.html ER -