Scribd
Upload
32 views

Developing Project Plan

The document discusses developing a project network plan. It describes constructing a project network by identifying activities, dependencies, and time estimates. A forward and backward pass are used to calculate earliest and latest start/finish times and identify the critical path with the least slack. Project networks are useful for planning, scheduling, and monitoring project progress.

Uploaded by

Flavia
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
32 views

Developing Project Plan

The document discusses developing a project network plan. It describes constructing a project network by identifying activities, dependencies, and time estimates. A forward and backward pass are used to calculate earliest and latest start/finish times and identify the critical path with the least slack. Project networks are useful for planning, scheduling, and monitoring project progress.

Uploaded by

Flavia
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 15

DEVELOPING A PROJECT

PLAN
DEVELOPING A PROJECT PLAN

• OBJECTIVES
– UNDERSTAND HOW TO DEVELOP A
PROJECT NETWORK
– UNDERSTAND NETWORK COMPUTATION
PROCESS
– BE ABLE TO USE FORWARDS AND
BACKWARDS PASS INFORMATION
DEVELOPING THE PROJECT NETWORK

• PROJECT NETWORKS ARE USED TO PLAN,


SCHEDULE AND MONITOR PROJECT
PROGRESS
• DEPICTS THE PROJECT ACTIVITIES TO BE
COMPLETED, SEQUENCES,
INTERDEPENDENCIES, TIME TAKEN AND
CRITICAL PATH
• BUILD FROM WORK PACKAGE INTO
NETWORK
CONSTRUCTING A PROJECT NETWORK

• TERMINOLOGY:
– Activity – what has to be completed to complete the
project
– Merge activity – more than activity preceding it
– Parallel activities – occur at the same time if need be
– Path – sequence of connected dependent activities
– Critical path – longest path on the network
– Event – point in time when an activity is started or
completed
– Burst activity – more than one activity immediately
following it
CONSTRUCTING A PROJECT NETWORK

• ACTIVITY ON NODE VS ACTIVITY ON ARROW


• AON MORE POPULAR
• RULES:
– NETWORKS FLOW FROM LEFT TO RIGHT
– ALL PRECEEDING ACTIVITIES MUST BE COMPLETED
– ARROWS INDICATE PRECEDENCE AND FLOW
– EACH ACTIVITY MUST BE NUMBERED
– ANY ACTIVITY ID NUMBER MUST LARGER THAN
PRECEDING NUMBERS
– LOOPING IS NOT ALLOWED
– CONDITIONAL STATEMENTS SHOULD NOT BE USED
– HAVE A CLEAR START AND END
Network Information

TABLE 6.1
Koll Business Center—Partial Network

FIGURE 6.3
Koll Business Center—Complete
Network

FIGURE 6.4
Network Information

TABLE 6.2
Activity-on-Node Network

FIGURE 6.5
Activity-on-Node Network Forward Pass

FIGURE 6.6
Activity-on-Node Network Backward Pass

FIGURE 6.7
Activity-on-Node Network with Slack

FIGURE 6.8
NETWORK COMPUTATION PROCESS

• FORWARD PASS (EARLIEST TIMES)


– ES – HOW SOON CAN THE ACTIVITY START
– EF – HOW SOON CAN THE ACTIVITY FINISH
– TE – HOW SOON CAN THE PROJECT FINISH
– ES+duration = EF
– EF then carried forward to be ES for next activity unless the next activity
is a merge activity in which case you use the biggest preceding EF
• BACKWARD PASS (LATEST TIMES)
– LS – HOW LATE CAN THE ACTIVITY START
– LF – HOW LATE CAN THE ACTIVITY FINISH
– CP – CRITICAL PATH (LONGEST PATH WHICH WHEN
DELAYED WILL DELAY THE WHOLE PROJECT)
– SL – SLACK OR FLOAT (HOW LONG CAN THE ACTIVITY BE
DELAYED)
NETWORK COMPUTATION PROCESS

• LF – DUR = LS (IN EARLY STAGES, LF FOR THE LAST PROJECT =


TE)
• LS then carried backward to be LF for next activity unless the preceding
activity is a burst activity in which case you use the smallest successor LS
• SL = LS-ES/LF-EF = THE TIME AN ACTIVITY CAN BE DELAYED
AND YET NOT DELAY THE PROJECT
• CP = THE NETWORK PATH THAT HAS THE LEAST SLACK IN
COMMON: IF LF=EF THAN SLACK = 0.
• FREE SLACK – ACTIVITY CAN BE DELAYED WITHOUT
DELAYING THE ES OF THE NEXT ACTIVITY
• FSL = ES(S)-EF(P); ONLY ACTIVITIES AT THE END OF A CHAIN
CAN HAVE FREE SLACK

You might also like