Question

Provide ALL possible paths for the completion of the PROJECT 1. Calculate total time required to complete each path. Determine the Critical Path(s). Complete the table by indicating the Critical Path (CP), the amount of slack and whether the task is a milestone. Task Predecessors Duration CP (Yes/No)? Slack (Amount)? Milestone? PROJECT 1 A1 A1, B1 NNNWNN D1, F1 PROJECT 2 A2 B2 A2 B2,C2 NWNWNN D2 E2, F2
Question on Project 2, Steps. Help. Thanks

Answer 1

Project 2 * Network diagram. * Forward pass (Earliest times). set 1, -0 0₂= D12=1 Az = 02 + D23 = 1+2=3 Duran Dz+D34, O₂ + D24 } . a mandato 1+ 2 } B4 = 3 Os = Dut Du5 = 3+3=6 Doa Is+ Ds6 = 6+2=8 Da man? Op+D67, Os+ D57 } = man {8 to, 6+3 } by = 9 As = 0+D78=9+2 211. * Backward pass (latest times). set A8= 11 Az = 48-D78=11-2 =9 A6- A7-D67 = 9-0=9.

Date As = min 2 46-D56 A-D57? ord = minf g - 2 9 -37 svody no As = 6 AL= A5-Dus = 6-3=3 A 2 to Az A4-D34=3 0 =3 A = min 24₂-D23, A4-D2h fr of =min 23-2, 3-2 } 42 - 4 A 42-D12 = 1-1= 0 is. * from abore calculations. A on Total time required to complete the project 1 unid time. A The possible paths for project 2 are. Az - C2 - D2 - f2 - G2 i) A₂ - B2- D2 - F2 - G2. dana Task Predecessors ouation cp slack milestone Yes yes yes 0 o yes yes Yes yes A2 A2 B2, C2 D2 D2 E2, F2 yes No yes No yes yes.