Create a single large list before starting scheduling instead of dynamically building a priority list while scheduling every control step.
 It sorts all operations using the ALAP labels in ascending order as the primary key and the ASAP labels in descending order as the secondary key.

read more from this topic.....

It is a generalization of the ASAP since it produces same results in the absence of resource constraints.
It uses a priority list of ready nodes (ready node: node that has its predecessors scheduled – the priority list is sorted with respect to a priority function)

read more from this topic.....

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

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

read more from this topic.....

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

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

read more from this topic.....