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...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Published: |
Springer Verlag
2015
|
| Subjects: |