Information Technology Project Management
mdalsubaie
notes_-example_problem.docxExample Scheduling Problem 1 v3
Before we can schedule a project, we will need to have done the following, in order:
- Identify project objectives
- Write project scope statement
- Develop a WBS
- Generate a complete detailed task list
The above can be considered progressive elaboration of scope,
And then we need to:
- Define immediate predecessors
If we do all of these things, we can then define a network diagram that illustrates the interrelationship among activities, and the various paths throughout the project.
Before we can develop a schedule, using the critical path method, we also have to:
- Estimate task durations
The three (3) inputs to using the critical path method for scheduling are, therefore, (a) develop a detailed activity list with (b) immediate predecessors and (c) estimated task durations.
What I am going to show you now is how to develop a project schedule, in the following basic steps:
- Draw a network diagram
- Calculate durations along all project paths
- Find the critical path(s)
- Calculate Te
1. Draw network diagram for the following list of activities and their immediate predecessors. Draw start and end nodes. The project is to put a consulting company’s marketing plan on the Internet. (Olson 2004, p. 207 #12).
Activity Immediate predecessor
A none
B none
C D
D A
E A, B
F A, B
G E, F
H C
I C, G
J H, I
K J
L K
( See Network Diagram on Next)
2. Identify all paths from the network diagram above.
Paths
Path 1 – A-D-C-H-J-K-L
Path 2 – A-D-C-I-J-K-L
Path 3 – A-E-G-I-J-K-L
Path 4 – A-F-G-I-J-K-L
Path 5 – B-E-G-I-J-K-L
Path 6 – B-F-G-I-J-K-L
2. Identify all paths and their summed durations from the following
detailed task list.
Activity Predecessor(s) Duration
A-obtain your boss’s approval of your plan none 8 days
B-obtain budget approval none 12 days
C-obtain systems development approval D 10 days
D-develop user specifications A 1 day
E-obtain a marketing program from mktg A, B 120 days
F-obtain a mktg program from consultant A, B 60 days
G-review and select mktg program E, F 5 days
H-perform systems dev of module contents C 80 days
I-design system interface C, G 50 days
J-review and approve systems development H, I 5 days
K-test prototype J 10 days
L-revision and final systems development K 20 days
Path = Summed duration
Path 1 – A-D-C-H-J-K-L = 8+1+10+80+5+10+20 = 19 + 80 + 35 = 134 days
Path 2 – A-D-C-I-J-K-L = 19 + 50 + 35 = 104 days
Path 3 – A-E-G-I-J-K-L = 8 + 120 + 5 + 50 + 35 = 218 days
Path 4 – A-F-G-I-J-K-L = 8 + 60 + 5 + 50 + 35 = 158 days
Path 5 – B-E-G-I-J-K-L = 12+120+5+50+35 = 222 days
Path 6 – B-F-G-I-J-K-L = 222 – 120 + 60 = 162 days
3. What is/are the critical path(s) from the paths above?
Path 5 – B-E-G-I-J-K-L = 12+120+5+50+35 = 222 days
4. What is the shortest possible completion time for the project, Te?
222 days
5. Identify all non-critical activities in the project:
Activities A, C, D, and H do not fall on the critical path.
6. Develop an early start, early finish (ES/EF) schedule for the following project.
|
|
Activity |
Predecessor |
Duration |
ES |
EF |
|
A |
obtain your boss’s approval of your plan |
none |
8 |
0 |
8 |
|
B |
obtain budget approval |
none |
12 |
0 |
12 |
|
C |
obtain systems development approval |
D |
10 |
9 |
19 |
|
D |
develop user specifications |
A |
1 |
8 |
9 |
|
E |
obtain a marketing program from mktg |
A, B |
120 |
12 |
132 |
|
F |
obtain a mktg program from consultant |
A, B |
60 |
12 |
72 |
|
G |
review and select mktg program |
E, F |
5 |
132 |
137 |
|
H |
perform systems dev of module contentS |
C |
80 |
19 |
99 |
|
I |
design system interface |
C, G |
50 |
137 |
187 |
|
J |
review and approve systems development |
H, I |
5 |
187 |
192 |
|
K |
test prototype |
J |
10 |
192 |
202 |
|
L |
revision and final systems development |
K |
20 |
202 |
222 |
|
Example Problem - Network Diagram : |
|
|
