A heuristic room matching algorithm in generating enhanced initial seed for the university course timetabling problem
The University Course Timetabling Problem (UCTP) such as the curriculum-based 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.The Curric...
Main Authors: | Teoh, Chong Keat, Haron, Habibollah, Wibowo, Antoni, Ngadiman, Mohd Salihin |
---|---|
Format: | Article |
Language: | English |
Published: |
MAXWELL Science Publication
2015
|
Subjects: | |
Online Access: | https://repo.uum.edu.my/id/eprint/18608/1/RJASET%2010%208%202015%20882-889.pdf |
Similar Items
-
A rectification strategy in genetic algorithms for academic timetabling problem
by: Teoh, Chong Keat, et al.
Published: (2015) -
Enhanced cuckoo optimization algorithm for university course timetabling problems /
by: Teoh, Chong Keat, 1988-, author 599898, et al.
Published: (2016) -
Heuristic faculty course timetabling with student sectioning
by: Chia, Lih Bong, et al.
Published: (2017) -
Slec heuristic for producing initial CB-CTT timetable
by: Alsheikh, Noor Nabeel Hazim, et al.
Published: (2019) -
Construction of initial solution population for curriculum-based course timetabling using combination of graph heuristics
by: Wahid, Juliana, et al.
Published: (2016)