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: | , , |
|---|---|
| Format: | Book Section |
| Published: |
Int Assoc Engineers-Iaeng
2008
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/12906/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|