project scheduling professor stephen lawrence leeds school of business university of colorado...

50
Project Scheduling Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO 80309-0419

Post on 19-Dec-2015

214 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: Project Scheduling Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO 80309-0419

Project Scheduling

Professor Stephen LawrenceLeeds School of Business

University of Colorado

Boulder, CO 80309-0419

Page 2: Project Scheduling Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO 80309-0419

2

Project Management

Management complex projects

Many parallel tasks

Deadlines and milestones must be met

Difficult to know “what to do first”

Difficult to know when project is in trouble

Often have competition for limited resources

When to use:

Page 3: Project Scheduling Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO 80309-0419

3

Examples

Building a new airport

Designing a new computer product

Launching an advertising campaign

Construction projects of all types

Maintenance projects

Curriculum reviews

Page 4: Project Scheduling Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO 80309-0419

4

Project Mgmt Techniques

Critical Path Method (CPM) Developed by DuPont (1950’s) Plan and control maintenance of chemical plants Credited with reducing length of maintenance

shutdown by 40%

Project Evaluation and Review Technique (PERT) Developed by Navy (early 1960’s) Plan and control the Polaris missile project Credited with speeding up project by 2 years

Page 5: Project Scheduling Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO 80309-0419

Critical Path Method(CPM)

Page 6: Project Scheduling Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO 80309-0419

6

Critical Path Method (CPM)

Graphical method of portraying relationship of project activitiesAn activity is any discrete part or task of a project which takes resources and time to completeActivities exhibit precedence relations (some must be completed before others can start)Activities with their precedence relations form a project networkCritical Path Method finds the longest path through the resulting project network

Page 7: Project Scheduling Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO 80309-0419

7

Precedence Relations

Activity Immediate Predecessor Duration (days)

A (Start) 4B A 3C A 5D B, C 2

Page 8: Project Scheduling Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO 80309-0419

8

Simple Project Network

AA

BB

CC

DD

Project Network

Activity “A”proceeds “B”

“Activity on Node” representation

Represent precedence relations as “arcs”

Page 9: Project Scheduling Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO 80309-0419

9

Activity Start/Finish Times

ES

LS

EF

LF

ActivityName

ActivityDuration

EarlyFinishTime

LateFinishTime

EarlyStartTime

LateStartTime

Page 10: Project Scheduling Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO 80309-0419

10

Finding the Critical Path

A D

C

B

4

3

5

2

Page 11: Project Scheduling Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO 80309-0419

11

Finding the Critical Path

A D

C

B

4

3

5

20

Start attime t=0

Page 12: Project Scheduling Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO 80309-0419

12

Finding the Critical Path

A D

C

B

4

3

5

24

0+4=4

0

Page 13: Project Scheduling Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO 80309-0419

13

Finding the Critical Path

A D

C

B

4

3

5

20

4

4

4

Page 14: Project Scheduling Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO 80309-0419

14

Finding the Critical Path

A D

C

B

4

3

5

20 4

7

9

4

4

Page 15: Project Scheduling Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO 80309-0419

15

Finding the Critical Path

A D

C

B

4

3

5

20 4

4

4

7

9

?

Page 16: Project Scheduling Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO 80309-0419

16

Finding the Critical Path

A D

C

B

4

3

5

20 4

4

4

7

9

9

Page 17: Project Scheduling Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO 80309-0419

17

Finding the Critical Path

A D

C

B

4

3

5

20 4

4

4

7

9

9 11

The earliest the project can complete is t =11

Page 18: Project Scheduling Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO 80309-0419

18

Finding the Critical Path

A D

C

B

4

3

5

20 4

4

4

7

9

9 11

11

Page 19: Project Scheduling Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO 80309-0419

19

Finding the Critical Path

A D

C

B

4

3

5

20 4

4

4

7

9

9 11

119

9

9

6

4

Page 20: Project Scheduling Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO 80309-0419

20

Finding the Critical Path

A D

C

B

4

3

5

20 4

4

4

7

9

9 11

119

9

9

6

4

?

Page 21: Project Scheduling Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO 80309-0419

21

Finding the Critical Path

A D

C

B

4

3

5

20 4

4

4

7

9

9 11

119

9

9

6

4

40

Page 22: Project Scheduling Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO 80309-0419

22

Finding the Critical Path

A D

C

B

4

3

5

20 4

4

4

7

9

9 11

119

9

9

6

4

40

Define Activity Slack:S = LST-EST = LFT-EFT

Page 23: Project Scheduling Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO 80309-0419

23

Finding the Critical Path

A D

C

B

4

3

5

20 4

4

4

7

9

9 11

119

9

9

6

4

40

S=0-0=4-4=0

S=9-7=2

S=11-11=0

S=9-9=0

Page 24: Project Scheduling Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO 80309-0419

24

A

Finding the Critical Path

D

C

B

4

3

5

20 4

4

4

7

9

9 11

119

9

9

6

4

40

S=0 S=0

S=0

S=2Critical Path: Path with

zero activity slacks

Page 25: Project Scheduling Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO 80309-0419

25

CPM TerminologyCritical Path: the chain of activities along which the delay of any activity will delay the projectEarly Start Time (ES): the earliest that an activity could possibly start, given precedence relationsLate Start Time (LS): the latest that an activity could possibly start without delaying the projectEarly Finish Time (EF): the earliest that an activity could possibly finishLate Finish Time (LF): the latest that an activity could possibly finish without delaying the projectActivity Slack: the amount of “play” in the timing of the activity; slack = LST-EST = LFT-EFT

Page 26: Project Scheduling Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO 80309-0419

26

ExampleSuppose you are an advertising manager responsible forthe launch of a new media advertising campaign. Thecampaign (project) has the following activities:

Activity Predecessors TimeA. Media bids none 2 wksB. Ad concept none 6C. Pilot layouts B 3D. Select media A 8E. Client check-off A,C 6F. Pre-production B 8G. Final production E,F 5H. Launch campaign D,G 0

Page 27: Project Scheduling Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO 80309-0419

27

Example Project Network

A2

A2

B6

B6

F8

F8

D8D8

C3

C3

E6

E6

G5

G5

H0

H0StartStart

Page 28: Project Scheduling Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO 80309-0419

Program Evaluation and Review Technique (PERT)

Page 29: Project Scheduling Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO 80309-0419

29

PERT

Similar to Critical Path Method (CPM)Accounts for uncertainty in activity duration estimatesProvides estimates of project duration probabilitiesBest used for highly uncertain projects new product development unique or first-time projects research and development

Page 30: Project Scheduling Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO 80309-0419

30

Simple Project Network

AA

BB

CC

DD

Page 31: Project Scheduling Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO 80309-0419

31

A Simple Example

MostOptimistic

MostLikely

MostPessimistic

Activity

2 10A1 7B4 6C

0.5 5.5D

3

2.55

1.5

ma b

Page 32: Project Scheduling Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO 80309-0419

32

Distribution AssumptionAssume a “Beta” distribution

activity duration

dens

ity

ma b

Page 33: Project Scheduling Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO 80309-0419

33

Expected Duration & Variance

Expected Time =

Variance =

a + 4m + b6

(b - a)2

36

For the Beta Distribution:

Page 34: Project Scheduling Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO 80309-0419

34

Distribution Assumption

activity duration

dens

ity

ma b

expectedduration

Page 35: Project Scheduling Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO 80309-0419

35

Expected Duration & Variance

ET =

Var =

a + 4m + b6

(b - a)2

36

=2+4(3)+10

6= 4.0

=(10-2)2

36 = 1.778

Activity A

Page 36: Project Scheduling Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO 80309-0419

36

Expected Duration & Variance

ExpectedTime

VarianceCriticalPath?

Activity

4 1.778A3 1.0B5 0.111C2 0.694D

????

Page 37: Project Scheduling Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO 80309-0419

37

Critical Path of the Example

A D

C

B

4

3

5

2

Critical Path Duration = 11 days

Page 38: Project Scheduling Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO 80309-0419

38

Time and Variance Example

ExpectedTime

VarianceCriticalPath?

Activity

4 1.778 A3 1.0 noB5 0.111 C2 0.694 D

Page 39: Project Scheduling Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO 80309-0419

39

Probability of CompletionWhat is the probability that a project will be completed by a specified due date?

Due Date - Expected Completion Date

Sum of the Variances on the Critical Pathz =

NormalDistribution

z

Due Date

Expected Completion

Page 40: Project Scheduling Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO 80309-0419

40

Completion Probability Example

What is the probability of completing the project within 12 days?

z = 12 - 111.778 + 0.111 + 0.694

= 0.622

From a Z-table for standard Normal distributions:

Probability of completion = 0.7324 = 73.2%

Page 41: Project Scheduling Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO 80309-0419

41

Larger Example

(a) (m) (b)Activity Preds Optimistic Likely Pessimistic

A. none 1 2 3 wks B. none 4 6 8 C. B 3 3 3 D. A 2 8 10 E. A,C 3 6 9 F. B 1 8 15 G. E,F 4 5 6 H. D,G 0 0 0

Suppose the duration of the activities of the adcampaign are, in fact, uncertain:

Page 42: Project Scheduling Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO 80309-0419

42

Activity DSuppose the duration of the activities of the adcampaign are, in fact, uncertain:

(a) (m) (b)Activity Preds Optimistic Likely Pessimistic

A. none 1 2 3 wks B. none 4 6 8 C. B 3 3 3

D. A 2 8 10 E. A,C 3 6 9 F. B 1 8 15 G. E,F 4 5 6 H. D,G 0 0 0

Page 43: Project Scheduling Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO 80309-0419

43

Activity D

Variance of Activity Duration for “D”:

Var = (b - a)2

36 =

(10-2)2

36 = 1.78

Expected Activity Duration for “D”:

ET =a + 4m + b

6=

2+4(8)+106

= 7.33

Page 44: Project Scheduling Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO 80309-0419

44

Project Duration Statistics

A. 2 0.11 B. 6 0.44 C. 3 0.00 E. 6 1.00 F. 8 5.44 G. 5 0.11 H. 0 0.00

Activity Critical? Mean Var C.P. Var

D. 7.33 1.78

Page 45: Project Scheduling Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO 80309-0419

45

Example Project Network

A2

A2

B6

B6

F8

F8

DD

C3

C3

E6

E6

G5

G5

H0

H0StartStart

Critical Path Duration = 20 days

7.33

Page 46: Project Scheduling Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO 80309-0419

46

Project Duration Statistics

Activity Critical? Mean Var C.P. Var A. 2 0.11 B. 6 0.44 C. 3 0.00 D. 7.33 1.78 E. 6 1.00 F. 8 5.44 G. 5 0.11 H. 0 0.00

Critical Path Variance = 2 = 1.55

YesYes

Yes

YesYes

0.440.00

1.00

0.110.00

Page 47: Project Scheduling Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO 80309-0419

47

Using Project Statistics

What is the probability that the ad campaign can be completed in 18 weeks? 20? 24?

18 weeks: Z = x -

18 - 20sqrt(1.55)= = -1.61

Prob(x<18) = 1 - 0.9463 = 0.054 or 5.4%

Corresponding probability from standard normal Z-Table is 0.9463:

Page 48: Project Scheduling Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO 80309-0419

48

Using Project Statistics

What is the probability that the ad campaign can be completed in 18 weeks? 20? 24?

18 weeks: Z = -1.61 Prob(x<18) = 5.4%

20 weeks: Z = 0.00 Prob(x<20) = 50%

24 weeks: Z = 3.21 Prob(x<24) = 99.93%

Page 49: Project Scheduling Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO 80309-0419

49

Other Project Mgmt TechniquesProject crashing where to devote extra resources to reduce

activity/project durations while minimizing costs

Resource leveling how to schedule resources (equipment, people) to

minimizes peaks and valleys

Multiple resource scheduling how to schedule resources when activities can require

more than one resource type

Cash flow and budgeting combine cash and budget information with project

scheduling to track expenditures, project cash flows

Page 50: Project Scheduling Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO 80309-0419

50

Further Information

Project Management Institute (PMI)www.PMI.org

Professional organization of project managers

Offers a certification in project management