Final Exam Scheduler - FES

@misc{citeulike:1734896, abstract = {Timetabling problems are constraint optimization problems proven to be NP complete. Furthermore, evaluation of violations is costly, and there is no common data format for representing timetabling problem instances. In this paper, a framework for designing memetic algorithms (MAs) to solve timetabling problems is described and a tool, named Final Exam Scheduler (FES) is introduced. FES is the first tool that accepts Timetabling Markup Language (TTML) documents as input. It utilizes an MA with...}, author = {Ozcan, E. and Ersoy, E. }, citeulike-article-id = {1734896}, keywords = {problems, timetabling}, posted-at = {2007-10-07 03:33:32}, priority = {2}, title = {Final Exam Scheduler - FES}, url = {http://citeseer.ist.psu.edu/ozcan05final.html}, year = {2005} }

TY - GEN ID - citeulike:1734896 L3 - citeulike-article-id:1734896 N2 - Timetabling problems are constraint optimization problems proven to be NP complete. Furthermore, evaluation of violations is costly, and there is no common data format for representing timetabling problem instances. In this paper, a framework for designing memetic algorithms (MAs) to solve timetabling problems is described and a tool, named Final Exam Scheduler (FES) is introduced. FES is the first tool that accepts Timetabling Markup Language (TTML) documents as input. It utilizes an MA with... TI - Final Exam Scheduler - FES KW - problems KW - timetabling AU - Ozcan, E AU - Ersoy, E PY - 2005/// UR - http://citeseer.ist.psu.edu/ozcan05final.html ER -