Question: Suppose there is a 12 step task (index 0 = Start, index 13 = Finish) whose duration of steps and dependencies are given by the
Suppose there is a 12 step task (index 0 = Start, index 13 = Finish) whose duration of steps and dependencies are given by the graph in


3 3 V11 v8 V5 V2 6. 8 V13 V12 V4 V1 V10 V6 V3 What is the minimum time to completion?
Step by Step Solution
3.46 Rating (166 Votes )
There are 3 Steps involved in it
Answer Activity Dependency Time Start End 1 5 0 5 2 3 0 3 ... View full answer
Get step-by-step solutions from verified subject matter experts
