Chapter 4�Project Time Management
Chapter Objectives
By the end of this chapter students will be able to:
Introduction - Importance of Project Schedules
2
Project Time Management Processes
3
4.1. Plan Schedule Management
4
4.2. Defining Activities�
5
Define Activities: Outputs�
6
Cont…�
7
4.3 Sequencing Activities
8
Dependency Determination
9
Cont…
3. External dependencies:
4. Internal dependencies:
10
Types of Task Dependencies
Dependency Examples
11
Cont…
12
Sequence Activities: Tools and Techniques �
13
Fig 4.1. Sample AOA Network Diagram for Project X
I. Arrow Diagramming Method (ADM)
Process for Creating AOA Diagrams
14
Cont…
3. Continue drawing the project network diagram until all activities are included on the diagram that have dependencies.
4. As a rule of thumb, all arrowheads should face toward the right, and no arrows should cross on an AOA network diagram.
II. Precedence Diagramming Method (PDM)
15
Fig. 4.2. Sample PDM Network Diagram for Project X�
16
4.4 Estimating Activity Resources
17
Cont…
18
4.5 Activity Duration Estimating
19
4.6 Developing the Schedule
20
Develop the Schedule: Tools and Techniques�Gantt Charts
21
Figure 4.3. Gantt Chart for Project X
Figure 4.4 Gantt Chart for Software Launch Project
22
Adding Milestones to Gantt Charts
SMART Criteria
23
E.g, distributing a marketing plan is specific, measurable, and assignable if everyone knows what should be in the marketing plan, how it should be distributed, how many copies should be distributed and to whom, and who is responsible for the actual delivery. Distributing the marketing plan is realistic and able to be time-framed if it is an achievable event and scheduled at an appropriate time.
Best Practice
24
Figure 4.5 Sample Tracking Gantt Chart
25
Critical Path Method (CPM)
26
Cont…
27
Figure 4.6 Determining the Critical Path for Project X
28
Using CP Analysis to make Schedule Trade-offs
29
Table: Free and Total Float/Slack for Project X
30
NB: If activities that are not on the CP have a difference between their ES and LS, they can be delayed without affecting the project completion date.
How to Find the Critical Path
ES = Largest EF of immediate predecessors
31
ACTIVITY t
ES EF
LS LF
Example
32
Activity | Expected duration (in days) | Preceded by |
A | 2 | ─ |
B | 3 | ─ |
C | 2 | A |
D | 4 | B |
E | 4 | C |
F | 3 | C |
G | 5 | D, E |
H | 2 | F, G |
Cont…
33
Then EF= ES+ t
Cont…
General Foundry’s ES and EF times
A 2
0 2
C 2
2 4
H 2
13 15
E 4
4 8
B 3
0 3
D 4
3 7
G 5
8 13
F 3
4 7
Start
Finish
34
ES of successor activity is the largest EF of immediate predecessors.
Cont…
LS = LF - t
LF = Smallest LS of following activities
35
Cont…
General Foundry’s LS and LF times
36
A 2
0 2
0 2
C 2
2 4
2 4
H 2
13 15
13 15
E 4
4 8
4 8
B 3
0 3
1 4
D 4
3 7
4 8
G 5
8 13
8 13
F 3
4 7
10 13
Start
Finish
Cont…
Slack = LS – ES, or Slack = LF – EF
37
Critical Activities
A 2
0 2
0 2
C 2
2 4
2 4
H 2
13 15
13 15
E 4
4 8
4 8
B 3
0 3
1 4
D 4
3 7
4 8
G 5
8 13
8 13
F 3
4 7
10 13
Start
Finish
Schedule Compression/ Shortening Using CP
38
Cont…
39
Critical Chain Scheduling
40
Buffers and Critical Chain
41
Cont…
42
Figure Example of CCS
Example of Critical Chain Scheduling
Critical Path = Task1+Task2+Task3+Lag+Task6 = 6+4+2+1+8 = 21 Days.
43
Program Evaluation & Review Technique (PERT)
44
4.7 Schedule Control
Schedule Control Suggestions
45
Cont…
46
Discussion Questions�
47