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,...
Main Author: | Mohammad Pour, Shahrzad |
---|---|
Format: | Thesis |
Language: | English English |
Published: |
2009
|
Subjects: | |
Online Access: | http://psasir.upm.edu.my/id/eprint/11930/1/FSKTM_2009_11_A.pdf |
Similar Items
-
Solving single and bi-objective surgery scheduling problems using local search heuristic
by: Ab Rashid, Nur Shafiqah
Published: (2021) -
Hybrid migrating bird optimization based algorithms for university course timetabling problem /
by: Lam, Way Shen, 1989-, author
Published: (2016) -
Hybrid migrating bird optimization based algorithms for university course timetabling problem /
by: Lam, Way Shen, 1989-, author, et al.
Published: (2016) -
Heuristic search : theory and applications /
by: 330281 Edelkamp, Stefan, et al.
Published: (c 20) -
Theory of randomized search heuristics : foundations and recent developments /
by: Auger, Anne, et al.
Published: (c201)