# Information Technology Project Management

Read Chapter 6 on Project Time Management in the Schwalbe text ( http://books.google.com/books?id=MPS_fT3diqAC&pg=PP25&lpg=PP25&dq=chapter+4+it+project+management+by+kathy+schwalbe+ppt&source=bl&ots=J_WlBkxkiU&sig=whsqI_43aAbAHziNcFL8nIDcK54&hl=en&sa=X&ei=PIgRUYXMN6PmyQHYvIGgBQ&sqi=2&ved=0CDcQ6AEwAg) and view the notes and example problem, including webcasts, on the critical path method, first. complete the scheduling problems given in the file SchedulingProblems . Also look at another document that I will upload ” note-example problem”

Save Time On Research and Writing
Hire a Pro to Write You a 100% Plagiarism-Free Paper.

E

xample Scheduling Problem

1

Save Time On Research and Writing
Hire a Pro to Write You a 100% Plagiarism-Free Paper.

v3

B

efore we can schedule a project, we will need to have done the following, in order:

–

I

dentify project objectives

–        Write project scope statement

–

D

evelop a WBS

–

G

enerate a complete detailed task list

The above can be considered progressive elaboration of scope,

A

nd 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:

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

–

C

alculate durations along all project paths

–

F

ind 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

20

04, 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

Activity                                                             Predecessor(s)    Duration

A-

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.

ES

none

0

D

A

8

9

12

A, B

12

132

C

19

137

5

187

J

10

192

K

202

 Activity Predecessor Duration EF A obtain your boss’s approval of your plan none 8 0 8 B obtain budget approval 12 12 C obtain systems development approval D 10 9 19 develop user specifications 1 E obtain a marketing program from mktg A, B 120 132 F obtain a mktg program from consultant 60 72 G review and select mktg program E, F 5 137 H perform systems dev of module contentS 80 99 I design system interface C, G 50 187 J review and approve systems development H, I 192 K test prototype 202 L revision and final systems development 20 222
 Example Problem – Network Diagram :

Sc

h

eduling Problems

C

omplete the following problems covering project scheduling methods.

1. Put the following project management activities in order, by defining immediate predecessors by placing one or more letters in the column labeled “

Immediate predecessor

”. One of them has been done for you.

 A ctivity Immediate predecessor a) Calculate durations along all project paths b) Calculate Te c) D efine immediate predecessors h d) Develop W B S e) Draw a network diagram f) E stimate task durations g) Find the critical paths h) Generate a complete, detailed task list i) Identify project objectives j) Write project scope statement

2. Draw network diagram for the following list of activities and their immediate predecessors. Draw start and end nodes.

Activity

Immediate predecessor

A

B

C
A, B

D

C

E
C

F

D

G

E

H
F, G

I
C

3

. Given the following detailed task list, draw a network diagram, including starting and ending nodes.

Immediate predecessor

A

B
A

C
A

D

B

E
C

F
D, E

4

. Identify all paths and their summed durations from the following detailed task list.

Estimated duration
Immediate Predecessors

A-define info req

2 wks

B- analyze existing infrastruc
1.

5

wks

C-define network req
1 wk.

B

D-design database
3 wks.

A

E-design network
2.

5 wks

.
C

F-implement

7 wks

.

D, E

G-test

4 wks.

F

H-document database
1 wk.

D

I-user documentation
2 wks.

C

5. What is/are the critical path(s) amongst the following paths through a project?

Path 1: A-B-D =

8

.5 mos.

Path 2: B-C-I-J = 10 mos.

Path 3: A-B-E = 5.5 mos.

Path 4: B-F-G-J = 12 mos.

6. What is the shortest possible completion time for a project, given the following paths through a project from start to finish?

A-B-D-F = 14 weeks

A-G = 22 weeks

A-C-H-I-J = 19 weeks

7. Identify all non-critical activities in the project with the following paths:

A-B-C = 22 weeks

B-J-K = 18 weeks

A-B-D-E = 22 weeks

A-B-I = 14 weeks

B-L = 20 weeks

8. Identify all non-critical activities for a project with the following paths

A-B-C = 10 days

A-B-D = 8 days

A-B-E-F = 8 days

A-B-G = 9 days

9. Develop an early start early finish (ES/EF) schedule for the following project.

A

2 wks

B

A

C

A

D

E

4

D

Activity

Duration

Predecessor

ES

EF

Develop specifications

Design

4

Documentation

5

Implementation

8

B, C

Testing

10. Develop an early start, early finish (ES/EF) schedule for the following project.

Activity

Duration

Predecessor

ES

EF

A

Develop specifications

B

Design

A

C

A

D

Implementation

B, C

E

D

8 wks

A

7 wks

 6 wks 5 wks User Documentation 7 wks 11 wks Acceptance Testing 8 wks F Develop marketing literature G Technical documentation B, C, F

PAGE

3

Order your essay today and save 25% with the discount code: GREEN

## Order a unique copy of this paper

600 words
We'll send you the first draft for approval by September 11, 2018 at 10:52 AM
Total price:
\$26