Lecture Outline
The functions involved in Project Management. The network planning approach to project management
Objectives
You will know the steps involved in managing a project. You will be able to prepare a Work Breakdown Structure. You will be able to draw a Gantt chart for a given situation. You will be able to draw a Network Diagram for a sample project.
We shall now consider the planning and control functions in a little more detail.
The success of the whole project planning effort is dependent upon the quality of the work-scope definition. The standard way to define the work-scope is the work breakdown structure (WBS). The WBS is similar to the organisation chart for a company. In this approach, the project objectives are placed at the top of the diagram as deliverable end items. Each top level segment is then further subdivided into smaller groups.
Gantt Chart
Day 1 Day 2 Day 3
Task #1 Task #2 Task#3 Task #4 . Task #37 Task #38 Task#39 Task #40
. .
(Note that some software packages are able to produce these budgets automatically after you have entered the fixed and variable cost data.)
In general, you will find that your plan requires some adjustment.
You should note the starting and finishing times of all tasks in the project. Note also that the monitoring process entails keeping track of any changes in the work-scope and changing the network plan to account for such changes.
Forecasting, analysing and recommending corrective action are natural extensions of the performance evaluation. Forecasting involves extrapolation of past performance, tempered by the latest knowledge and judgement.
Network Planning - 1
Now that we have established a framework for the process of project management, let us take a look at the area of network planning to see how it can be used to assist us in this task Network Planning:
is a management tool used for planning, scheduling and controlling projects that consist of many inter-related tasks or activities.
In 1958, the PERT (Program Evaluation and Review Technique) was developed for use in the planning of the US Navy's Polaris Submarine. In 1957, the Du Pont Company, in conjunction with Remington developed another network planning technique called CPM. We shall consider these techniques in detail later.
Network Planning - 2
At this stage, we shall be setting the scene for the later lectures on the PERT and CPM methods by defining some of the terminology and preparing some sample network diagrams. Network planning techniques are often compared with the Gantt or bar chart approach mentioned earlier. The network planning technique has major advantages over the bar chart method, viz:
The inter-relationships and dependencies between activities are more readily appreciated through the use of a network diagram. Planning and scheduling functions can be separated. However, with bar charts the scheduling must be done simultaneously with the planning.
Network Principles
Whenever we draw a network plan it is important to understand certain principles and definitions. We shall be discussing:
Activities Events Predecessor events Successor events Precedence relationships Loops Dummy activities Laddering Baselines Multiple Start and/or Finish events
Activities
An activity is defined as the expenditure of effort over some period of time on a particular part of a project. An activity is represented on a network diagram by an arrow.
Start Note: The length and slope of the line have no bearing on the duration or importance of the activity, unlike the bar chart approach. Activity Finish
Event
An event is the start or finish of an activity or group of activities. Events link activities together. An event does not consume time and therefore is considered to be an instant or point in time. Events are represented as circles on a network diagram:
Event 1 Activity A Event 2
Precedence Relationships
The diagram below indicates the basic network rule of the precedence relationship of one activity to another.
Activity A Activity B
The above diagram shows that activity B cannot be started until activity A has been completed. The diagram also shows that activities may be drawn in a series relationship.
Parallel Relationships
1
Activity A Activity C
3 2
Activity B
The above diagram shows a parallel relationship. Thus activities A and B can be performed more or less independently, but activity C cannot start until both A and B have been completed.
Loops
2 1 4 3
The above figure shows a loop. Loops are not allowed in network diagrams since they would portray an illogical path of activities which would endlessly repeat itself.
Dummy Activities - 1
This is a special type of activity which consumes zero time and is represented in a network diagram by a dashed line as shown in the figure below: Activity A 1 Activity B 2 Activity A 1 Activity B Incorrect 2 3 dummy
Dummy Activities - 2
A second use of a dummy activity is to improve the logical precedence relationships among the activities in the network.
Activity A Activity C dummy Activity B Activity D
Activities A and B can be done in parallel. Activity C can start when activity A is finished, but activity D can start only when both activities A and B are finished.
Laddering - 1
Sometimes it is found that a set of activities is repeated several times in a row. For example, while laying a communications cable, it is necessary to dig a trench, lay the cable and then backfill the trench. Assume that the project is to be performed in three sections and that there are three work crews each available to perform one function of the task. One solution is given below:
Section A Section B Section C Backfill Dig Cable Backfill Dig Cable Dig Cable Backfill
10
In this solution we have only one crew working at a time and the others are standing around.
Laddering - 2
But this is clearly impossible, since only one crew is available for each type of activity. If we note however, that once the trench has been dug in Section A, the cable laying crew can start on Section A while the digging crew start on Section B, etc...... An alternative solution would be to try and set up all three operations in parallel as shown in the next figure:
Section A
1 4 7
Dig
2 5 8
Cable
3 6 9
Backfill
Dig Section B
Cable
Backfill
10
Dig
Cable
Backfill
Section C
Laddering - 3
This observation leads to the following solution involving dummy activities leads to an optimal completion strategy:
1
Dig A
Section A
Cable A
3 4 5
Dig C
Backfill A
Dig B
Cable B
6 8
Backfill B
Cable C
Backfill C
10
Baselines
In cases where there are many activity arrows with the same beginning and ending events it may start to become pretty messy! The baseline technique may be used to make your diagram a little neater!
2 1 3 4 5 1 2 3 4 2 3 1 4 5 3 4 5
1 2 5
A Summary Network
Once the network diagram has been drawn, it is necessary to number all the events in the network so that each activity in the network can be identified by its predecessor-successor event number combination. Don't worry about the neatness of your diagram initially, you will often need to redraw it several times before reaching a point where the design can be "frozen".
Earliest Start:
This is the earliest time that an activity can start, from the beginning of the project.
Earliest Finish:
This is the earliest time that an activity can finish, from the beginning of the project.
Latest Finish:
This is the latest that an activity can finish, from the beginning of the project, without causing a delay to the completion of the project.
Latest Start:
This is the latest that an activity can start, from the beginning of the project, without causing a delay to the completion of the project.
Overview of CPM
A complete list of project activities. Precedence relationships among activities. Estimate of each activity's duration.
CPM
Processing
Estimated duration of the project. Identification of critical activities. Amount of slack for each activity.
2
d=11
b=10
3 5
c=8
e=7 h=13
6 7
f=6
8
i=5
dummy g=12
Note the presence of the dummy activity here to indicate the precedence relationship. Length Path a-b-c-e-f 51 a-b-c-e-h-i 63* a-d-e-f 44 a-d-e-h-i 56 a-d-g-i 48 The path marked with * is the Critical Path
2
d=11
b=10
3 5
c=8
e=7 h=13
6 7
f=6
8
i=5
dummy g=12
Using standard methods from CPM it is now possible to calculate the Earliest and Latest Finish times for each activity and determine the slack times. The results are summarised below: Activity a b c d e f g h i Latest Finish 20 30 38 38 45 63 58 58 63 Earliest Finish 20 30 38 31 45 51 43 58 63 Slack 0 0 0 7 0 12 15 0 0