Tolerable Constructive Graph-Based Hyper-Heuristic Algorithm For Examination Timetabling

Examination Timetabling Problem (ETTP) is an NP-hard typical optimization problem faced by institutions and universities across the world. This nature leads to heuristic methods cover a large branch of researches in this area. On the other hand, the problem varies from one institution to another,...

全面介紹

書目詳細資料
主要作者: Mohammad Pour, Shahrzad
格式: Thesis
語言:英语
英语
出版: 2009
主題:
在線閱讀:http://psasir.upm.edu.my/id/eprint/11930/1/FSKTM_2009_11_A.pdf

相似書籍