0% found this document useful (0 votes)
195 views27 pages

Lec-4 PDM PDF

The document discusses precedence diagramming method (PDM), a scheduling technique used in projects that uses activity-on-node (AoN) notation and four logical relationships between activities. PDM allows for modeling of activity overlaps, repetitive activities, lags and leads between activities, and concurrent activities. Examples are provided to illustrate how PDM can be used to model project schedules and determine the critical path.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
195 views27 pages

Lec-4 PDM PDF

The document discusses precedence diagramming method (PDM), a scheduling technique used in projects that uses activity-on-node (AoN) notation and four logical relationships between activities. PDM allows for modeling of activity overlaps, repetitive activities, lags and leads between activities, and concurrent activities. Examples are provided to illustrate how PDM can be used to model project schedules and determine the critical path.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 27

1

Scheduling Techniques in Projects

Lecture-4 Precedence
Diagramming Method

Dr. J. Uma Maheswari


Associate Professor
Department of Civil Engineering
umapaul@civil.iitd.ac.in
2

Lecture-4 PDM
1. Introduction

2. Analysis - Contiguous activity execution

3. Analysis - Interruptible activity execution


3

Precedence Diagraming Method


 Like CPM, PDM is widely used in the construction
industry
 Uses AoN notation
 Four Logical relationships
– FS (Finish-to-Start) relationship is the most frequently used
logical relationship
– SS (Start-to-Start) and FF (Finish-to-Finish) are used to
specify full or partial concurrency of tasks
– SF (Start-to-Finish) is very rarely used in networks

A B A A
A B

A B B
A
B A B A B
B
4

Precedence Diagraming Method


 Lead & lag A
– Lag is a condition of waiting for a prescribed period 10
before action can start
– Negative lag is lead 5
 Multiple Arrows & Double headed arrows - not B
used 8
 Concurrency
– Completely concurrency
– Absolute complete concurrency (identical & no lags
or leads)

A A A
12 5 7 A B
7 6
B B B
7 6 No loops are
5
allowed in PDM
5

Purpose of PDM - Overlaps

A A

B B
Independent Dependent

A A

Semi-independent B
B
SS + lag FF + lead
6

Case Example 1
No Activity Activity Duration IPA
ID (days)
2 Brickwork –T1 B1 90
3 Joinery Works – T1 J1 75 B1FS
4 Flooring Works – T1 F1 90 J1FS
5 Painting Works – T1 P1 80 F1FS
6 Brickwork –T2 B2 90 B1FS
7 Joinery Works – T2 J2 75 J1FS, B2FS
8 Flooring Works – T2 F2 90 F1FS, J2FS
9 Painting Works – T2 P2 80 F2FS, P1FS
7

Purpose of PDM – Repetitive activities


B1 J1 F1 P1
90 75 90 80

B1 J1 F1 P1
90 75 90 80

Percent Complete Approach


90
0.4
B J A B
180 150 10 7
75
0.1
A B
2 10
8

Case Example 2 – Laboratory


Activity ID Activity Duration (days) IPA
A Internal Wiring 2 --
B Furniture – Cupboards 10 A
C Flooring 7 B
D False Ceiling 7 B
E POP and painting 4 C, D
F Furniture Procurement – Tables and chairs 15 E(FF)
G Furniture Installation – Tables and chairs 1 F, J
H Hardware Procurement – PCs, Printers, etc. 45 E(FF)
I Software Procurement – Research related 45 --
J Electrical fixtures – Lights, fans, ACs, etc. 2 E
K Hardware Installation 3 G, H
L Network Connection 1 K(FF)
M Software Installation 2 I, K, L
N CCTVs and Biometrics installation 1 M
O Firefighting systems 1 E
9

PDM Network
ID IPA
A --
B A
C B
D B
I
E C, D
A F E(FF)
H K M N G F, J
H E(FF)
I --
B C E J L
J E
K G, H
D
F G L K(FF)
M I, K, L
N M
O O E
10

Example 3 PDM
Activity Duration IPA Relationship
A 20 -- --
B 15 A
C 10 A SS+2
D 7 A FF+2
C
E 9 D FS+5
F 6 E FS-10
G 4 B
E FS+2
F FF+4
Act Dur IPA 11
A 20 -- --
Example 3 PDM Network B 15 A
C 10 A SS+2
D 7 A FF+2
C
E 9 D FS+5
B
F 6 E FS-10
G 4 B
15 E FS+2
F FF+4
A E G
2

20 9 4
2 5 -10 4
2

C D F

10 7 6
12

PDM – Contiguous Activities


Forward Pass
20 B 35

15

0 A 20 27 E 36 38 G 42
2

20 2 9 4
2 -10
4
2 C 12 15 D 22 26 F 34
5

10 7 8
13

PDM – Contiguous Activities


Backward Pass
20 B 35

23 15 38

0 A 20 27 E 36 38 G 42
2

0 20 20 2 27 9 36 38 4 42
2 -10
4
2 C 12 15 D 22 26 F 34
5

5 10 15 15 7 22 30 8 38
14

PDM – Contiguous Activities


Total Float (TF)
20 B 35
3
23 15 38

0 A 20 27 E 36 38 G 42
2
0 0 0
0 20 20 2 27 9 36 38 4 42
2 -10
4
2 C 12 15 D 22 26 F 34
5
3 0 4
5 10 15 15 7 22 30 8 38
15

PDM – Contiguous Activities


Critical Path
20 B 35
3
23 15 38

0 A 20 27 E 36 38 G 42
2
0 0 0
0 20 20 2 27 9 36 38 4 42
2 -10
4
2 C 12 15 D 22 26 F 34
5
3 0 4
5 10 15 15 7 22 30 8 38
16

Caution with PDM


 Normal Critical
– This refers to an activity for which the project duration shifts in
the same direction as the shift in the duration of the activity
 Reverse Critical
– This refers to an activity for which the project duration shifts in
the reverse direction to the shift in the duration of the activity
17

Interruptible activities - critical path


 Forward & backward pass

 Task start float (SF) = LS – ES


– The starting of a task may be critical even though the task
itself is not critical
 Task finish float (FF) = LF – EF
– The completion of a task may be critical even when the task
itself is not critical
 Task total float (TF) = LF – ES – dur
– A task that has zero total float is a critical task

 Relationship float (RF)


– FS: LS(j) – EF(i) – lag
– SS: LS(j) – ES(i) – lag
– FF: LF(j) – EF(i) – lag
– SF: LF(j) – ES(i) – lag
18

PDM Representation
Lead
ES Act. EF or
RF Lag
SF TF FF

LS Dur. LF

RF (Relationship Float)
Task Float
FS = LSj - EFi - lag
SF (Start Float) = LS - ES

SS = LSj - ESi - lag


FF (Finish Float) = LF - EF

FF = LFj - EFi - lag


TF (Total Float) = LF - ES - Duration

SF = LFj - ESi - lag


Act Dur IPA 19
A 20 -- --
Example 3 PDM Network B 15 A
C 10 A SS+2
D 7 A FF+2
C
E 9 D FS+5
B
F 6 E FS-10
G 4 B
15 E FS+2
F FF+4
A E G
2

20 2 9 4
2 -10
4
C D F
5

10 7 6
20

PDM – Interruptible Activities


Forward Pass
20 B 35

15

0 A 20 27 E 36 38 G 42
2

20 2 9 4
2 -10
4
2 C 12 12 D 22 26 F 34
5

10 7 8
21

PDM – Interruptible Activities


Backward Pass
20 B 35

23 15 38

0 A 20 27 E 36 38 G 42
2

20 20 20 2 27 9 36 38 4 42
2 -10
4
2 C 12 12 D 22 26 F 34
5

5 10 15 15 7 22 30 8 38
22

PDM – Interruptible Activities


Task Start Float (SF) = LS-ES
20 B 35
3
23 15 38

0 A 20 27 E 36 38 G 42
2
0 0 0
20 20 20 2 27 9 36 38 4 42
2 -10
4
2 C 12 12 D 22 26 F 34
5
3 3 4
5 10 15 15 7 22 30 8 38
23

PDM – Interruptible Activities


Task Finish Float (FF) = LF-EF
20 B 35
3 3
23 15 38

0 A 20 27 E 36 38 G 42
2
0 0 0 0 0 0
20 20 20 2 27 9 36 38 4 42
2 -10
4
2 C 12 12 D 22 26 F 34
5
3 3 3 0 4 4
5 10 15 15 7 22 30 8 38
24

PDM – Interruptible Activities


Task Total Float (TF) = LF-ES-dur
20 B 35
3 3 3
23 15 38

0 A 20 27 E 36 38 G 42
2
0 0 0 0 0 0 0 0 0
20 20 20 2 27 9 36 38 4 42
2 -10
4
2 C 12 12 D 22 26 F 34
5
3 3 3 3 3 0 4 4 4
5 10 15 15 7 22 30 8 38
25

PDM – Interruptible Activities


FS = LSj - EFi - lag
Relationship Float
SS = LSj - ESi - lag
20 B 35 FF = LFj - EFi - lag
3 3 3
SF = LFj - ESi - lag
23 15 38 3
3
0 A 20 27 E 36 38 G 42
2
0 0 0 0 0 0 0 0 0
0
20 20 20 27 9 36 38 4 42
3 2 0 2 -10
4 4 4
0
2 C 12 12 D 22 26 F 34
5
3 3 3 3 3 0 4 4 4
3
5 10 15 15 7 22 30 8 38
26

PDM – Interruptible Activities


Critical Path
20 B 35
3 3 3
23 15 38 3
3
0 A 20 27 E 36 38 G 42
2
0 0 0 0 0 0 0 0 0
0
20 20 20 0 27 9 36 38 4 42
3 2
2 4
-10 4
0 4
2 C 12 12 D 22 26 F 34
3 5
3 3 3 3 3 0 4 4 4
5 10 15 15 7 22 30 8 38
27

Float calculations
 SRF Start-restricted float
– Amount of time we can delay the rest of the work in the activity, after
it has started on its critical start date, without delaying the entire
project
 FRF Finish-restricted float
– Amount of time we can delay the start of work on the activity, or the
rest of it has started, then finish on time without delaying the entire
project
 DRF Double-restricted float
– Amount of time we have to delay the rest of the work in the activity
after it has started, then finish on time without delaying the entire
project
 URF Unrestricted float
– Amount of time we can delay all or part of the activity without
delaying the entire project

 Single Restricted Float


– Start-restricted float and Finish-restricted float

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy