|
|
|
||||||||||||
|
|
|
|||||||||||
My researchThe examination timetabling problem has been much studied over a wide variety of approaches associated with different type of problem descriptions. It is known as an NP hard real world problem due to its complexity and challenging task within academic institution. It involved large number of variables and various difficulty of problem owing to the increasing of student enrolment and the introduction of new courses and modularization from year to year. The manual solution for this problem may need such a great effort to deal with because of a very large search space of this problem. These problems are very well known to academic literature and much survey has concentrated on various methods and strategies to solve this problem PublicationS. Abdul Rahman, A.
Bargiela, E. K. Burke, B. McCollum and E. Özcan, Construction of Examination
Timetables Based on Ordering Heuristics, Proceedings of the 24th International Symposium on Computer and Information
Sciences (ISCIS2009), Cyprus, 14-16
September 2009. IEEE. pdf Last updated Wednesday, 21.10.2009. |
School of Computer
Science and Information Technology Home Page
The University of Nottingham Home Page