Group D answer
### Step 1: List the Activities and Predecessors
1. **A** (6 weeks) → No predecessors
2. **B** (4 weeks) → No predecessors
3. **C** (3 weeks) → Predecessor: A
4. **D** (4 weeks) → Predecessor: B
5. **E** (2 weeks) → Predecessor: B
6. **F** (1 week) → Predecessor: C
7. **G** (2 weeks) → Predecessor: D
8. **H** (5 weeks) → Predecessors: E, F, G
### Step 2: Draw the Network Diagram
### Explanation of the Diagram:
- **A** starts the project and leads to **C**.
- **B** starts the project and splits into two paths: one leading to **D** and the other to **E**.
- **C** leads to **F**, which then goes to **H**.
- **D** leads to **G**, which then goes to **H**.
- **E** directly goes to **H**.
- **H** is the final activity and is dependent on **E**, **F**, and **G**.
### Critical Paths Highlighted:
**Critical Path 1: A → C → F → H (15 weeks)**
- A (6 weeks) → C (3 weeks) → F (1 week) → H (5 weeks)
**Critical Path 2: B → D → G → H (15 weeks)**
- B (4 weeks) → D (4 weeks) → G (2 weeks) → H (5 weeks)
### Final Diagram with Critical Paths:
In this diagram:
- The critical paths are highlighted showing the longest duration of the project.
- The project duration is 15 weeks based on these critical paths.
To determine the optimum duration according to Critical Path Method (CPM), we
need to:
1. List the activities with their durations.
2. Identify all possible paths from start to finish.
3. Calculate the duration of each path.
4. Identify the critical path, which is the longest path through the network.
Step 1: List the Activities
1. Activity 1-2: 8 days
2. Activity 1-4: 10 days
3. Activity 2-4: 5 days
4. Activity 2-3: 6 days
5. Activity 2-5: 8 days
6. Activity 5-6: 5 days
7. Activity 4-6: 12 days
Step 2: Identify All Paths
Let's find all possible paths from the start (node 1) to the end (node 6):
1. Path 1: 1 → 2 → 3
2. Path 2: 1 → 2 → 4 → 6
3. Path 3: 1 → 2 → 5 → 6
4. Path 4: 1 → 4 → 6
Step 3: Calculate Durations
1. Path 1: 1 → 2 → 3
• Duration: 1-2 (8 days) + 2-3 (6 days) = 14 days
2. Path 2: 1 → 2 → 4 → 6
• Duration: 1-2 (8 days) + 2-4 (5 days) + 4-6 (12 days) = 25 days
3. Path 3: 1 → 2 → 5 → 6
• Duration: 1-2 (8 days) + 2-5 (8 days) + 5-6 (5 days) = 21 days
4. Path 4: 1 → 4 → 6
• Duration: 1-4 (10 days) + 4-6 (12 days) = 22 days
Step 4: Identify the Critical Path
The critical path is the one with the longest duration:
• Path 1: 14 days
• Path 2: 25 days
• Path 3: 21 days
• Path 4: 22 days
The critical path is Path 2: 1 → 2 → 4 → 6 with a duration of 25 days.
Chart Representation
Here's a network diagram representing the activities and their durations:
Explanation of the Diagram
• 1 → 2 → 4 → 6 is highlighted as the critical path with the longest duration (25
days).
• Other paths are included to show alternative routes, but they have shorter
durations.
This diagram helps visualize the activities, their sequences, and the critical path in the
project.
To determine the critical path using PERT (Program Evaluation and Review Technique), we need
to follow these steps:
1. Calculate the expected time (TE) for each activity.
2. Calculate the variance for each activity.
3. Identify all possible paths from the start to the end.
4. Calculate the expected duration for each path.
5. Identify the critical path, which is the longest path in terms of expected duration.
6. Calculate the total variance for the critical path.
### Step 1: Calculate Expected Time (TE) and Variance
The formulas for expected time (TE) and variance (σ²) are:
\[ TE = \frac{t_o + 4t_m + t_p}{6} \]
\[ \sigma² = \left( \frac{t_p - t_o}{6} \right)^2 \]
Let's calculate these for each activity:
### Step 2: Identify All Paths
Let's identify all possible paths from the start (node 1) to the end (node 10):
1. 1 → 2 → 3 → 5 → 7 → 8 → 10
2. 1 → 2 → 3 → 5 → 7 → 9 → 10
3. 1 → 2 → 4 → 5 → 7 → 8 → 10
4. 1 → 2 → 4 → 5 → 7 → 9 → 10
5. 1 → 4 → 6 → 7 → 8 → 10
6. 1 → 4 → 6 → 7 → 9 → 10
### Step 3: Calculate Durations
1. **Path 1: 1 → 2 → 3 → 5 → 7 → 8 → 10**
- Duration: 2.25 + 2 + 4 + 5 + 6.17 + 2.33 = 21.75 days
- Variance: 0.444 + 0.111 + 0.111 + 0.111 + 0.25 + 0.111 = 1.138
2. **Path 2: 1 → 2 → 3 → 5 → 7 → 9 → 10**
- Duration: 2.25 + 2 + 4 + 5 + 2 + 5 = 20.25 days
- Variance: 0.444 + 0.111 + 0.111 + 0.111 + 0.111 + 0.444 = 1.332
3. **Path 3: 1 → 2 → 4 → 5 → 7 → 8 → 10**
- Duration: 2.25 + 3 + 3 + 5 + 6.17 + 2.33 = 21.75 days
- Variance: 0.444 + 0.444 + 0.111 + 0.111 + 0.25 + 0.111 = 1.471
4. **Path 4: 1 → 2 → 4 → 5 → 7 → 9 → 10**
- Duration: 2.25 + 3 + 3 + 5 + 2 + 5 = 20.25 days
- Variance: 0.444 + 0.444 + 0.111 + 0.111 + 0.111 + 0.444 = 1.665
5. **Path 5: 1 → 4 → 6 → 7 → 8 → 10**
- Duration: 3 + 5 + 4 + 6.17 + 2.33 = 20.5 days
- Variance: 0.111 + 0.444 + 0.444 + 0.25 + 0.111 = 1.36
6. **Path 6: 1 → 4 → 6 → 7 → 9 → 10**
- Duration: 3 + 5 + 4 + 2 + 5 = 19 days
- Variance: 0.111 + 0.444 + 0.444 + 0.111 + 0.444 = 1.554
### Step 4: Identify the Critical Path
The critical path is the one with the longest duration:
- Path 1: 21.75 days
- Path 2: 20.25 days
- Path 3: 21.75 days
- Path 4: 20.25 days
- Path 5: 20.5 days
- Path 6: 19 days
Paths 1 and 3 have the longest duration of **21.75 days**.
### Step 5: Total Variance for the Critical Path
Both Path 1 and Path 3 have similar durations, so let's calculate their variances:
- **Path 1: 1 → 2 → 3 → 5 → 7 → 8 → 10**
- Total Variance: 1.138
- **Path 3: 1 → 2 → 4 → 5 → 7 → 8 → 10**
- Total Variance: 1.471
### Conclusion
**Critical Paths:**
- Path 1: 1 → 2 → 3 → 5 → 7
