Solving curriculum based course timetabling by hybridizing local search based method within harmony search algorithm
The curriculum-based university course timetabling which has been established as non-deterministic polynomial problem involves the allocation of times lots and rooms for a set of courses depend on the hard or soft constraints that are listed by the university.To solve the problem, firstly a set of h...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Springer Singapore
2015
|
| Subjects: | |
| Online Access: | https://repo.uum.edu.my/id/eprint/15448/1/1.pdf |