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

1. All nodes in V which have no predecessors are assigned to state 1 and they are removed from set V
2. All the nodes that have all their predecessors scheduled are assigned to their earliest possible state.

Note: The earliest possible state can be calculated by taking the maximum state that the predecessors of this node reached and we add to it the duration of this node.