Example1

Precedence Diagramming Method

Problem Data:
Consider a project composed of 6 tasks to be scheduled :
Example1
Levels of Anteriority of tasks:

Anteriority Method rules:

Tasks must be classified into anteriority levels
based on given data, such that:
 Level 1 contains all tasks without
predecessors Anteriority Method:
 Level k contains all tasks whose all 1. Tasks whose predecessors are in { }:
predecessors are present in previous C  Level 1
levels (1, ..., k-1) 2. Tasks whose predecessors are in { C }:
A, B  Level 2
3. Tasks whose predecessors are in { C, A, B }:
D, F  Level 3
4. Task whose predecessors are in {C, A, B, D, F} :
E  Level 4

•The critical path is the longest path through the network.

 Example1

Project Schedule Network Diagrams

How to Find the Critical Path

To find the critical path, we need to determine the following quantities for each
activity in the network.
1. Earliest start time (ES ): the earliest time an activity can begin without violation
of immediate predecessor requirements.
2. Earliest finish time (EF ): the earliest time at which an activity can end.
3. Latest start time (LS ): the latest time an activity can begin without delaying the
entire project.
4. Latest finish time (LF ): the latest time an activity can end without delaying the
entire project.
How to Find the Critical Path
In the nodes, the activity time and the early and late start
and finish times are represented in the following manner.

ACTIVITY t
ES EF
LS LF

Earliest times are computed as:

Earliest finish time = Earliest start time
+ Expected activity time
EF = ES + t

Earliest start = Largest of the earliest finish times of

immediate predecessors
ES = Largest EF of immediate predecessors
 Activity Times
Time estimates (weeks) for General Foundry

EXPECTED
MOST TIME,
PROBABLE, PESSIMISTIC, t = [(a + 4m + VARIANCE,
ACTIVITY OPTIMISTIC, a m b b)/6] [(b – a)/6]2
A 1 2 3 2 4/36
B 2 3 4 3 4/36
C 1 2 3 2 4/36
Expected Time
D 2 4 6 4 16/36
E 1 4 7 4 36/36 t = [(a + 4m + b)/6]
F 1 2 9 3 64/36
G 3 4 11 5 64/36
Variance
H 1 2 3 2 4/36
25 [(b – a)/6]2
How to Find the Critical Path
The critical path is the longest path through the network.
General Foundry’s Network With Expected Activity Times
Example3. Draw the logic network
and perform the CPM calculations
for the schedule shown next.
Example 2 Draw the node diagram and
perform the CPM computations
 Example 4

Draw the AON network for this project.

What is the Critical Path and Project Duration?
Example 4 - Solution
Problem 4 - Critical Path and
Project Duration
Problem 5

What is the probability of

completing the project in 23
weeks?
Solved Problem 5
Solved Problem 5

Using the Normal Distribution, we find that the

probability of completing the project in 23 weeks or less
is 0.9357.
Problem 6 – Consider the following project network.

D
2

B E G
4 1 3

Start A F H J Finish
2 8 5 7

C I
5 4

Determine the critical path and the project duration.

18
Example on the name of activity
https://www.youtube.com/watch?v=p_KApjpyBHE&feature=emb_logo&ab_channel=JoshuaEm
manuel

NORMSINV(.95)