Jhezelle Anne Omo BSA 1B B407
New Sample: Building a Community Garden
Let’s imagine a community is building a garden. The project has several tasks, some of which
depend on others. We will determine the project duration using PERT and CPM.
Tasks and Dependencies
Task Description Duration (days) Dependencies
A Select the site 3 None
B Get permits 4 None
C Design the layout 2 Task A
D Clear the land 5 Task B
Order gardening
E 3 Task C
supplies
F Install fencing 4 Task D
G Plant trees and flowers 6 Task E, Task F
H Set up seating area 2 Task G
Host garden opening
I 1 Task H
event
Step 1: Create a Network Diagram
Tasks and Dependencies
A: Select the site → No dependencies.
B: Get permits → No dependencies.
C: Design the layout → precedes task A.
D: Clear the land → precedes task B.
E: Order gardening supplies → precedes task C.
F: Install fencing → precedes task D.
G: Plant trees and flowers → precedes task E and task F.
H: Set up seating area → precedes task G.
I: Host garden opening event → precedes task H.
Network Diagram:
Start → A → C → E → G → H → I → End
Start → B → D → F → G → H → I → End
Step-by-Step Layout
1. Start Node: All tasks begin from a "Start" point.
• Task A and Task B can begin immediately since they have no dependencies.
2. Dependencies:
• Task A flows into Task C, which flows into Task E.
• Task B flows into Task D, which flows into Task F.
• Task E and F flows into Task G, which flows into Task H, which flows into Task I.
3. End Node: Task I leads to the project completion ("End").
Start
/ \
A B
| |
C D
| |
E F
\ /
G
|
H
|
I
|
End
Step 2: Solve Using PERT Estimate
Time for Each Task
Task Optimistic Most Likely Pessimistic (P) Te (Days)
(O) (M)
A 2 3 4 3
B 3 4 5 4
C 1 2 3 2
D 4 5 6 5
E 2 3 4 3
F 3 4 5 4
G 5 6 7 6
H 1 2 3 2
I 0 1 2 1
Identify Critical Path Using PERT
From the network diagram, we calculate the total duration of all paths.
1. Path 1: A → C → E → G → H → I
Duration = 3 + 2 + 3 + 6 + 2 + 1 = 17 days
2. Path 2: B → D → F → G → H → I
Duration = 4 + 5 + 4 + 6 + 2 + 1 = 22 days
Expected Time Using PERT
The critical path is the longest path: Path 2
Expected Time= 22 days
Step 3: Solve Using CPM
Durations (Fixed, Most Likely):
Task TE ES EF LS LF Float
(Slack)
A 3 0 3 0 3 0
B 4 0 4 0 4 0
C 2 3 5 5 7 2
D 5 4 9 4 9 0
E 3 5 8 7 10 2
F 4 9 13 9 13 0
G 6 13 19 13 19 0
H 2 19 21 19 21 0
I 1 21 22 21 22 0
Critical Path: A → C → E → G → H → I or B → D → F → G → H → I (both paths =
22 days).
Implications
Using PERT:
• PERT provides flexibility by considering uncertainty in task durations.
• Implication: If tasks are completed closer to optimistic times, the project could finish
earlier. However, delays could extend beyond the expected 22 days.
Using CPM:
• CPM provides a fixed duration based on the most likely estimates.
• Implication: Any delay in critical path tasks (B, D, F, G, H, I) will delay the project.
Non-critical tasks (A,C,E) have some slack and can tolerate minor delays.
Conclusion
Using PERT: Allows for flexibility by accounting for uncertainties in task durations. The project
duration could be shorter or longer than 22 days, depending on task completion times.
Using CPM: Focuses on managing the critical path for efficient project delivery within the fixed
22 days.
By combining PERT and CPM, the community garden project can be well-managed to balance
flexibility and control.
