A rectification strategy in genetic algorithms for academic timetabling problem
The university 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 and may take on the form of high school timetabling, examination timetabl...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Penerbit UTM Press
2015
|
| Subjects: | |
| Online Access: | https://repo.uum.edu.my/id/eprint/18614/1/JT%20%2074%201%202015%20153%E2%80%93157.pdf |