A study on PSO-based university course timetabling problem
In university timetabling problems, course subjects must be assigned to a certain timeslots and rooms that satisfy preferred constraints. Timetabling problem is NP-completeness problem, which is a difficult problem with a lot of constraints to be solved and a huge search space needed to be explored...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book Section |
| Published: |
Elsevier
2009
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/id/eprint/12903/ http://dx.doi.org/10.1109/ICACC.2009.112 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|