This document outlines a critical path method for a nine task project. It lists each task, their predecessors, optimistic, most likely and pessimistic time estimates, expected time and variance. Task C has the longest expected time of 14 days and tasks D and F have the shortest expected times of 5 days each.
This document outlines a critical path method for a nine task project. It lists each task, their predecessors, optimistic, most likely and pessimistic time estimates, expected time and variance. Task C has the longest expected time of 14 days and tasks D and F have the shortest expected times of 5 days each.
Copyright:
Attribution Non-Commercial (BY-NC)
Available Formats
Download as XLSX, PDF, TXT or read online from Scribd
This document outlines a critical path method for a nine task project. It lists each task, their predecessors, optimistic, most likely and pessimistic time estimates, expected time and variance. Task C has the longest expected time of 14 days and tasks D and F have the shortest expected times of 5 days each.
Copyright:
Attribution Non-Commercial (BY-NC)
Available Formats
Download as XLSX, PDF, TXT or read online from Scribd
Task Im P'rs Optimistic Most likely pessimistic Expected Time
A NONE 3 6 15 7 B NONE 2 4 14 5.33333333333333 C A 6 12 30 14 D A 2 5 8 5 E C 5 11 17 11 F D 3 6 15 7 G B 3 9 27 11 H E,F 1 4 7 4 I G,H 4 19 28 18 Activity variance 4 4 16 1 4 4 16 1 16
Duration (Weeks) Activity Predecessors To TM TP Te A - 5 6 7 6 B - 1 3 5 3 C - 1 4 7 4 D A 1 2 3 2 E B 1 2 9 3 F C 1 5 9 5 G C 2 2 8 3 H E, F 4 4 10 5 I D 2 5 8 5 J H, G 2 2 8 3