Project Netwok

Post on 30-May-2018

219 views 0 download

Transcript of Project Netwok

8/9/2019 Project Netwok

http://slidepdf.com/reader/full/project-netwok 1/38

Project Management

8/9/2019 Project Netwok

http://slidepdf.com/reader/full/project-netwok 2/38

Project

• A project is a temporary endeavour 

involving a connected sequence of activities

and a range of resources, which is designedto achieve a specific and unique outcome

and which operates within time, cost and

quality constraints .

2

8/9/2019 Project Netwok

http://slidepdf.com/reader/full/project-netwok 3/38

3

Characteristic of a project

q A unique, one-time operational activity or effort

q Requires the completion of a large number of interrelated

activities

q Established to achieve specific objective

q Resources, such as time and/or money, are limited

q Typically has its own management structure

8/9/2019 Project Netwok

http://slidepdf.com/reader/full/project-netwok 4/38

4

Examples

 – Constructing houses, factories, shopping malls.

 – Developing military weapons , aircrafts, new

ships

 – Launching satellite systems

 – Introducing new products into market

8/9/2019 Project Netwok

http://slidepdf.com/reader/full/project-netwok 5/38

5

What is project management

• The application of a collection of tools and

techniques to direct the use of diverse resources

towards the accomplishment of a unique, complex, one

time task within time, cost and quality constraints.

8/9/2019 Project Netwok

http://slidepdf.com/reader/full/project-netwok 6/38

6

Project Management Process

• Project  planning

• Project scheduling

• Project control

• Project team

 –  made up of individuals from various areas and departments

within a company

8/9/2019 Project Netwok

http://slidepdf.com/reader/full/project-netwok 7/38

7

Work breakdown structure

• A method of breaking down a project into individual elements

( activities and tasks) in a hierarchical structure which can be scheduled

and cost

8/9/2019 Project Netwok

http://slidepdf.com/reader/full/project-netwok 8/38

8

Project Planning

• Resource Availability and/or Limits – Due date, late penalties, early completion

incentives

 – Budget

• Activity Information

 – Identify all required activities

 – Estimate the resources required (time) to complete

each activity

 – Immediate predecessor(s) to each activity needed

to create interrelationships

8/9/2019 Project Netwok

http://slidepdf.com/reader/full/project-netwok 9/38

9

Project Scheduling and Control Techniques

Gantt Chart

Critical Path Method (CPM)

Program Evaluation and Review Technique (PERT)

8/9/2019 Project Netwok

http://slidepdf.com/reader/full/project-netwok 10/38

Graph or bar chart with a bar for each project activity that shows passage of time

Provides visual display of project scheduleProvides visual display of project schedule

Gantt Chart

8/9/2019 Project Netwok

http://slidepdf.com/reader/full/project-netwok 11/38

Project Network 

• Use of nodes and arrows

Arrows ² An arrow leads from tail to head directionally –  Indicate ACTIVITY, a time consuming effort that is required to perform a

 part of the work.

Nodes A node is represented by a circle

- Indicate EVENT, a point in time where one or more activities start and/or 

finish.

• Activity

 –  A task or a certain amount of work required in the project

 –  Requires time to complete

 –  Represented by an arrow

• Dummy Activity

 –  Indicates only precedence relationships

 –  Does not require any time of effort

8/9/2019 Project Netwok

http://slidepdf.com/reader/full/project-netwok 12/38

• Event

 –  Signals the beginning or ending of an activity

 –  Designates a point in time

 –  Represented by a circle (node)

•  Network 

 –  Shows the sequential relationships among activities using nodes

and arrows

Activity-on-node (AON)

nodes represent activities, and arrows show precedencerelationships

Activity-on-arrow (AOA)

arrows represent activities and nodes are events for points intime

Project Network 

AOA P j N k f H

8/9/2019 Project Netwok

http://slidepdf.com/reader/full/project-netwok 13/38

13

AOA Project Network for House

32 0

1

3

1 1

11 2 4 6 7

3

5

Lay

foundation

Design house

and obtain

financing

Order and

receive

materials

Dummy

Finishwork 

Select

carpet

Select

paint

Buildhouse

AON Project Network for House

13

22

43

31 5

1

61

71Start

Design house and

obtain financing

Order and receivematerials Select paint

Select carpet

Lay foundations Build house

Finish work 

8/9/2019 Project Netwok

http://slidepdf.com/reader/full/project-netwok 14/38

Situations in network diagram

AB

C

A must finish before either B or C can start

A

B

C  both A and B must finish before C can start

D

C

B

A both A and C must finish before either of 

B or D can start

A

C

B

D

Dummy

A must finish before B can start

 both A and C must finish before D can start

8/9/2019 Project Netwok

http://slidepdf.com/reader/full/project-netwok 15/38

CPM calculation

• Path

 – A connected sequence of activities leading from

the starting event to the ending event

• Critical Path

 – The path where there no time buffer, i.e. slack is

zero.

• Critical Activities

 – All of the activities that make up the critical path

F d P

8/9/2019 Project Netwok

http://slidepdf.com/reader/full/project-netwok 16/38

Forward Pass

• Earliest Start Time (ES)

 – earliest time an activity can start

 –  ES = maximum EF of immediate predecessors

• Earliest finish time (EF)

 –  earliest time an activity can finish

 – earliest start time plus activity time

EF= ES + t 

Latest Start Time (LS)

Latest time an activity can start without delaying critical pathtime

LS= LF - t 

Latest finish time (LF)

latest time an activity can be completed without delayingcritical path time

LS = minimum LS of immediate redecessors

Backward Pass

8/9/2019 Project Netwok

http://slidepdf.com/reader/full/project-netwok 17/38

CPM analysis

• Draw the CPM network 

• Analyze the paths through the network • Determine the float for each activity

 –  Compute the activity’s float

float = LS - ES = LF - EF

 –  Float is the maximum amount of time that this activity can be

delay in its completion before it becomes a critical activity,

i.e., delays completion of the project

• Find the critical path is that the sequence of activities and events

where there is no “slack” i.e.. Zero slack  –  Longest path through a network 

• Find the project duration is minimum project completion time

8/9/2019 Project Netwok

http://slidepdf.com/reader/full/project-netwok 18/38

CPM Example:

• CPM Network 

a, 6a, 6a, 6a, 6

f, 15f, 15f, 15f, 15

b, 8b, 8b, 8b, 8

c, 5c, 5c, 5c, 5

e, 9e, 9e, 9e, 9

d, 13d, 13d, 13d, 13

g, 17g, 17g, 17g, 17 h, 9h, 9h, 9h, 9

i, 6i, 6i, 6i, 6

 j, 12 j, 12 j, 12 j, 12

8/9/2019 Project Netwok

http://slidepdf.com/reader/full/project-netwok 19/38

CPM Example

• ES and EF Times

a, 6a, 6a, 6a, 6

f, 15f, 15f, 15f, 15

b, 8b, 8b, 8b, 8

c, 5c, 5c, 5c, 5

e, 9e, 9e, 9e, 9

d, 13d, 13d, 13d, 13

g, 17g, 17g, 17g, 17 h, 9h, 9h, 9h, 9

i, 6i, 6i, 6i, 6

 j, 12 j, 12 j, 12 j, 12

0 6

0 8

0 5

 

8/9/2019 Project Netwok

http://slidepdf.com/reader/full/project-netwok 20/38

CPM Example

• ES and EF Times

a, 6a, 6a, 6a, 6

f, 15f, 15f, 15f, 15

b, 8b, 8b, 8b, 8

c, 5c, 5c, 5c, 5

e, 9e, 9e, 9e, 9

d, 13d, 13d, 13d, 13

g, 17g, 17g, 17g, 17 h, 9h, 9h, 9h, 9

i, 6i, 6i, 6i, 6

 j, 12 j, 12 j, 12 j, 12

0 6

0 8

0 5

5 14

8 21

6 23

6 21

8/9/2019 Project Netwok

http://slidepdf.com/reader/full/project-netwok 21/38

CPM Example

• ES and EF Times

a, 6a, 6a, 6a, 6

f, 15f, 15f, 15f, 15

b, 8b, 8b, 8b, 8

c, 5c, 5c, 5c, 5

e, 9e, 9e, 9e, 9

d, 13d, 13d, 13d, 13

g, 17g, 17g, 17g, 17 h, 9h, 9h, 9h, 9

i, 6i, 6i, 6i, 6

 j, 12 j, 12 j, 12 j, 12

0 6

0 8

0 5

5 14

8 21 21 33

6 2321 30

23 29

6 21

Project’s EF = 33Project’s EF = 33

8/9/2019 Project Netwok

http://slidepdf.com/reader/full/project-netwok 22/38

8/9/2019 Project Netwok

http://slidepdf.com/reader/full/project-netwok 23/38

CPM Example

• Critical Path

a, 6a, 6a, 6a, 6

f, 15f, 15f, 15f, 15

b, 8b, 8b, 8b, 8

c, 5c, 5c, 5c, 5

e, 9e, 9e, 9e, 9

d, 13d, 13d, 13d, 13

g, 17g, 17g, 17g, 17 h, 9h, 9h, 9h, 9

i, 6i, 6i, 6i, 6

 j, 12 j, 12 j, 12 j, 12

8/9/2019 Project Netwok

http://slidepdf.com/reader/full/project-netwok 24/38

PERT• PERT is based on the assumption that an activity’s duration follows a

 probability distribution instead of being a single value

• Three time estimates are required to compute the parameters of anactivity’s duration distribution:

 –  pessimistic time (t p ) - the time the activity would take if things did

not go well

 –  most likely time (tm ) - the consensus best estimate of the activity’s

duration –  optimistic time (to ) - the time the activity would take if things did go

well

Mean (expected time): t e= t p + 4 tm + to

6

Variance: Vt =σ  

 2

=

t p - to

6

2

8/9/2019 Project Netwok

http://slidepdf.com/reader/full/project-netwok 25/38

Probability computation

Determine probability that project is completed within specified

time

Z =x - µ

σ

where µ = t p = project mean time

 σ = project standard mean time

x = (proposed ) specified time

8/9/2019 Project Netwok

http://slidepdf.com/reader/full/project-netwok 26/38

 Normal Distribution of Project Time

µ = t  p Time x 

 Z σ

Probability

8/9/2019 Project Netwok

http://slidepdf.com/reader/full/project-netwok 27/38

PERT Example

Immed. Optimistic Most Likely Pessimistic

Activity Predec. Time (Hr.) Time (Hr.) Time (Hr.)A -- 4 6 8

B -- 1 4.5 5

C A 3 3 3

D A 4 5 6

E A 0.5 1 1.5

F B,C 3 4 5

G B,C 1 1.5 5H E,F 5 6 7

I E,F 2 5 8

J D,H 2.5 2.75 4.5

K G,I 3 5 7

8/9/2019 Project Netwok

http://slidepdf.com/reader/full/project-netwok 28/38

PERT Example

 

AA

DD

CC

BB

FF

EE

GG

II

HH

KK

JJ

 

PERT Network 

8/9/2019 Project Netwok

http://slidepdf.com/reader/full/project-netwok 29/38

PERT Example

  Activity Expected Time Variance

  A 6 4/9B 4 4/9

C 3 0

D 5 1/9

E 1 1/36F 4 1/9

G 2 4/9

H 6 1/9

I 5 1J 3 1/9

K 5 4/9

8/9/2019 Project Netwok

http://slidepdf.com/reader/full/project-netwok 30/38

PERT Example

  Activity ES EF LS LF Slack A 0 6 0 6 0 *critical

B 0 4 5 9 5

C 6 9 6 9 0 *

D 6 11 15 20 9E 6 7 12 13 6

F 9 13 9 13 0 *

G 9 11 16 18 7

H 13 19 14 20 1

I 13 18 13 18 0 *J 19 22 20 23 1

K 18 23 18 23 0 *

8/9/2019 Project Netwok

http://slidepdf.com/reader/full/project-netwok 31/38

PERT Example

V path = VA + VC + VF + VI + VK 

= 4/9 + 0 + 1/9 + 1 + 4/9

= 2

σ path = 1.414

z = (24 - 23)/σ = (24-23)/1.414 = .71

From the Standard Normal Distribution table:P(z < .71) = .5 + .2612 = .7612

8/9/2019 Project Netwok

http://slidepdf.com/reader/full/project-netwok 32/38

PROJECT COST

8/9/2019 Project Netwok

http://slidepdf.com/reader/full/project-netwok 33/38

Project Crashing

• Crashing

 –  reducing project time by arranging additional resources

• Crash time

 –  an amount of time an activity is reduced

• Crash cost

 –  cost of reducing activity time

• Goal

 –  reduce project duration at minimum cost

8/9/2019 Project Netwok

http://slidepdf.com/reader/full/project-netwok 34/38

Activity crashing

                                                                                                                                                                                                                                                                                                                                       A                                                                                                                                                                                                                              c                                                                                                                                                                                                                                                                                                       t                                                                                                                                                                                                                                                                                                                                                     i                                                                                                                                                                                                                          v       

                                                                                                                                                                                                                                                                                                                                                i                                                                                                                                                                                                                                                                                                 t                                                                                                                                                                                                                             y                                                                                                                                                                                                                                                                                                                                      c                                                                                                                                                                                                                                     o       

                                                                                                                                                                                                                              s                                                                                                                                                                                                                                                                                                       t    

Activity time

Crashing activity

Crash

time

Crash

cost

 Normal Activity

 Normal

time

 Normal

cost

Slope = crash cost per unit time

Ti C d

8/9/2019 Project Netwok

http://slidepdf.com/reader/full/project-netwok 35/38

Time Cost data

Activity Normaltime  Normalcost Rs Crashtime Crashcost Rs Allowablecrash time slope

1

2

34

5

6

7

12

8

412

4

4

4

3000

2000

400050000

500

500

1500

7

5

39

1

1

3

5000

3500

700071000

1100

1100

22000

5

3

13

3

3

1

400

500

30007000

200

200

7000

75000 110700

Practice Example

8/9/2019 Project Netwok

http://slidepdf.com/reader/full/project-netwok 36/38

darla/smbs/vit

Practice ExampleA social project manager is faced with a project with the following

activities:

Activity Description Duration

Social work team to live in village 5w

Social research team to do survey 12w

Analyse results of survey 5w

Establish mother & child health program 14w

Establish rural credit programme 15w

Carry out immunization of under fives 4w

Draw network diagram and show the critical path.

Calculate project duration.

Practice problem

8/9/2019 Project Netwok

http://slidepdf.com/reader/full/project-netwok 37/38

Practice problemActivity Description Duration

1-2 Social work team to live in village 5w

1-3 Social research team to do survey 12w

3-4 Analyse results of survey 5w

2-4 Establish mother & child health program 14w

3-5 Establish rural credit programme 15w

4-5 Carry out immunization of under fives 4w

3

1

2

4

5

8/9/2019 Project Netwok

http://slidepdf.com/reader/full/project-netwok 38/38