ADM vs.

PDM
1

Table 6.6 Differences between ADM and PDM Method

Item ADM PDM

ES D EF
A A
LS TF LF
Activity
ES: Early Start LS: Late Start
EF: Early Finish LF: Late Finish
D : Duration TF: Total Float

A ES D EF 1 ES D EF
ES EF
1 2 A B
LS LF
Event LS TF LF LS TF LF

Chapter 6 - Project Planning and Scheduling

 ADM vs. PDM
2

ADM PDM

Early Start (ES) is the earliest possible time an activity can start based on the
logic & durations identified on the network.
Late Start (LS) is the latest possible time an activity can start without extending
the completing date of the project.
Early Finish (EF) is the earliest possible time an activity can finish if it is start on Early
Start Time (ES) and finish within the planned duration.

Late Finish (LF) is the latest possible time an activity can finish without extending
the completion date of the project.
Total Float (TF) is the maximum amount of time that the activity can be
delayed without extending the completion time of the overall project.
Chapter 6 - Project Planning and Scheduling
 ADM vs. PDM
3
Table 6.6 Differences between ADM and PDM Method
ADM
-A and B are activities. 1, 2 and 3 are events
-Activity A has ID or label 1-2 ; Activity B has ID or label 2-3
- Activity A precedes activity B

A B
1 2 3

PDM
Activity Nodes

ES D EF ES D EF ES D EF
1 2
A B B
LS TF LF LS TF LF LS TF LF
Predecessor Current Successor
Activity Activity Activity

Chapter 6 - Project Planning and Scheduling

 ADM vs. PDM
4

Table 6.6 Differences between ADM and PDM Method (cont.)

Item ADM PDM

Definition
Activity which has not Dummy activity is not used
Dummy duration. It is only in Precedence Diagram
Activity used to show any Method (PDM)
relationship between
activities.
D Function
• If there is a situation
or where one event is used
to show relationship
more than one activity.
• To show a complicated
relationship clearly

Chapter 6 - Project Planning and Scheduling

 ADM vs. PDM
5
Table 6.6 Differences between ADM and PDM Method (cont.)
Item ADM
Activity A & B have the same ID ID for Activity A & B are not same.
A: 1-2 A: 1-2
B: 1-2 B: 1-3
False True
A A
Dummy 1 2
1 2
Activity B
3
B
D If C is to follow A & B, but D If C is to follow A & B, but D
is to follow only B. is to follow only B.
(not fulfill) (use dummy)
or
A C A C

B D B D

Chapter 6 - Project Planning and Scheduling

 ADM vs. PDM
6
Table 6.6 Differences between ADM and PDM Method (cont.)
Item ADM
If P, Q and R follow A, and B follows P, Q and R. The following diagram is not the correct
representation of the same.
P
False
A Q B
Dummy 1 2 3 4
Activity R
Reason: Activities P, Q and R have the same ID (2-3).
D True
P 5
or
A Q B
1 2 3 4

R 6
Activities P has the ID (2-5), Q (2-3) and R (2-6).
Chapter 6 - Project Planning and Scheduling
 ADM vs. PDM
7
Table 6.6 Differences between ADM and PDM Method (cont.)
Item ADM
1. D is preceded by A only
2. E is preceded by A and B
3. F is preceded by B and C

Dummy False True

Activity
A D A D
D

or B E B E

C F C F
Statement 3 not fulfill where
F is preceded by A, B and C.

Chapter 6 - Project Planning and Scheduling

 ADM vs. PDM
8

Table 6.6 Differences between ADM and PDM Method (cont.)

Item ADM PDM

F – S
F – F
Relationship F - S S
S
–
-
S
F

- Critical Path
: A path consist of few activities which will determine the overall
project duration.
1. ESX = LSX, or
Critical path 2. LFX = EFX, or
3. Total Float (TF) = 0
- Possible to have more than one critical path
- Activities which lay on critical path cannot suffer any delay

Chapter 6 - Project Planning and Scheduling

 ADM vs. PDM
9

Table 6.6 Differences between ADM and PDM Method (cont.)

Item ADM PDM

- Total float
: The maximum amount of time that the activity can be delayed
without extending the completion time of the overall
Total float project.
1. TF = LF – D – ES, or
2. TF = LS – ES , or
3. TF = LF – EF

- FORWARD PASS
: To establish the earliest expected start and finish times
for each activity in the network.
Estimating duration - BACKWARD PASS
duration : To establish the latest allowable start and finish times
for each activity in the network.

Chapter 6 - Project Planning and Scheduling

 Example 1 - Dummy 10

AKTIVITY PREDECESSOR
A -
B A
C A
D B,C

Chapter 6 - Project Planning and Scheduling

 Example 1- Dummy 11

AKTIVITY PREDECESSOR

A -
B A
C A
D B,C
B

1 A 2 3 D 4

FALSE: Activity B and C have the same ID

Chapter 6 - Project Planning and Scheduling

 Example 1-Dummy 12

AKTIVITY PREDECESSOR

A -
B A
C A
D B,C

SOLUTION:
5
B
dummy

1 A 3 2 D 4

Chapter 6 - Project Planning and Scheduling

 Example 1 - Dummy 13

SOLUTION: (Change the note numbers)

3
B
dummy

1 A 2 4 D 5

Chapter 6 - Project Planning and Scheduling

 Example 1 - Dummy 14

*** Other solution

3
dummy
B

1 A 2 4 D 5

Chapter 6 - Project Planning and Scheduling

 Example 1 - Dummy 15

*** Other solution

1 A 2 4 D 5

3 dummy
C

Chapter 6 - Project Planning and Scheduling

 Example 1 - Dummy 16

*** Other solution

1 A 2 4 D 5

3
dummy C

Chapter 6 - Project Planning and Scheduling

 Example 2 17

AKTIVITY PREDECESSOR
A -
B A
C A
D B
E B,C

Chapter 6 - Project Planning and Scheduling

Example 2 18

AKTIVITY PREDECESSOR
A -
B A
C A
D B
E B,C
B D

1 A 2 3 4

C E

FALSE: - Activity B and C have the same ID

- Activity D and E have the same ID
- D is precedes by B & C

Chapter 6 - Project Planning and Scheduling

Example 2 19

AKTIVITY PREDECESSOR
A -
B A
C A
D B
B 3 D
E B,C

1 A 2 5

C 4 E

FALSE: - E is precedes by C only.

Chapter 6 - Project Planning and Scheduling

 Example 2 20

AKTIVITY PREDECESSOR
A -
B A
C A
D B
E B,C
B 3 D
SOLUTION:

1 A 2 5
dummy

C 4 E

Chapter 6 - Project Planning and Scheduling

 Example 3 21

AKTIVITY PREDECESSOR
A -
B -
C -
D A,B
E B,C

Chapter 6 - Project Planning and Scheduling

 Example 3 22
AKTIVITY PREDECESSOR
A -
B -
C -
D A,B
E B,C

A 3
D
dummy 1

1 B 2 5
dummy 2
E
C 4

Chapter 6 - Project Planning and Scheduling