Incorporating of constraint-based reasoning into particle swarm optimization for university timetabling problem
Timetabling problems are often difficult and time-consuming task. It involves a set of timeslots, classrooms, subjects, students and lecturers. The complexity problem is the constraints that exist within the resources. Thus, a technique that can handle constraints is needed to optimize the problem....
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Published: |
2009
|
| Subjects: |