Project Management (To Students)
Project Management (To Students)
Project Management (To Students)
9
Project Management
What is involved in Project planning?
• Gantt chart
• PERT chart * Not required
19
Project Management – Tasks
Dependencies
A project plan are rarely made up of stand alone tasks, more often
than not tasks rely on other tasks having been completed.
Description. Tasks that must be completed before another task
can begin are called predecessors. The dependent tasks are
successors.
Task Description Preceding task(s) Days required
a Systems analysis - 20
b Program specification a 10
c Input design a 5
d Output design a 7
e Program coding b&c&d 12
f Program testing e 8
Tasks Dependencies
Task A Task B Task C Task D Task E Task F
Task B Task D
Task C Task E
Task C Task D
Project Management - Milestones
• A milestone represents the achievement is a significant
stage or point within in a project. The event is represent
aby a task with zero duration.
• It often takes several activities and a lot of work to
complete a milestone
• They’re useful tools for setting schedule goals and
monitoring progress
• Examples include obtaining customer sign-off on key
documents or completion of specific products, the end of
programming
Project Management – Critical Path
• The critical path for a project represents a list of tasks that
determines the earliest time by which the project can be
completed
• The critical path is the longest path (time) through the
network diagram and has the least amount of slack or float
• Slack or float is the amount of time an activity may be
delayed without delaying a succeeding activity or the
project finish date
• If one or more of the tasks on the critical path takes longer
than planned, the whole project schedule will be delayed.
Network Diagrams
• Network diagrams are the preferred technique for showing
activity sequencing
• A network diagram is a schematic display of the logical
relationships among, or sequencing of, project activities
• Activities are represented by arrows
• Nodes or circles are the starting and ending points of
activities
b,10
d,7
3 possible paths:
28
Tutorial Activities
Steps to prepare a tasks/activities table
1. List all activities (or tasks) included in the project.
2. Determine the sequence of the tasks.
3. Estimate time required for each task.
– When a task table is done, it contains the following information:
• Task name,
• Description,
• Preceding task/Previous task,
• Duration/Normal time,
• Crash Time (Optional).
Example 1
1. List of Tasks
Task Description
a Systems analysis
b Program specification
c Input design
d Output design
e Program coding
f Program testing
Example 1
4. Repeat this process until all tasks are included in the PERT
diagram.
Usually the beginning node of the first task (task with no preceding
task) and the ending node of the last task (task with no following
task) are represented by a double circle.
Symbols used in Network Diagrams
X Y Z
1 2 3 4
• Parallel tasks:
Z
1 2 3
Y
• Use of a dummy task:
Z can’t begin until both X and Y have ended,
but W can begin as soon as Y has ended.
X Z
3 4
1
Y
W
2 5
•Node Numbers
Each node must be given a unique number.
Node numbers must follow the arrows.
Task Duration (days) Predecessor
A 3 --
B 10 A
C 5 A
D 8 B,C
A,3
1 1 2
B,10
2 A,3
1 2 3
C,5
B,10 3
A,3
2 1 2 Dummy 0
C,5 4
Task Duration (days) Predecessor
A 3 --
B 10 A
C 5 A
D 8 B,C
D,8
B,10 3 5
3 A,3
1 2 0
C,5 4
Critical Path (Forward Pass)
Max(13,8) 21
D,8
3 B,10 3 5
A,3
1 2 0
C,5 4
8
13 21
D,8
3 B,10 3 5
A,3
1 2 0
C,5 4
8
Critical Path: A,B,D 21 days
Example 1
1. Using the task table, the task with no preceding task is task a.
a,20
1 2
3. Continue with the tasks that follow task a.
b,10
a,20 c,5
1 2 3
d,7
4. Repeat this process until all tasks are included in the PERT diagram.
b,10
d,7
4
, 10
b
5
Determine the critical path(s).
3 possible paths:
b,10
d,7
Critical Path Algorithm
*Uses a table to determine the following for each task:
ES = earliest start EF = earliest finish ST = slack time
LS = latest start LF = latest finish ( d = duration )
e.g.
Task Pred. d ES EF LS LF ST
Example 2
Given the following project tasks outline:
What is the minimum time required for the project? What is the slack
time for each task? Determine the critical tasks.
From this table we can see the following:
50
Expediting a project
a 20 20 900
b 10 6 600
c 5 3 200
d 7 5 400
e 12 10 50
f 8 7 100
Paths
58
Gantt Chart for Project
Note: Darker bars would be red in Project 2010 to represent critical tasks.
59
Gantt Chart for Software Launch Project
60
Adding Milestones to Gantt Charts
61
Task Dependency Types
62