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...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | en |
| Published: |
MAXWELL Science Publication
2015
|
| Subjects: | |
| Online Access: | https://repo.uum.edu.my/id/eprint/18608/1/RJASET%2010%208%202015%20882-889.pdf https://repo.uum.edu.my/id/eprint/18608/ http://doi.org/10.19026/rjaset.10.2443 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|