Ill-posed constraints

We analyze in this section properties of the algorithms presented in Section 6.3. We prove first the makeWellposed algorithm can minimally serialize an ill-posed constraint graph in attempt to make it well-posed, if a well-posed solution exists. We then prove the iterative incremental scheduling algorithm can construct a minimum relative schedule, if one exists, in polynomial time. 

---