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,...
| मुख्य लेखक: | |
|---|---|
| स्वरूप: | थीसिस |
| भाषा: | अंग्रेज़ी अंग्रेज़ी |
| प्रकाशित: |
2009
|
| विषय: | |
| ऑनलाइन पहुंच: | http://psasir.upm.edu.my/id/eprint/11930/1/FSKTM_2009_11_A.pdf |