Genetic Algorithms in Timetabling and Scheduling

@misc{citeulike:1734869, abstract = {This thesis investigates the use of genetic algorithms (GAs) for solving a range of timetabling and scheduling problems. Such problems are very hard in general, and GAs offer a useful and successful alternative to existing techniques. A framework is presented for GAs to solve modular timetabling problems in educational institutions. The approach involves three components: declaring problemspecific constraints, constructing a problem-specific evaluation function and using a problem-independent...}, author = {Fang, H. and Thesis, P. }, citeulike-article-id = {1734869}, keywords = {problem, timetabling}, posted-at = {2007-10-07 03:17:59}, priority = {4}, title = {Genetic Algorithms in Timetabling and Scheduling}, url = {http://citeseer.ist.psu.edu/187751.html} }

TY - GEN ID - citeulike:1734869 L3 - citeulike-article-id:1734869 N2 - This thesis investigates the use of genetic algorithms (GAs) for solving a range of timetabling and scheduling problems. Such problems are very hard in general, and GAs offer a useful and successful alternative to existing techniques. A framework is presented for GAs to solve modular timetabling problems in educational institutions. The approach involves three components: declaring problemspecific constraints, constructing a problem-specific evaluation function and using a problem-independent... TI - Genetic Algorithms in Timetabling and Scheduling KW - problem KW - timetabling AU - Fang, H AU - Thesis, P UR - http://citeseer.ist.psu.edu/187751.html ER -