0% found this document useful (0 votes)
30 views22 pages

Activity Planning and Schedule

Ggttttttrrrrrttfhyt defy http from ur extra effort iHeart years ethics duvet decided debug Jew kr us ka ah he ah he eyes TV beaded shag shrubs CW CA CE ah he wet he wet ha at he effected targets where caged

Uploaded by

Huzaifa Mirza
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
0% found this document useful (0 votes)
30 views22 pages

Activity Planning and Schedule

Ggttttttrrrrrttfhyt defy http from ur extra effort iHeart years ethics duvet decided debug Jew kr us ka ah he ah he eyes TV beaded shag shrubs CW CA CE ah he wet he wet ha at he effected targets where caged

Uploaded by

Huzaifa Mirza
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/ 22

Activity Planning and Schedule

TEAM MEMBERS

M. Huzaifa Abdulahad 22 - ARID - 860


Ikhlas Jutt 22 - ARID - 3107
Bilal Ali 22 - ARID - 772
Activity/Task List
Activity Duration Precedents
(weeks)
A Hardware selection 6
B Software design 4
C Install hardware 3 A
D Code & test software 4 B
E File take-on 3 B
F Write user manuals 10
G User training 3 E,F
H Install & test system 2 C,D
Precedence Analysis
In project management it Involves reviewing activities and
dependencies analysis & relationship between tasks and
activities.
Mandatory dependencies: certain tasks must be FINISH before
other can START. Also known as “Hard logic”
I-e: ( In software development, testing starts only if coding is
finished )
Discretionary dependencies: “Soft Logic”, can be describe by
project team’s, not strictly required, established based on team
decisions and preferences.
I-e: ( In software development, waiting for feedback on
software prototype before detail design )
External dependencies: Relationship between project activities
and factors outside the project itself.
I-e: ( waiting for supply of hardware before preceding to any
phase,
Waiting for phone or tablet to check responsiveness in testing
phase )
Network Planning Model
Describe relationship b\w different task in projects,
Four type of dependencies

1: FINISH TO FINISH
2: FINISH TO START
3: START TO FINISH
4: START TO START
FINISH TO START: most common type,Task (B) can’t start until Task (A) finish.
I-e: ( Task (A) : new feature are to be added in app/site,
Task (B) : Testing of these new features,
Testing can only be done if features are added so B can’t start until A end )

VISUALIZATION:

TASK B

TASK A

Once task a completed then task b started


FINISH TO FINISH: Task (B) can’t finish until Task (A) finish.completion of one tied with other.
I-e: ( Task (A) : new feature are to be added in app/site,
Task (B) : Technical writer need to create doc’s for new features as well as api.
Technical writer can only stops if all feature add added hence B and A both finish at the
same time
)

VISUALIZATION:

TASK B

TASK A
Start time might be difference but end are same
START TO FINISH: Task (B) can’t finish until Task (A) start.less
common
I-e: ( Task (A) : start upgrading the system,
Task (B) : maintenance team do daily checkups.
Maintenance or task B only stops when system starts getting
upgradation)

VISUALIZATION:
TASK A

TASK B

One stop when another starts


START TO START: Task (B) can’t STARTuntil Task (A) starts.
I-e: ( Task A:Testing
Task B: Debugging
Debugging( removing errors ) can’t start until
Testing( finding errors ) task start’s )
VISUALIZATION:

TASK A

TASK B

Might end at different time but starts at the same time


Project Network Diagram
Project network diagrams (PND) are the preferred technique for showing activity sequencing

Arrow Diagramming Method (ADM)

Precedence Diagramming Method (PDM)


Arrow Diagramming
Method(ADM)
Also known as AOA ( Activity On Arrow ).
Activities are represented by arrows.
Nodes or circles are the starting and ending points of activities.
Can only show finish-to-start dependencies.
AOA ( Activity On Arrow ) Dummy activity has no duration(tim

A
Activity Predecessor
D
A -
B - B
C -
D A,B
C
E B
F D,C

E
Precedence Diagramming Method ( PDM )

Activities are represented by boxes


Arrows show relationships between activities
More popular than ADM method and used by project management software
Better at showing different types of dependencies
PDM ( Precedence Diagramming Method )

Activity Predecessor Duration

A - 5
B A 3
C A 4
D B,C 2
E D 5

5 B8
ES AT EF 6 3 9
LSDR LF 0 A 5 9 D 11 11 E 16
0 5 5 9 2 11 11 5 16

5 C9
5 4 9
Schedule development :Adding the time dimension
Moving from Logical to Physical network model:
• we are now ready to start thinking about when each activity should be
undertaken (Physically).

CPM
project network analysis technique used to predict total project Duration and
concerned with two primary objectives:
• Planning the project in such a way that it is completed as quickly as possible; and
• Identifying those activities where a delay in their execution is likely to affect the
overall end date of the project or ‘later activities’ start dates.

Network Analysis: The network is then analyzed by carrying out:


• forward pass, to calculate the earliest dates at which activities may commence and
the project be completed, and a
• backward pass, to calculate the latest start dates for activities and the critical path.
Constructing CPM Network
❖ Typically information about events is recorded on the network (and activity-
based information is generally held on a separate activity table).
❖ common convention is to divide the node circle into quadrants to show the event
number, the latest and earliest dates, and the event slack.
A=6 C=3
Event 2
number
1 B=4 3 D=4 4 H=2 6
Earliest Latest
date
date
Slack F=10 E=3 G=3
5
CPM node
The forward pass
❖ carried out to calculate the earliest date on which each event may be achieved and
the earliest dates on which each activity may be started and completed.
❖ Earliest dates for events are recorded on the network diagram and for
activities on the activity table.
62
A=6 C=3
Forward Pass
B=4 D=4 H=2 13 6
01 43 94
CPM network after forward pass
?
E=3 ?
Early Finish (EF) = ES + Duration G=3
F=10 5
? 10

Activity table after the forward pass


Activity Duration Earliest Latest Earliest finish Latest finish
(weeks) start date start date date date

A 6 0 6
B 4 0 4
C 3 6 9
D 4 4 8
E 3 4 7
F 10 0 10
G 3 10 13
Example Question

Activity Predecessor Duration

A - 5
B A 7
C A 4
D B 10
E C 3
F C 5
G D,E 6
H F,G 4
Early Finish (EF) = ES + Duration
LS = LF - DURATION
Critical Path 12 D 22 12 - 12 = 0

12 10 22

22 G 28
5-5=0 5 B 12
22 6 28
9 E 12
5 7 12
0 A 5
19 3 22
28 H 32
0 5 5
5 C 9
28 4 32
9 F 14
0-0=0
15 4 19 28- 28 = 0
23 5 28

ES - EF = 0
THANK YOU

You might also like