Investigating constraint-based reasoning for university timetabling problem
University Course Timetabling Problems (UCTP) are a NP-complete, real-world problems, with many soft and hard constraints involved. The difficulties in generating a good timetable solution are different in almost every institution. This paper investigates the constraint-based reasoning algorithm to...
Saved in:
| Main Authors: | , , |
|---|---|
| 格式: | Book Section |
| 出版: |
Int Assoc Engineers-Iaeng
2008
|
| 主题: | |
| 在线阅读: | http://eprints.utm.my/id/eprint/12906/ |
| 标签: |
添加标签
没有标签, 成为第一个标记此记录!
|