Nodes are assigned to their last state that they can possibly be in.

1. All nodes in V which have no successors are assigned to the last state which can be inferred from the Time constraint T and they are removed from set V
2. All the nodes that have all their successors scheduled are assigned to their latest possible state.

Note: The latest possible state can be calculated by taking the minimum state that the successors of this node reached and we subtract from it the duration of this node.