Forward algorithm
Wednesday, December 02, 2009
11:24 AM
Forward scan: 
Label each task with its time.
Mark start's earliest start time and earliest completion time as 0. 
From left to right (start to finish), 
If a task's predecessors are marked with their earliest completion times, 
its earliest start time is the maximum of predecessor earliest completion times and 
its earliest completion time is its earliest start time plus its duration. 
At the end, every node is labeled with its earliest start and completion times. 