275
Voted
ICICIC
2006
IEEE
16 years 10 days ago
2006
IEEE
In timetable scheduling problems, examination subjects must be slotted to certain times that satisfy several of constraints. They are NP-completeness problems, which usually lead ...