PDM 2
PDM 2
PDM 2
PROJECT
MANAGEMENT
PLANNING, SCHEDULING,
CONTROLLING
PCA,
TRANSPORTATION SPECIALIST Pambansang
Treyner ng
ENGR. GREGORIO C.
YEE
2
PROJECT CYCLE
Can be defined as a series of related tasks directed toward a major output.
5
PROJECT PLANNING
CONTROLLING THE
PROJECT
6
PROJECT
CONTROLLING
Involves close monitoring of resources, costs, quality & budgets.
• Project completion
• Critical tasks
• Noncritical tasks
• Probable completion date
• Is the project on schedule, behind schedule, or ahead of schedule?
• Is the money spent equal to, less than, or greater than the budgeted
amount?
• Available resources
• If the project is to be finished in a shorter amount of time, what is the best
way to accomplish this goal at the least cost?
7
TOOLS
It also means using a feedback loop, ex:
• Primavera
• MacProject
• Pertmaster
• VisiSchedule
• Time Line
• Microsoft.
3
SCHEDULING THE
PROJECT
8
PROJECT
SCHEDULING
Involves sequencing and allotting time to all project activities.
WORK BREAKDOWN
STRUCTURE (WBS)
Division of a project activity into subcomponents
10
PRECEDENCE
DIAGRAM
METHOD
THE FRAMEWORK
* CPM *
13
* PERT *
Program Evaluation and Review Technique
or
Project Evaluation and Review Technique
14
HISTORICAL DEVELOPMENT
15
* HISTORICAL DEVELOPMENT *
PERT
Program Evaluation and Review
Technique
or
Project Evaluation and Review
Technique
16
* PERT *
17
* PERT/CPM REQUIREMENTS *
RA 9184 – “The program of work shall include,
among other things, estimates of
the work items, estimates,
quantities, cost and a prepared
construction schedule and
estimated cash flow for project
schedule over six months.
[(Annex “A” # 3 - (i)]
18
Annex “A” # 3L – Bidding does needs
PERT/CPM
19
ANNEX E 9.2
22
* DIFFERENCES *
23
* DEFINITIONS AND SYMBOLS *
NETWORK is a project plan in a graphic form.
It consist principally of :
EVENTS
ACTIVITIES
NUMBERS OF ARROWS
NODES
24
* EVENTS *
Are points in time representing start or
completion of a particular activities.
25
* ACTIVITIES *
Occur through time and represent the things that
must happen in order to undertake a piece of work.
A) they occupy time and may have cost
B) activities are represented by arrows
DUMMY ACTIVITES
are dotted arrows which solely indicates logical
relationships and interdependence between
different event
maybe used in the network to distinguished
between two or more-parallel activities.
26
DEFINITION AND SYMBOL
LATE START (LS) is the latest allowable point
in time that any event can occur and still be on
schedule for the completion of a project.
27
LET Latest Event Time is the latest time that
event may occur without delaying project
completion.
28
DEFINITION AND SYMBOLS
29
DEFINITION AND SYMBOLS
MERGE POINT is where a point more than one
activity terminate in a common event.
30
11
ACTIVITY SEQUENCING
• Project Scope Statement
• Activity List
• Activity Attributes
INPUTS
• Milestones List
• Approved Change
Request
• Precedence Diagramming
Method (PDM)
• Arrow Diagramming
TOOLS & Method (ADM)
TECHNIQUES
• Schedule Network
Templates
• Dependency Determination
• Applying Leads and Lags
12
ADVANTAGES OF PDM
1. More flexible
2. Allows overlapping of concurrent activity
3. Almost all management system are based on PDM
4. Show the relationship among the activities
5. The PDM network aids to plan, schedule, monitor and
control the project
6. Critical tasks, noncritical tasks and slack time
7. Shows the relationship of the tasks to each other
8. Allows for what-if, worst-case, best-case and most likely
scenario
13
WHY DO WE NEED TO
LEARN PDM?
1. Available on almost all commercial microcomputer-base
on PMS.
2. Around 30% of contracting organization in Europe are
using PDM
3. This technique is more versatile as compared to the
other network planning.
4. Availability of lag has made this technique more
adaptable to the planner’s needs.
5. This tool can guide managers in making critical
decisions such as to deploy resources based on priority.
6. Can assist the client in determining the duration for
extension of time.
14
Fewer Activities
Complicates Manual
No Restraints Calculations
LOGICAL
RELATIONSHIP
Types of • Finish to Start
• Start to Finish
• (defined relationship • Start to Start
between the start of
one activity & end
dates of a successor
SF SS • (defined relationship
between start of
activities)
activity (rarely used))
• Finish to Finish
• (defined relationship
between the end
dates of activities)
FF
16
LOGICAL
RELATIONSHIP
Start to Start
Activity A
SS
Activity B
Example
start Erect Studs
start
Place Walling
LOGICAL
RELATIONSHIP
Finish to Start
F S
Activity A Activity B
Example
start Erect Studs finish
LOGICAL
RELATIONSHIP
Fnish to Fnish
Activity A
FF
Activity B
Example
finish
start
LOGICAL
RELATIONSHIP
Start to Finish
SF
Activity A Activity B
Example
THE BOX?
1. ES
2. EF Item #
3. LS ES EF
4. LF LS LF
5. Duration Duration Float
6. Float or Slack
7. Act. # or Description
(Item # - Blue Book)
21
Forward Pass = A process that identifies all the earliest
time
Earliest Start Time Rule – Before an activity can start, all its immediate
predecessors must be finished:
• If an activity has only a single immediate predecessor, its ES equals
the EF of the predecessor
• If an activity has multiple immediate predecessors, its ES is the
maximum of all EF values of its predecessors. That is,
• ES = max { EF of all immediate predecessors }
Earliest Finish Rule – The earliest finish time of an activity is the sum
of its earliest start time and its activity time. That is,
• EF = ES + Activity time
Latest Finish Time Rule – This rule is again based on the fact that
before an activity can start, all its immediate predecessors must be
finished:
• If an activity is an immediate predecessor for just a single activity, its
LF equals the LS of the activity that immediately follows it.
• If an activity is an immediate predecessor to more than one activity,
its LF is the minimum of all LS values of all activities that immediately
follows it. That is,
• LF = min { LS of all immediate following activities }
Latest Start Time Rule – The latest start time of an activity is the
difference of its latest finish time and its activity time. That is,
• LS = LF – Activity time
PDM: PRECEDENCE DIAGRAM 22
METHOD
A C F Fig. 1
2 2 3
S
T E H E
A N
R 0 4 02 D
T
B 03 D 04 G 05
25
LETS SOLVE THE ES AND EF
ES = EF max { of the immediate predecessor activity }
EF = ES + Activity time
A 0 2 C 2 4 F 4 7 Fig. 2
2 2 3
S
T 0 0 E 4 8 H 13 15 E
A N
R 0 4 2 D
T
0 3 3 7 8 13
ES EF B 3 D 4 G 5
LS LF
Duration Float
26
LETS SOLVE THE ES AND EF
A 2 A 2 A 2 B 3
C 2 D 4 C 2 D 4
F 3 G 5 E 4 G 5
H 2 H 2 G 5 H 2
H 2
9 13 15 14
27
LETS SOLVE THE LS AND LF
S
T 0 0 E 4 8 H 13 15 E
A 0 0 4 8 13 15 N
R 0 4 2 D
T
0 3 3 7 8 13
1 4 4 8 8 13
B 3 D 4 C 5
28
LETS SOLVE THE SLACK TIME
Slack time = (free time) = the length of time an activity can be delayed without
delaying the entire project
ES EF
LS LF
LS - ES A 0 2 C 2 4 F 4 7 Fig.5
LFDuration
- EF Float 0 2 2 4 10 13
2 0 2 0 3 6
S
T 0 0 E 4 8 H 13 15
A 0 0 4 8 13 15
R 0 0 4 0 2 0
T
0 3 3 7 8 13
1 4 4 8 8 13
B 3 1 D 4 1 C 5 0
CRITICAL PATH
ES EF
LS LF
Duration Float
LS - ES A 0 2 C 2 4 F 4 7 Fig.5
LF - EF 0 2 2 4 10 13
2 0 2 0 3 6
S
T 0 0 E 4 8 H 13 15
A 0 0 4 8 13 15
R 0 0 4 0 2 0
T
0 3 3 7 8 13
1 4 4 8 8 13
B 3 1 D 4 1 C 5 0
30
A 2 0 2 0 2 0 Yes
B 3 0 3 1 4 1 No
C 2 2 4 2 4 0 Yes
D 4 3 7 4 8 1 No
E 4 4 8 4 8 0 Yes
F 3 4 7 10 13 6 No
G 5 8 13 8 13 0 Yes
H 2 13 13 13 15 0 Yes
31
• Most likely time (m) = most realistic estimate of the time required
to complete an activity.
32
THREE TIME ESTIMATES IN
PERT
To find the expected activity time, t, the beta distribution weights the
three time estimates as follows:
𝑎 + 4𝑚 + 𝑏
𝑡=
6
To compute the dispersion or variance of activity completion time, we
use the formula:
2
𝑏−𝑎
𝑉𝑎𝑟𝑖𝑎𝑛𝑐𝑒 =
6
33
THREE TIME ESTIMATES IN
PERT
MOST
OPTIMISTIC PESSIMISTIC EXPECTED
ACTIVITY LIKELY TIME VARIANCE
(a) TIME (b) TIME (t)
(m)
A 1 2 3 2 0.11
B 2 3 4 3 0.11
C 1 2 3 2 0.11
D 2 4 6 4 0.44
E 1 4 7 4 1.00
F 1 2 9 3 1.78
G 3 4 11 5 1.78
H 1 2 3 2 0.11
𝑎 + 4𝑚 + 𝑏 1 + 4 2 + 9 18
𝑡= = =
6 6 𝟔
2 2 2
= 3 𝑤𝑒𝑒𝑘𝑠 𝑏 − 𝑎 9−1 8 64
𝑉𝑎𝑟𝑖𝑎𝑛𝑐𝑒 = = = =
6 6 6 36
= 1.78
PROBABILITY OF PROJECT 34
COMPLETION
We know that the project completion time is 15 weeks. However when there are
variation then there is also a significant variation in the duration. Hence, the
activity along the critical path will be affected. Therefore, project variance is
computed by summing the variances of critical activities.
𝜎𝑝2 = 𝑃𝑟𝑜𝑗𝑒𝑐𝑡 𝑉𝑎𝑟𝑖𝑎𝑛𝑐𝑒 = 𝑣𝑎𝑟𝑖𝑎𝑛𝑐𝑒𝑠 𝑜𝑓 𝑎𝑐𝑡𝑖𝑣𝑖𝑡𝑖𝑒𝑠 𝑜𝑛 𝑐𝑟𝑖𝑡𝑖𝑐𝑎𝑙 𝑝𝑎𝑡ℎ
ANSWER: 87.20%
37
HOW ABOUT IF WE ARE ASK WHAT IS THE
DEADLINE THAT A 99% CHANGE OF
COMPLETING THE PROJECT
WE NEED A Z VALUE = TO 99%. IN THE NORMAL TABLE WE
FIND Z VALUE=2.33 BEING CLOSEST THE PROBABILITY OF
99%. HENCE OUR DUE DATE IS 2.33 SD ABOVE THE MEAN.
𝐷𝑢𝑒 𝑑𝑎𝑡𝑒 = 𝐸𝑥𝑝𝑒𝑐𝑡𝑒𝑑 𝑐𝑜𝑚𝑝𝑙𝑒𝑡𝑖𝑜𝑛 𝑡𝑖𝑚𝑒 + 𝑍 × 𝜎𝑝 = 15 + 2.33 × 1.76 = 19.1 𝑤𝑒𝑒𝑘𝑠
1. Compute the crash cost per week. If crash costs are linear over time, the following
formula can be used:
𝐶𝑟𝑎𝑠ℎ 𝑐𝑜𝑠𝑡 − 𝑁𝑜𝑟𝑚𝑎𝑙 𝑐𝑜𝑠𝑡
𝐶𝑟𝑎𝑠ℎ 𝑐𝑜𝑠𝑡 𝑝𝑒𝑟 𝑝𝑒𝑟𝑖𝑜𝑑 =
𝑁𝑜𝑟𝑚𝑎𝑙 𝑙𝑖𝑛𝑒 − 𝐶𝑟𝑎𝑠ℎ 𝑡𝑖𝑚𝑒
2. Identify the critical activities.
3. If there is only one critical path, then select the activity on this critical path that (a)
can still be crashed and (b) has the smallest crash per period.
If there is more than one critical path, then select one activity from each critical
path such that (a) each selected activity can still be crashed and (b) the total crash
cost per period of all selected activities is the smallest. Crash each activity by one
period.
4. Update all activity times. If desired due date has been reached, stop. If not, return to
Step 2.
COST-TIME TRADE-OFFS AND 39
PROJECT CRASHING
Crash
34,000 = 34,000 - 30,000
3-1
33,000
= 4,000
32,000 2 weeks
31,000 = 2,000/week
Normal
30,000
1 2 3 Time (weeks)
S-CURVE &
CASH FLOW
STATEMENT
OVERHEAD CASH FLOW
24,000 = 4,800/month
5
Recalculating for the balance of indirect cost
CASH FLOW:
Cash beginning P 360,000 1 P 73,500 (P 65,500) (P 67,900) P 5,100 P 120,000
Progress Pay- - 216,000 216,000 216,000 216,000 216,000
ments
A Total Inflow P 360,000 1 P 289,500 P 150,500 P 148,100 P 221,100 P 336,000
BALANCE
CASH OUTFLOW: SHEET:
71.7
72%
60 EXPENSE
53.5
CURVE 54%
40
23.9 INCOME
36% PROFILE
20
18%
0 1 2 3 4 5 6
S-CURVE AND INCOME PROFILE
Computation of Coordinates
B(5)
E(8)
P 170,000
P 96,000
2 4
2
1 2 3 4 5 6 7 8
B A C D E F
X1 = 0 x 100 = 0 X6 = 5 + 7 + 4 + 7 + 8 + 3 = 80.90
0 42
B A B A C D E F+G
X2 = 5 + 5 = 23.80 X7 = 5 + 7 + 4 + 7 + 8 + 5 + 2 = 90.50
42 42
B A E B A C D E F+G
X8 = 5 + 7 + 4 + 7 + 8 + 5 + 6 = 100
X3 = 5 + 7 + 2 = 33.33 42
42
B A C D E
X4 = 5 + 7 + 4 + 4 + 6 = 61.90
42
The sum of cost accumulated
B A C D E F
Yn = ∑ACn x 100 Y6 = 170 + 175 + 120 + 315 + 96 + 108 = 82%
TPC 1.20m
% of cost incurred as of pt.N
B A C D E F G
Y1 = 0 x 100 = 0 Y7 = 170 + 175 + 120 + 315 + 96 + 180 + 48
1.20m 1.20m
B A
Y2 = 170,000 + 125,000 = 24.60% = 92%
1.20m
B A E Y8 = 100%
Y3 = 170 + 175 + 24 = 30.80%
1.20m
B A C D E
Y4 = 170 + 175 + 120 + 180 + 72 = 59.80%
1.20m
B A C D E F
Y5 = 170 + 175 + 120 + 270 + 96 + 72 = 75.25%
1.20m
Total Outflow
100
80
Percent Expenditures
Cost Overrun
60
Actual S-Curve
40
Cut-off Period
20 Cost Underrun
0 20 40 60 80 100
PLANNED VS. ACTUAL S-CURVE
Updating the S-Curve maybe cause any
of the following:
Original Curve
100 WORK ORDER
OCCURS
80 UPDATES TO
S-CURVE
Original Duration
60
Expected Slippage
Percent of Cost
40
20