By Tuesday (Nov. 25) you must send an e-mail message to the TA describing the algorithm that you plan to implement and the data structures that you are going to use. If you are unable to give an adequate description of a correct algorithm or you fail to send an e-mail message, you will receive a short description of the TA's algorithm and 20 points will be deducted from your grade.
When graded, your completed assignment will be compiled and executed. Sixty-five points will be earned by correctly generating schedules for test files using constraint propagation and ignoring the global constraints (such as Job1 before Job2). Twenty more points will be earned if your program can generate correct schedules while adhering to the global constraints. The final 15 points will be earned by answering a short question:
The operations done on a graph in constraint propagation can also be seen as a depth-first search on a problem space. In this problem space search, what would the states represent? What are the operators that allow transitions between the states? What invariants hold at each ply of the search? You may answer these questions by drawing and labeling the tree structure or by a short written description.
Revised on Thursday, November 13, 1997