Professional Documents
Culture Documents
SOFTWARE PROJECT
MANAGEMENT
Step 1:
Find all of the activities that start at node 1.
Draw their finish nodes and draw arrows between node 1
and those finish nodes.
Put the activity letter or name and duration estimate on the
associated arrow.
Creating AOA Diagrams – Cont.
Step 2:
Continuing drawing the network diagram, working from
left to right.
Look for bursts and merges.
Bursts occur when a single node is followed by two or
more activities.
A merge occurs when two or more nodes precede a single
node.
Creating AOA Diagrams – Cont.
Step 3:
. Continue drawing the project network diagram until all
activities are included on the diagram that have
dependencies.
Step 4:
As a rule of thumb, all arrowheads should face toward the
right, and no arrows should cross on an AOA network
diagram
Precedence Diagramming Method
E
S: 4/06/12 ID 5
B
F:8/06/12 D 5
S: 2/06/12 ID 2
J
F:3/06/12 D 2
S: 15/06/12 ID 10
F F:17/08/12 D 3
S: 4/06/12 ID 6
F:9/06/12 D
C 4 I
S: 2/06/12 ID 3 S: 12/06/12 ID
G 9
F:4/06/12 D 3
S: 5/06/12 ID 7 F:13/06/12 D
F:11/06/12 D 6 2
3. Activity Duration Estimating
1. Parkinson’s Law
It states: “Work expands so as to fill the time available for
its completion.”
The law is true in the sense that even if time is
overestimated, there are several factors that come into play
that will facilitate the expanding of the project activities.
Laws in Schedule Estimation – Cont.
O+4M+P
6
(PERT) – Example
PERT weighted average =
optimistic time + 4X most likely time + pessimistic time
6
Example:
PERT weighted average =
8 workdays + 4 X 10 workdays + 24 workdays = 12 days
6
where optimistic time= 8 days,
most likely time = 10 days, and
pessimistic time = 24 days
Therefore, you’d use 12 days on the network diagram instead of 10 when using PERT
for the above example
PERT AND CPM
B=2
F=4 J=3
1 8
3 6
I=2
C=3
7
4
G=6
CPM
The Early Start (ES) and Early Finish (EF) dates are
calculated first by completing the “forward pass.” The ES
of the first task is one. The EF for the first task is its ES+
the task duration, minus one.
The ES of the next task(s) will be the EF for the previous
activity, plus one.
Backward Pass
Planning
List all activities necessary to complete a project. Establish
dependencies amongst activities and draw a rough sketch of the
diagram noting the following:
1. All activities start and end with an event
2. An activity is a time consuming task
3. An event is an instantaneous i.e. its occurrence means all
activities entering that event sign have now been completed
and all activities leaving that sign can now be started.
4. Any number of activities can go into and out of an event
Steps – Cont.