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 Curr...
Disimpan dalam:
| Pengarang-pengarang Utama: | , , , |
|---|---|
| Format: | Artikel |
| Bahasa: | English |
| Diterbitkan: |
Maxwell Science Publications
2015
|
| Subjek-subjek: | |
| Capaian Atas Talian: | http://eprints.utm.my/55467/ http://eprints.utm.my/55467/1/HabibollahHaron2015_AHeuristicRoomMatchingAlgorithm.pdf |
| Penanda-penanda: |
Tambah Penanda
Tiada Penanda, Jadilah orang pertama menanda rekod ini!
|