Question: Activity Predecessors Time ( weeks ) Crash * per week A C , E 4 2 $ 2 0 0 0 B A 5 2
Activity Predecessors Time weeks Crash per week
A C E $
B A $
C G NA
D C $
E G $
F A D $
G none $
Shortest possible time for the task
Draw the project network and list the earliest start ES earliest finish EF latest start LS and latest finish LF for each task
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
