0% found this document useful (0 votes)
76 views3 pages

Time Management Problem Set

This document provides a time management problem set for an IT project management course. It includes an 8-activity project with predecessor relationships and probabilistic time estimates. It asks the student to: 1) Calculate the expected time for each activity 2) Draw the arrow diagram network 3) List all paths through the network and their durations 4) Identify the critical path

Uploaded by

Th3Hunger
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
76 views3 pages

Time Management Problem Set

This document provides a time management problem set for an IT project management course. It includes an 8-activity project with predecessor relationships and probabilistic time estimates. It asks the student to: 1) Calculate the expected time for each activity 2) Draw the arrow diagram network 3) List all paths through the network and their durations 4) Identify the critical path

Uploaded by

Th3Hunger
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Business Informatics & Operations Department

IT Project Management (INSY714/HUMA1001)


Spring 2022

Time Management Problem Set


A project consists of 8 activities, lettered A through H. below. For each activity, the
preceding activity is given, and a probabilistic estimate of the time required completing it.
Times are in days.

Preceding Optimistic Most Likely Pessimistic


Activity Activity Time Time Time
A - 2 days 4 days 6 days
B A 3 6 9
C A 2 5 11
D - 2 10 12
E C 4 8 15
F B, E 2 4 12
G D 3 4 11
H F, G 1 1 1
a) Determine the expected time for each activity
b) Use the arrow diagramming method (ADM) to draw the network of this project
c) List all of the paths through the network. What is the duration of each path?
d) What is the critical path?
Business Informatics & Operations Department
IT Project Management (INSY714/HUMA1001)
Spring 2022

Solution
a)
optimum + 4 ∗ most_likely + pessimestic
Expected Time =
6
2+4∗4+6
Example: Expected Time𝐴 = =4
6

Expected
Activity Time
A 4 days
B 6
C 5.5
D 9
E 8.5
F 5
G 5
H 1

b)

B=6
2 4

3
H=1
1 6 7

5
Business Informatics & Operations Department
IT Project Management (INSY714/HUMA1001)
Spring 2022
c)
ABFH – 16
ACEFH – 24 (Critical Path)
DGH – 15

d) Critical Path = ACEFH

You might also like