DAM
1998
14 years 3 days ago
1998
We study a discrete problem of scheduling activities of several types under the constraint that at most a single activity can be scheduled to any one period. Applications of such ...
ICICIC
2006
IEEE
14 years 6 months 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 ...