An arbitrary heuristic room matching algorithm in obtaining an enhanced initial seed for the university course timetabling problem
The curriculum-based course timetabling problem is a subset of the university course timetabling problem which is often regarded as both an NP-hard and NP-complete problem. The nature of the problem concerns with the assignment of lecturers-courses to available teaching space in an academic institut...
Saved in:
Main Authors: | Keat, T. C., Haron, H., Wibowo, A., Ngadiman, M. S. |
---|---|
Format: | Article |
Published: |
Springer Verlag
2015
|
Subjects: | |
Online Access: | http://eprints.utm.my/id/eprint/59136/ http://dx.doi.org/10.1007/978-3-319-22689-7_21 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A heuristic room matching algorithm in generating enhanced initial seed for the university course timetabling problem
by: Keat, Teoh Chong, et al.
Published: (2015) -
A heuristic room matching algorithm in generating enhanced initial seed for the university course timetabling problem
by: Teoh, Chong Keat, et al.
Published: (2015) -
A study on heuristic timetabling method for faculty course timetable problem
by: Lih, Bong Chia, 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) -
Heuristic factors in ant system algorithm for course timetabling problem
by: Djamarus, Djasli, et al.
Published: (2009)