Draw the PERT network associated with the following project: Activity Immediate Predecessor(s) A B C D E F G H A A B B C D E, F
Draw the PERT network associated with the following project: Activity Immediate Predecessor(s) A B C D E F G H A A B B C D E, F
A First Course in Probability (10th Edition)
10th Edition
ISBN:9780134753119
Author:Sheldon Ross
Publisher:Sheldon Ross
Chapter1: Combinatorial Analysis
Section: Chapter Questions
Problem 1.1P: a. How many different 7-place license plates are possible if the first 2 places are for letters and...
Related questions
Question

Transcribed Image Text:### Activity Network for Project Management
### Construction of PERT Network:
To effectively manage a project and understand the sequence of activities and their dependencies, a Program Evaluation Review Technique (PERT) network is essential. Below is the list of activities and their immediate predecessors, which form the foundation for drawing the PERT network.
#### Activity and Immediate Predecessor(s):
```
| Activity | Immediate Predecessor(s) |
|----------|--------------------------|
| A | - |
| B | A |
| C | A |
| D | B |
| E | B |
| F | C |
| G | D |
| H | E, F |
```
### Explanation:
1. **Activity A** has no immediate predecessors, meaning it is the starting point of the project.
2. **Activity B** can only start after Activity A is completed.
3. **Activity C** also depends on the completion of Activity A.
4. **Activity D** requires Activity B to be finished before it can be initiated.
5. **Activity E** like Activity D, depends on the completion of Activity B.
6. **Activity F** can only start after Activity C is completed.
7. **Activity G** requires Activity D to be completed.
8. **Activity H** can only start after both Activities E and F are completed.
### How to Draw the PERT Network:
1. **Start Node**: Begin with the initiation node representing the start of Activity A.
2. **Nodes and Arrows**:
- Draw an arrow from the start node to a node representing Activity A.
- From Activity A, draw arrows leading to two separate nodes: B and C.
- From B, draw arrows leading to two separate nodes: D and E.
- From C, draw an arrow leading to a node for Activity F.
- From D, draw an arrow leading to a node for Activity G.
- Finally, draw arrows from both E and F, leading to a final node representing Activity H.
3. **End Node**: Mark the end node after Activity H completion.
The resulting diagram should visually encapsulate the dependencies as listed and allow one to visually sequence and plan the project efficiently.
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 1 images

Recommended textbooks for you

A First Course in Probability (10th Edition)
Probability
ISBN:
9780134753119
Author:
Sheldon Ross
Publisher:
PEARSON


A First Course in Probability (10th Edition)
Probability
ISBN:
9780134753119
Author:
Sheldon Ross
Publisher:
PEARSON
