A rectification strategy in genetic algorithms for academic timetabling problem
The university course timetabling problem is both an NP-hard and NP-complete scheduling problem.The nature of the problem concerns with the assignment of lecturers-courses to available teaching space in an academic institution and may take on the form of high school timetabling, examination timetabl...
Main Authors: | Teoh, Chong Keat, Wibowo, Antoni, Ngadiman, Salihin |
---|---|
Format: | Article |
Language: | English |
Published: |
Penerbit UTM Press
2015
|
Subjects: | |
Online Access: | https://repo.uum.edu.my/id/eprint/18614/1/JT%20%2074%201%202015%20153%E2%80%93157.pdf |
Similar Items
-
A rectification strategy in genetic algorithms for academic timetabling problem
by: Teoh, Chong Keat, et al.
Published: (2015) -
An adapted cuckoo optimization algorithm and genetic algorithm approach to the university course timetabling problem
by: Wibowo, Antoni, et al.
Published: (2014) -
A heuristic room matching algorithm in generating enhanced initial seed for the university course timetabling problem
by: Teoh, Chong Keat, et al.
Published: (2015) -
Graph-based conflict rectification using stroke gesture approach in timetabling system (CORECTS)
by: Yong, Tien Fui, et al.
Published: (2010) -
A heuristic room matching algorithm in generating enhanced initial seed for the university course timetabling problem
by: Keat, Teoh Chong, et al.
Published: (2015)