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...
| Asıl Yazarlar: | , , |
|---|---|
| Materyal Türü: | Makale |
| Dil: | English |
| Baskı/Yayın Bilgisi: |
Penerbit UTM Press
2015
|
| Konular: | |
| Online Erişim: | https://repo.uum.edu.my/id/eprint/18614/1/JT%20%2074%201%202015%20153%E2%80%93157.pdf |