70 likes | 225 Vues
Scheduling Problem. A Project by Andrew Hutcheson with Advice from Mark Bailey. Choosing Courses. No two chosen courses can meet at the same time Any prerequisites the chosen courses have must be satisfied The chosen courses should help satisfy future prerequisites. MWF 09:00-09:50.
E N D
Scheduling Problem A Project by Andrew Hutcheson with Advice from Mark Bailey
Choosing Courses • No two chosen courses can meet at the same time • Any prerequisites the chosen courses have must be satisfied • The chosen courses should help satisfy future prerequisites
MWF 09:00-09:50 [ 540 , 590 ] , [ 3420 , 3470 ] , [ 6300 , 6350 ] A Meeting is a structure with fields start and end. Two Meetings, A and B are in conflict if and only if : A.start < B.endand A.end > B.start
Vertices represent Courses. • An edge A -> B indicates that A requires B
CS 348 requires CS 243 and PHYSICS 180 or PHYSICS 230 How do we represent this?
Add a integer field, r (number required), to each vertex • Specify a second type of vertex, Goal, that- • Is reached as soon as requirements are met • Is not associated with any Course
Acknowledgements • Mark Bailey provided excellent advice and motivation • Kristin Friedel and Joan Johnson provided electronic copies of data • Evans Mbugua and Tom Spicer provided info that I didn’t use but thanks anyway.