Timing Constraints

• Deadline for the completion date of the whole schedule



• Deadline for the completion dates of individual nodes of the algorithm graph

They are easy to check because the obtained schedule is static