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 timetab...
Saved in:
| Main Authors: | , , |
|---|---|
| 格式: | Article |
| 语言: | English |
| 出版: |
Penerbit UTM Press
2015
|
| 主题: | |
| 在线阅读: | http://eprints.utm.my/id/eprint/55860/1/TeohCheongKeat2015_ARectificationStrategyinGeneticAlgorithms.pdf http://eprints.utm.my/id/eprint/55860/ http://dx.doi.org/10.11113/jt.v74.3041 |
| 标签: |
添加标签
没有标签, 成为第一个标记此记录!
|