Professional Documents
Culture Documents
CHAPTER – FIVE
PROJECT SCHEDULING APPROACH AND CONTROL TECHNIQUES
WHAT IS PROJECT SCHEDULING?
Project scheduling is a process of laying out the actual jobs (work components, activities,
tasks) of the project in a time-order in which they have to be performed, that is, the tasks needed to
get done and which organizational resources will be allocated to complete those tasks in what
timeframe and when the project is due.
THE SEVEN PROCESSES (STEPS) OF PROJECT SCHEDULING
The following are the seven steps needed to schedule a project:
STEP-1-PLAN SCHEDULE MANAGEMENT
The process of establishing the policies, procedures, and documentation for planning, developing,
managing, executing, and controlling the project schedule.
STEP-2-IDENTIFICATION AND DEFINITION OF ACTIVITIES
Activity is a task or set of tasks that are carried out in order to create a deliverable. An activity
or task is an element of work normally found on the work breakdown structure (WBS) that has
expected duration, cost, and resource requirements. Note: The term ‘activity’ is used as a collection
of tasks, although in casual use ‘task’ and ‘activity’ are often used interchangeably.
Activity Identification involves identifying the specific activities and actions that must
be perform to produce the project deliverables in enough detail to determine resource and schedule
estimates. The work breakdown structure (WBS) is used to identify required project components
that are in turn used to, define the activities, organize them by mapping out the tasks necessary to
complete each of these project components.
Activity Definition. Activity definition includes a listing out each of the tasks to be
performed, this will result in an activity list.
The activity list is a tabulation of activities to be included on a project schedule. This table
includes, the Activity attributes that provide more information such as the; activity
identifier (ID) or number, activity name, activity description, predecessors, successors, task
relationships, leads, lags, resource requirements, constraints, imposed dates, & assumptions related
to the activity as demonstrated below.
Activity ID Activity Name Description Pred Dur Task R/ship Leads/Lags
1.0 A Requirements Analysis -
2.0 B Systems Design A 4
3.0 C Programming A,B 5
4.0 D System Testing C 6
5.0 E System Installation C,D 3
6.0 F System Handover E 2
A milestone is a significant point or event in time representing a key or important intermediate
event in the life of a project. A “measuring point”. A task with “0” zero duration and no resource
assignments. They’re useful tools for setting schedule goals and monitoring progress. E.g.; obtaining
customer sign-off on key documents or completion of specific products such as software modules.
Page 1 of 20
Prepared By DAK ©2018
Department of Applied Computing and Information Technology
Faculty of Computing and Informatics
Makerere University Business School
Chap-5-Project Scheduling and Control Techniques BBC – II – Day & Evening
The key benefit of this process is that it defines the logical sequence (relationships, linkages and
dependencies) of work to obtain the greatest efficiency.
Task Dependency
Activity ID Activity Name
Predecessor Successor
1.0 A - -
2.0 B A A-B
3.0 C A,B A-C & C-B
4.0 D C C-D
d) Internal Dependencies are defined between two project activities. The Project team,
usually, has complete control over project activities. These are performed by the project TEAM
members. There is no involvement of any external party. i.e. They are within project team’s
control, based on relationship between project activities. For example, developing a system and
testing a system represent internal project tasks and related to each other as seen from above.
Page 2 of 20
Prepared By DAK ©2018
Department of Applied Computing and Information Technology
Faculty of Computing and Informatics
Makerere University Business School
Chap-5-Project Scheduling and Control Techniques BBC – II – Day & Evening
Task Relationships
The relationships among tasks specifies the order and associations in which the predecessor tasks
and successor tasks need to be performed, by defining their finish and start dates.
Land Purchase
Road Building
Foundation Digging
Foundation Building
Laying Tarmac
Line Painting
Page 3 of 20
Prepared By DAK ©2018
Department of Applied Computing and Information Technology
Faculty of Computing and Informatics
Makerere University Business School
Chap-5-Project Scheduling and Control Techniques BBC – II – Day & Evening
The key benefit of this process is that it identifies the type, quantity, and characteristics of resources
required to complete the activity which allows more accurate cost and duration estimates.
The main outputs of this process are activity resource requirements, a resource breakdown structure,
activity duration estimates and the project documents updates.
For example, let’s say you have to estimate the duration of a school building project with the
help of the analogous estimating. In this case, you will look into your organizational process
assets (OPA) for any earlier school building project completed by your organization and pick the
best project, which looks similar to your project. Once you find a completed similar project, you
will compare it with your project and use your expert judgment to find the approximate time
duration for your project.
With the analogous method of estimating, you can estimate the duration of a project very quickly.
This process is not very accurate; however, it is very useful when there is very little information
available for the project and you have to estimate the duration as quickly as possible.
E.g., if constructing a 10ft. wall took one day, then how long will it take to build a hundred foot
wall? You will multiply the time taken to build a ten foot wall in the old project by ten.
c) Three Points Estimates originated from PERT (Program Evaluation and Review
Technique) that uses three time estimates to determine an approximate average duration of an
activity. This estimating is based on considering various options like the assignment of the
resources, uncertainty, and the risk associated, such as best scenario based and worst scenario
based.
The 3-point estimate is a weighted average technique to determine the approximate duration of
an activity that considers three various time estimates required to execute an activity instead of
a single time estimate, and these time estimates include;
i). Most Likely (Tm) is the time taken by an activity to finish it in most cases.
ii). Optimistic (To) is the time taken by an activity to finish it in the most favorable case.
iii).Pessimistic (Tp) is the time taken by an activity to finish it in the worst-case scenario.
Once you get these three estimates, you can calculate the estimated time estimate by using the
below given formula: Te = (To + 4Tm + Tp) / 6
The duration estimate obtained by this method is more accurate than the rest. Using three points
estimate reduces the chances of risks, bias judgment, and uncertainty.
Page 5 of 20
Prepared By DAK ©2018
Department of Applied Computing and Information Technology
Faculty of Computing and Informatics
Makerere University Business School
Chap-5-Project Scheduling and Control Techniques BBC – II – Day & Evening
The key benefit of this process is that by entering schedule activities, durations, resources, resource
availabilities, and logical relationships into the scheduling tool, it generates a schedule model with
planned dates for completing project activities.
Page 6 of 20
Prepared By DAK ©2018
Department of Applied Computing and Information Technology
Faculty of Computing and Informatics
Makerere University Business School
Chap-5-Project Scheduling and Control Techniques BBC – II – Day & Evening
System Design
A lag is the amount of time whereby a successor activity will be delayed with respect to a
predecessor activity. E.g., a technical writing team may begin designing a system 15 days after they
begin coding it. This can be shown as a start-to-start relationship with a 15-day lag.
System Design
Step – 3: Finally add up the duration of all those activities on each path to obtain the critical path.
For example; from the above AON network diagram indicates that the total time required to
complete all the project activities is 25 weeks. However since some activities can take place
simultaneously, it is clear that the total project completion time is less than 25 weeks.
i). Path 1: A-C-F-H: Length = 2+2+3+2 = 9 Weeks
ii). Path 2: A-C-E-G-H: Length = 2+2+4+5+2 = 15 Weeks
iii). Path 3: A-D-G-H: Length = 2+4+5+2 = 13 Weeks
iv). Path 4: B-D-G-H: Length = 3+4+5+2 = 14 Weeks
The Critical Path for the above project is: Path A-C-E-G-H whose Length is 15 Weeks.
Page 8 of 20
Prepared By DAK ©2018
Department of Applied Computing and Information Technology
Faculty of Computing and Informatics
Makerere University Business School
Chap-5-Project Scheduling and Control Techniques BBC – II – Day & Evening
Page 9 of 20
Prepared By DAK ©2018
Department of Applied Computing and Information Technology
Faculty of Computing and Informatics
Makerere University Business School
Chap-5-Project Scheduling and Control Techniques BBC – II – Day & Evening
Solution
Step – 1: Develop the AON/PDM Diagram
Certainly, the general rule is that, all successor activities can start only after the latest predecessor
is finished.
i). Earliest start (ES) is the earliest time at which a succeeding activity can start, assuming all
predecessors have been completed without any delays or changes.
Calculating the ES
ES is computed as the EF of the previous activity. If the activity has two immediate predecessors,
we take, then its ES is derived as largest of the EF times of two immediate predecessors
ii). Earliest finish (EF) is the earliest time at which an activity can be finished.
Calculating the EF
The EF = Predecessor ES time + Expected successor activity time.
Page 10 of 20
Prepared By DAK ©2018
Department of Applied Computing and Information Technology
Faculty of Computing and Informatics
Makerere University Business School
Chap-5-Project Scheduling and Control Techniques BBC – II – Day & Evening
ES EF
Activity Duration
LS LF
55Float
An example of a PDM (AON) Diagram showing the computation of ES, EF, LS, and LF
Page 11 of 20
Prepared By DAK ©2018
Department of Applied Computing and Information Technology
Faculty of Computing and Informatics
Makerere University Business School
Chap-5-Project Scheduling and Control Techniques BBC – II – Day & Evening
Note: Activity B, for example, has 1 week of slack time, this means that it can delayed by up to
1 week and the whole project can still be finished in 15 weeks
That slack of 1 week B & D had on that path is shared and called total slack. Whose delay,
delays other tasks.
Page 12 of 20
Prepared By DAK ©2018
Department of Applied Computing and Information Technology
Faculty of Computing and Informatics
Makerere University Business School
Chap-5-Project Scheduling and Control Techniques BBC – II – Day & Evening
EXERCISE QUESTIONS
Question – One
For the project data in the following table, answer the following questions:
a) Draw an AOA and AON network of the project
b) Perform forward path and backward path calculations
c) What is the effect of delaying activity D by 3 days?
ACTIVITY DURATION IMMEDIATE PREDECESSOR
A 2 -
B 6 A
C 3 A
D 1 B
E 6 B
F 3 C,D
G 2 E,F
Total 23
Question – Two
Perform PDM calculations for the small project below and determine activity times. Durations are
shown on the activities.
Page 13 of 20
Prepared By DAK ©2018
Department of Applied Computing and Information Technology
Faculty of Computing and Informatics
Makerere University Business School
Chap-5-Project Scheduling and Control Techniques BBC – II – Day & Evening
Page 14 of 20
Prepared By DAK ©2018
Department of Applied Computing and Information Technology
Faculty of Computing and Informatics
Makerere University Business School
Chap-5-Project Scheduling and Control Techniques BBC – II – Day & Evening
Task Variance is the measure of certainty, that is, the spread of value over a normal
distribution
Page 15 of 20
Prepared By DAK ©2018
Department of Applied Computing and Information Technology
Faculty of Computing and Informatics
Makerere University Business School
Chap-5-Project Scheduling and Control Techniques BBC – II – Day & Evening
Step-4. Use the weighted average method and calculate the Estimated Time, Standard
Deviation and Variance for each task.
Time Estimates
Activity Pred Expected time SD Variance
Ot Mt Pt
A - 4 5 9 [4+(5*4)+9]/6 = 5.5 [(9-4)/6] = 0.83 [(9-4)/6] 2 = 0.694
B - 3 6 15 [3+(6*4)+15]/6 = 7.0 [(15-3)/6] = 2.00 [(15-3)/6] 2 = 4.000
C A 3 4 5 [3+(4*4)+5]/6 = 4.0 [(5-3)/6] = 0.33 [(5-3)/6] 2 = 0.111
D A 2 7 9 [2+(7*4)+9]/6 = 6.5 [(9-2)/6] = 1.17 [(9-2)/6] 2 = 1.361
E B,C 3 5 7 [3+(5*4)+7]/6 = 5.0 [(7-3)/6] = 0.67 [(7-3)/6] 2 = 0.444
F D 6 8 13 [6+(8*4)+13]/6 = 8.5 [(13-6)/6] = 1.17 [(13-6)/6] 2 = 1.361
G D,E 1 3 11 [1+(3*4)+11]/6 = 4.0 [(11-1)/6] = 1.67 [(11-1)/6] 2 = 2.778
Total Time 22 38 69 40.5 6.67 10.750
Note: When doing manual PERT Calculations it is helpful to construct a table to stay organized.
Step – 5: Determine the critical path by determining the earliest and latest times.
A table showing the earliest and latest times that are used to determine the critical path
Time Estimates Early Times Late Times Slack/
Activity Pred. Et SD Variance
Ot Mt Pt ES EF LS LF Float
A - 4 5 9 5.5 0 5.5 0 5.5 0 0.83 0.694
B - 3 6 15 7.0 0 7 4.5 11.5 4.5 2.00 4.000
C A 3 4 5 4.0 5.5 9.5 7.5 11.5 2 0.33 0.111
D A 2 7 9 6.5 5.5 12 5.5 12.0 0 1.17 1.361
E B,C 3 5 7 5.0 9.5 14.5 11.5 16.5 7 0.67 0.444
F D 6 8 13 8.5 12 20.5 12 20.5 0 1.17 1.361
G D,E 1 3 11 4.0 14.5 18.5 16.5 20.5 4 1.67 2.778
Total Time 22 38 69 40.5 6.67 10.750
Note the following:
Note – 1: The Slack or float is given by = LS – ES, or Slack = LF – EF.
Note – 2: Notice that the mean times can be above, below, or equal to the most likely times.
Note – 3: The total expected project completion time is 20.5 days, which is the total of expected
time for all critical activities (A-D-F).
Page 16 of 20
Prepared By DAK ©2018
Department of Applied Computing and Information Technology
Faculty of Computing and Informatics
Makerere University Business School
Chap-5-Project Scheduling and Control Techniques BBC – II – Day & Evening
The PERT AOA network diagram depicting the expected time, ES, EF, LS and LF
The expected time for each activity is copied onto the network and used to calculate the ES, EF, LF, and
LS, as in:
Step – 6: Determine the probability of meeting the expected specified project scheduled date.
Since the project completion time is simply the sum of the expected activity times for the critical
path activities. Therefore, to determine the probability of meeting the desired completion date
(particular dead-line), we use the normal distribution table. This is because, the project completion
time is the mean of a normal distribution, and we can use the Normal Distribution Table.
Below is a picture of the normal distribution for the project, with the mean of 20.5.
Computing for the normal distribution requires two pieces of information or parameters. The first is
the mean, and the second is the variance or standard deviation and we have all that
already computed.
The formula for probability Computation is given by;
Due Date – Mean
Z=
Standard Deviation
Where:
Due date = (proposed) specified time or due date
Mean = project mean time for only the critical activities
Standard deviation = project standard mean time is the square-root of the total variance for only
the critical activities
Page 17 of 20
Prepared By DAK ©2018
Department of Applied Computing and Information Technology
Faculty of Computing and Informatics
Makerere University Business School
Chap-5-Project Scheduling and Control Techniques BBC – II – Day & Evening
Solution
What is the probability of completing the project in 25 days?
The desired completion time which is 25 days
The project mean time which is 20.5 days
The project standard mean is the √𝟑. 𝟒𝟏𝟕 which is for 1.8484
25 – 20.5
Z= = 2.434
1.8484
Reading the Z values from the normal distribution table, so look up to the border of the table, we
find that the probability of being between the mean and 2.43 is = 0.9925, which means that we have
over 99% chance of being done by 25 days, which is pretty good.
NB: From the figure above, we are looking for the area between the total expected completion date
and the desired date. The area marked by Z.
How many days would you estimate that are required to complete the project in case the project
manager wanted a 90% chance of being right?
Now, we are going to do everything in reverse. This time, the project manager wants to know a range
of due dates, so that there is a stated probability of being done within that range, for example, a 90%
probability.
Basing on the table of pre-computed cumulative probabilities of normal distribution, we can see that for
a 98% chance, our Z = 2.00.
Page 18 of 20
Prepared By DAK ©2018
Department of Applied Computing and Information Technology
Faculty of Computing and Informatics
Makerere University Business School
Chap-5-Project Scheduling and Control Techniques BBC – II – Day & Evening
Page 19 of 20
Prepared By DAK ©2018
Department of Applied Computing and Information Technology
Faculty of Computing and Informatics
Makerere University Business School
Chap-5-Project Scheduling and Control Techniques BBC – II – Day & Evening
EXERCISE QUESTIONS
Question – One
Use the network diagram below and tabulate the list of tasks involved with their respective activity
duration and interdependencies. Develop a Gantt chart for this project based on the SF task
relationship.
Question – One
Required:
(a) Schedule the project using the AOA and AON technique
(b) What is the probability of completing the project in 36, 34, 32, 30, 28 weeks? Perform a
sensitivity analysis to determine the probability estimates.
(c) How many weeks would you estimate that are required to complete the project in case the project
manager wanted a 75% chance of being right?
(d) What are the chances of reaching event 4 by 13th Week?
(e) The contract schedule allows 18 weeks in which to complete the entire project. What are the
chances that the Project WILL NOT be finished on time?
Page 20 of 20
Prepared By DAK ©2018
Department of Applied Computing and Information Technology
Faculty of Computing and Informatics
Makerere University Business School