Time Management in Informatics Systems Management

GPI - Gestão de Projectos Informáticos
Time Management
Maria do Rosário Bernardo

Time Management
Time management allows the project manager to:

• Coordinate allocated effort
• Terminate the project on time, as required by business
needs
• Guarantee return on investment within appropriate time
delay => reduction of benefits
balance finish date with the costs required to recover

Detailed Planning
Activities planning principles
Adopt rolling wave planning

Involve in planning those who have execution responsibilities
Plan controllable activities

Detailed Planning
Activities Planning Sequence

• Starts with the decomposition of WBS Work Packages
into activities required to achieve each Milestone
• Estimate the activities duration
• Define the sequence / dependencies between activities
• Identify the resources need to perform those activities
• Estimate each resource’ effort required

estimated effort (days FTE / person)

Duration =
# allocated resources
BUT ...
Attention has to be given to:
• Non working days (weekends, holidays)

• Vacations;
• Part time work
• Training, thickness, other reasons;
• External environment disturb (mails; meetings; …)
• Interpersonal relationship

Working Days
Days per year 365
Week ends 104
Hollidays 9
Treated by project
Vacation 22 management
software
Working days (wd) 230
Part-time work ???
Buffer at the end of

Absences (training, thikness,…) 15 project (proportional)
Buffer by WP
Environment / relationships 0,1 a 0,2 * du (PT) (proportional)

ID Task Name Duration

December 2006 January 2007 February 2007 March 2007
23 26 29 02 05 08 11 14 17 20 23 26 29 01 04 07 10 13 16 19 22 25 28 31 03 06 09 12 15 18 21 24 27 02
0 Teste 68 d
1 A 34 d
2 PA1 18 d Work Packages
3 a11 5d
4 a12 4d Buffers
5 a13 6d
6 Buffer A1 3d
7 MA1 0d 22-12
8 PA2 16 d
9 a21 4d
10 a22 7d
11 a23 9d
12 Buffer A2 3d
13 MA2 0d 17-01
14 B 30 d
15 PB1 12 d
16 b11 4d
17 b12 6d
18 Buffer B1 2d
19 MB1 0d 02-02
20 PB2 18 d
21 b21 10 d
22 b22 15 d
23 Buffer B2 3d
24 MB2 0d 01-03
25 Buffer Projecto 4d
Project Buffer

Plan with Networks

Use of a mathematics technique
Critical Path Method (CPM) or

Precedence Diagramming Method (PDM)
Program Evaluation and Review Technique – PERT
Usually not used to communicate the Plan
Network Types:
• Precedence network (activities on nodes)
• Activity-on-arrow network

Activities on nodes network
A D


Dependencies representation
End-to-Start or Finish-to-Start
A B

Week -1 Week 1 Week 2 Week 3
M T W T F S S M T W T F S S M T W T F S S M T W T F S
1 A 5d
2 B 3d
B can start after A finishes


Start-to-Start
Allowing paralelism
C
D

M T W T F S S M T W T F S S M T W T F S S M
5 C 5d
6 D 3d
D can’t start before C starts


Finish-to-Finish
Allowing paralelism
E
F

9 E 5d
10 F 3d
F only can finish when E is finished


Start-to-Finish
G H

13 G 5d
14 H 3d
H can’t finish until G is not initiated


lag
When a fixed waiting time between activities has to exist.

(for instance the time required to approve a document after it is availlable
for revision)
+ lag
A B
+2

17 A 5d
18 B 3d
B may be innitiated 2 days after A is finished


lag (negative)
- lag
A B
-2

21 A 5d
22 B 3d
B may be innitiated 2 days before A finishes


lag (start-to-start)
+ lag
C
+2 D

25 C 5d
26 D 3d
D may be innitiated 2 days after C start

Activities on arrow netwoks
3
B dummy
A C D
1 2 4 5
Forces Finish-to-Start

es + d = ef
early start (es) duration (d) early finish (ef)
Activity name
late start (ls) slack (s) late finish (lf)
slack = lf - ef
lf - d = ls

early start (es) duration (d) early finish (ef)
Activity name
late start (ls) slack (s) late finish (lf)
early start
late finish
slack
activity
late start early finish

act dur dep lag ef = es + d es d ef

slack = ls - es desc
A 3 -
lf = ls + d ls slack lf
B 2 A
C 2 A -2
D 1 B +2
C 3 2 5
B +2
3 0 5
0 3 3 7 1 8
A D
0 0 3 7 0 8
-2 1 2 3
C
5 4 7
•Forward Path
1.Activity ES = EF of the predecessor

activity
2.When there are several predecessors use
the max (EF of all predecessors)
ES D 10
Activiy
LS Slack LF 10 D 10+D
Activiy
LS Slack LF
ES D 8
Activiy
LS Slack LF
ES D EF
Activiy
3.Early Finish (EF) = ES + Duration LS Slack LF

•Backward Path
1.Start with the last activity

2.Follow the paths from the last activity until
ES D EF
the first one Activiy
3.Last activity : LF = EF LS Slack LF
4.LF = LS of the successor activity

5.If there are multiple successors use the min ES D EF
(LS of all predecessors) Activiy
6.LS = LF – Duration 8 Slack LF
ES D EF
Activiy
ES D EF
8-D Slack 8
Activiy
10 Slack LF
7.Slack = LF-EF = LS-ES
Maria do Rosário Bernardo 22
Exercise 4 -1 5
B C
0 2 3
A G
2 10
D E
Duration ? +3
5
Critical path ? F
Consequences is D delays 2 days?
Consequences is C delays 2 days?
Consequences is F delays 2 days?
If A starts on 4-Oct : Estimated data and hour of conclusion ?
23

Time Management in Informatics Systems Management

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Time Management in Informatics Systems Management

Uploaded by

Copyright:

Available Formats

GPI - Gestão de Projectos Informáticos

Maria do Rosário Bernardo

Time management allows the project manager to:

Maria do Rosário Bernardo

Activities planning principles

Adopt rolling wave planning

Maria do Rosário Bernardo

Activities Planning Sequence

Maria do Rosário Bernardo

estimated effort (days FTE / person)

• Non working days (weekends, holidays)

Maria do Rosário Bernardo

Days per year 365

Week ends 104

Part-time work ???

Buffer at the end of

Maria do Rosário Bernardo

ID Task Name Duration

Maria do Rosário Bernardo

Plan with Networks

Critical Path Method (CPM) or

Program Evaluation and Review Technique – PERT

Usually not used to communicate the Plan

Maria do Rosário Bernardo

Activities on nodes network

Maria do Rosário Bernardo

Activities on nodes network

ID Task Name Duration

B can start after A finishes

Maria do Rosário Bernardo

Activities on nodes network

ID Task Name Duration

D can’t start before C starts

Maria do Rosário Bernardo

Activities on nodes network

ID Task Name Duration

F only can finish when E is finished

Maria do Rosário Bernardo

Activities on nodes network

ID Task Name Duration

H can’t finish until G is not initiated

Maria do Rosário Bernardo

Activities on nodes network

When a fixed waiting time between activities has to exist.

ID Task Name Duration

B may be innitiated 2 days after A is finished

Maria do Rosário Bernardo

Activities on nodes network

ID Task Name Duration

B may be innitiated 2 days before A finishes

Maria do Rosário Bernardo

Activities on nodes network

ID Task Name Duration

D may be innitiated 2 days after C start

Maria do Rosário Bernardo

Activities on arrow netwoks

Maria do Rosário Bernardo

early start (es) duration (d) early finish (ef)

late start (ls) slack (s) late finish (lf)

Maria do Rosário Bernardo

early start (es) duration (d) early finish (ef)

late start (ls) slack (s) late finish (lf)

late start early finish