This action might not be possible to undo. Are you sure you want to continue?

BooksAudiobooksComicsSheet Music### Categories

### Categories

### Categories

### Publishers

Scribd Selects Books

Hand-picked favorites from

our editors

our editors

Scribd Selects Audiobooks

Hand-picked favorites from

our editors

our editors

Scribd Selects Comics

Hand-picked favorites from

our editors

our editors

Scribd Selects Sheet Music

Hand-picked favorites from

our editors

our editors

Top Books

What's trending, bestsellers,

award-winners & more

award-winners & more

Top Audiobooks

What's trending, bestsellers,

award-winners & more

award-winners & more

Top Comics

What's trending, bestsellers,

award-winners & more

award-winners & more

Top Sheet Music

What's trending, bestsellers,

award-winners & more

award-winners & more

P. 1

project scheduling|Views: 45|Likes: 0

Published by suganyababumba

prpoduction

prpoduction

Categories:Types

Published by: suganyababumba on Jul 17, 2013

Copyright:Attribution Non-commercial

See more

See less

https://www.scribd.com/doc/154246505/project-scheduling

08/01/2014

text

original

- 5.2 Identifying the Activities of a Project
- 5.3 The PERT/CPM Approach for Project Scheduling
- 5.4 A Linear Programming Approach to PERT/CPM
- 5.5 Obtaining Results Using Excel
- 5.6 Gantt Charts
- 5.7 Resource Leveling and Resource Allocation
- 5.8 The Probability Approach to Project Scheduling
- 5.9 Cost Analysis Using the Expected Value Approach
- 5.10 Cost Analyses Using
- 7.11 PERT/COST

**Project Scheduling Models
**

1

5.1 Introduction

• A project is a collection of tasks that must be completed in minimum time or at minimal cost. • Objectives of Project Scheduling

– Completing the project as early as possible by determining the earliest start and finish of each activity. – Calculating the likelihood a project will be completed within a certain time period. – Finding the minimum cost schedule needed to complete the project by a certain date.

2

5.1 Introduction

• A project is a collection of tasks that must be completed in minimum time or at minimal cost. • Objectives of Project Scheduling

– Investigating the results of possible delays in activity’s completion time. – Progress control. – Smoothing out resource allocation over the duration of the project.

3

4 .Task Designate • Tasks are called “activities. – Activity completion time is related to the amount of resources committed to it.” – Estimated completion time (and sometimes costs) are associated with each activity. – The degree of activity details depends on the application and the level of specificity of data.

2 Identifying the Activities of a Project • To determine optimal schedules we need to – Identify all the project’s activities.5. • Based on this information we can develop managerial tools for project control. – Determine the precedence relations among activities. 5 .

INC. • It is about to design.Identifying Activities. Example KLONE COMPUTERS. and market the Klonepalm 2000 palmbook computer. manufacture. 6 . • KLONE Computers manufactures personal computers.

– Advertise the new computer. – Train staff and vendor representatives. • 7 . INC • There are three major tasks to perform: – Manufacture the new computer. • The chart gives a concise set of tasks and their immediate predecessors. KLONE needs to develop a precedence relations chart.KLONE COMPUTERS.

KLONE COMPUTERS. INC Activity A Manufacturing activities B C D Description Prototype model design Purchase of materials Manufacture of prototype model Revision of design E Training activities F G H Initial production run Staff training Staff input on prototype models Sales training Pre-production advertising campaign Post-redesign advertising campaign Advertising activities I J 8 .

9 A B . because it must be competed just prior to the commencement of B. INC From the activity description chart. Activity A is an immediate predecessor of activity B. we can determine immediate predecessors for each activity.KLONE COMPUTERS.

F 14 D 28 A 30 D.I 45 10 . INC Precedence Relationships Chart Activity A B C D E F G H I J Immediate Estimated Predecessor Completion Time None 90 A 15 B 5 G 20 D 21 A 25 C.KLONE COMPUTERS.

**5.3 The PERT/CPM Approach for Project Scheduling
**

• The PERT/CPM approach to project scheduling uses network presentation of the project to

– Reflect activity precedence relations – Activity completion time

• PERT/CPM is used for scheduling activities such that the project’s completion time is minimized.

11

**KLONE COMPUTERS, INC. - Continued
**

• Management at KLONE would like to schedule the activities so that the project is completed in minimal time. • Management wishes to know:

– The earliest and latest start times for each activity which will not alter the earliest completion time of the project.

– The earliest finish times for each activity which will not alter this date. – Activities with rigid schedule and activities that have slack in their schedules.

12

**Earliest Start Time / Earliest Finish Time
**

• Make a forward pass through the network as follows:

– Evaluate all the activities which have no immediate predecessors.

• The earliest start for such an activity is zero ES = 0. • The earliest finish is the activity duration EF = Activity duration.

– Evaluate the ES of all the nodes for which EF of all the immediate predecessor has been determined.

• ES = Max EF of all its immediate predecessors. • EF = ES + Activity duration.

**– Repeat this process until all nodes have been evaluated
**

• EF of the finish node is the earliest finish time of the project.

13

Earliest Start / Earliest Finish – Forward Pass 90.149 D D 20 177 149.90 A A 90 90.165 194 149.129 G G 14 0.124 115.105 B B 15 105.110 C C 5 170 149.115 F F 25 129.170 E E 21 110.120 II 30 120.194 J J 45 14 .177 H 194 H 28 EARLIEST FINISH 90.

– Repeat this process backward until all nodes have been evaluated. • LS = LF .Latest start time / Latest finish time • Make a backward pass through the network as follows: – Evaluate all the activities that immediately precede the finish node. • The latest start for such an activity is LS = LF . – Evaluate the LF of all the nodes for which LS of all the immediate successors has been determined. • The latest finish for such an activity is LF = minimal project completion time.activity duration. • LF = Min LS of all its immediate successors.Activity duration. 15 .

90 90.177 115.173 166.149 149.110 110.149 129.90 0.115 149.95 A A 90 29.120 119.149 I I 30 129. 115 F F 25 90.110 B B 15 105.149 D D H G 129.149 129.170 173.194 194 J 45 16 J .149 153.105 95.129 129.194 129.166 H G 129.119 0.115 90.Latest Start / Latest Finish – Backward Pass C C 5 90.129 129.194 E E 21 5.149 146.149 20 28 14 129.149 115.194 149.149 149.

Slack Times • Activity start time and completion time may be delayed by planned reasons as well as by unforeseen reasons. • Some of these delays may affect the overall completion date. and form the critical path. we calculate the slack time. 17 . • To learn about the effects of these delays.

ES = LF . Slack Time = LS .EF 18 .Slack Times – Slack time is the amount of time an activity can be delayed without delaying the project completion date. assuming no other delays are taking place in the project.

149 119 .90 110 .105 119 .149 Slack 0 5 5 0 24 0 0 17 29 0 Critical activities must be rigidly scheduled 19 .Slack time in the Klonepalm 2000 Project Activity A B C D E F G H I J LS .90 115 .90 149 .115 166 .119 173 .149 90 .ES 0 -0 95 .

20 .The Critical Path • The critical path is a set of activities that have no slack. • The sum of the completion times for the activities on the critical path is the minimal completion time of the project. connecting the START node with the FINISH node. • A critical path is the longest path in the network. • The critical activities (activities with 0 slack) form at least one critical path in the network.

194 149.120 119.90 0.177 166.129 115.129 G G 14 149. 115 F F 25 90.105 95.149 I I 30 C C 5 105.149 D D 20 E E 21 149.115 90.90 A A 90 B B 15 90.110 0.194 J J 45 21 .110 110.The Critical Path 90.149 129.170 173.115 115.194 129.194 H H 28 149.

22 . • Under certain conditions the overall project completion time will be delayed. – Multiple delays.Possible Delays • We observe two different types of delays: – Single delays. • The conditions that specify each case are presented next.

• A delay of a certain amount in a non-critical activity will delay the project by the amount the delay exceeds the slack time. the entire project is not delayed. When the delay is less than the slack. causes the entire project to be delayed by the same amount.Single delays • A delay of a certain amount in a critical activity. 23 .

Multiple delays of non critical activities: Case 1: Activities on different paths ES=149 B 15 C 5 DELAYED START=149+15=164 LS=173 E 21 A 90 F 25 G 14 D 20 H 28 Activity E and I are each delayed 15 days. THE PROJECT COMPLETION TIME IS NOT DELAYED DELAYED START=90+15 =105 ES=90 I 30 J 45 24 LS =119 .

90 90 A B C D 15 105 115 5 129 149 20 21 194 E F G Gantt chart demonstration of the (no) effects on the project completion time when delaying activity “I” and “E” by 15 days. 194 25 Activity E 14 28 30 45 H I J Activity I 25 .

separated by critical activities.Multiple delays of non critical activities: Case 2: Activities are on the same path. activity E is delayed 15 days THE PROJECT COMPLETION TIME IS NOT DELAYED I 30 J 45 26 . ES=90 DELAYED START =94 LS =95 ES=149 DELAYED START=149+15 =164 LS =173 B 15 C 5 E 21 A 90 F 25 G 14 D 20 H 28 Activity B is delayed 4 days.

THE PROJECT COMPLETION TIME IS DELAYED 3 DAYS I 30 J 45 27 . no critical activities separating them. C LS =110 3 DAYS DELAY IN THE ENTIRE PROJECT 5 E 21 A 90 F 25 G 14 D 20 H 28 Activity B is delayed 4 days.Multiple delays of non critical activities: Case 2: Activities are on the same path. ES= 90 DELAYED START =94 DELAYED FINISH = 94+15=109 B 15 DELAYED START= 109 + 4 =113. Activity C is delayed 4 days.

B. 28 . ….J – X(FIN) = Finish time of the project • Objective function – Complete the project in minimum time.4 A Linear Programming Approach to PERT/CPM • Variables – Xi = The start time of the activities for i=A. C. • Constraints – For each arc L M a constraint states that the start time of M must not occur before the finish time of its immediate predecessor.5. L.

The objective then is Minimize X(FIN) While this objective function is intuitive other objective functions provide more information. 29 . and are presented later.A Linear Programming Approach Define X(FIN) to be the finish time of the project.

A Linear Programming Approach Minimize X(FIN) ST X(FIN) XE + 21 C 5 F 25 G All X s are nonnegative XJ XI + 30 X(FIN) XH + 28 X(FIN) XJ + 45 XD XG + 14 XE XD + 20 XH XD + 20 XJ XD + 20 XG XC+ 5 XG XF+ 25 XI XD+ 90 XF XA+ 90 30 .

The project completion time is minimized. 31 .T. X(FIN) = 194 and all the other constraints as before.A Linear Programming Approach Minimize XA+XB+…+XJ This objective function ensures that the optimal X values are the earliest start times of all the activities. Maximize XA+XB+…+XJ S. This objective function and the additional constraint ensure that the optimal X values are the latest start times of all the activities.

5. Advertise I Post. the variance on one critical path of interest. Advertise J * m 90 15 5 20 21 25 14 28 30 45 s s2 ES 0 90 105 129 149 90 115 149 90 149 EF 90 105 110 149 170 115 129 177 120 194 LS 0 95 110 129 173 90 115 166 119 149 LF 90 110 115 149 194 115 129 194 149 194 Slack 0 5 5 0 24 0 0 17 29 0 32 . enter in gold box.5 Obtaining Results Using Excel CRITICAL PATH ANALYSIS MEAN 194 STANDARD DEVIATION* 0 * Assumes all critical activities are on one critical path If not. VARIANCE* 0 PROBABILITY COMPLETE BEFORE = Acitivty Node Critical Design A * Materials B Manufacture C Design Revision D * Production Run E Staff Training F * Staff Input G * Sales Training H Preprod.

• A Gantt Chart is a graphical presentation that displays activities as follows: – Time is measured on the horizontal axis. A horizontal bar is drawn proportionately to an activity’ s expected completion time. 33 . • In an earliest time Gantt chart each bar begins and ends at the earliest start/finish the activity can take place. – Each activity is listed on the vertical axis.5.6 Gantt Charts • Gantt charts are used as a tool to monitor and control the project progress.

Here„s how we build an Earliest Time Gantt Chart for KLONEPALM 2000 34 .

I 45 105 115 129 5 20 21 194 149 194 15 25 14 28 30 45 35 .90 90 A B C D E F G H I J Immediate Estimated Activity Predecessor Completion CompletionTime Time A None 90 B A 15 C B 5 D G 20 E D 21 F A 25 G C.F 14 H D 28 I A 30 J D.

Gantt ChartsMonitoring Project Progress • Gantt chart can be used as a visual aid for tracking the progress of project activities. • The manager can easily see if the project is progressing on schedule (with respect to the earliest possible completion times). • Appropriate percentage of a bar is shaded to document the completed work. 36 .

Monitoring Project Progress 90 A B C D E F G H I J 15 5 194 20 21 194 The shaded bars represent completed work BY DAY 135. 25 14 Do not conclude that the project is behind schedule. Activity “I” has a slack and therefore can be delayed!!! 28 30 45 135 37 .

– Provides a schedule of earliest possible start and finish times of activities. 38 . – Does not show whether the project is behind schedule. thus on the project completion time.Gantt Charts – Advantages and Disadvantages • Advantages. – Easy to construct – Gives earliest completion date. • Disadvantages – Gives only one possible schedule (earliest). – Does not demonstrate the effects of delays in any one activity on the start of another activity.

5. 39 .7 Resource Leveling and Resource Allocation • It is desired that resources are evenly spread out throughout the life of the project. • Resource leveling methods (usually heuristics) are designed to: – Control resource requirements – Generate relatively similar usage of resources over time.

• Costs can be allocated equally throughout an activity duration. Step 1: Consider the schedule that begins each activity at its ES. but within the time period between their ES and LF.Resource Leveling – A Heuristic • A heuristic approach to “level” expenditures – Assumptions • Once an activity has started it is worked on continuously until it is completed. Step 2: Determine which activity has slack at periods of peak spending. 40 . Step 3: Attempt to reschedule the non-critical activities performed during these peak periods to periods of less spending.

. – Daily expenditures are kept as constant as possible.Resource Leveling – KLONE COMPUTERS. • To perform this analysis cost estimates for each activity will be needed. Inc.continued • Management wishes to schedule the project such that – Completion time is 194 days. 41 .

Inc.623 Total Time (days) 90 15 5 20 21 25 14 28 30 45 Cost per Day 25 12 18 15 11 10 5 14 17 30 42 Total cost = .Resource Leveling – KLONE COMPUTERS. – cost estimates Activity A B C D E F G H I J Description Prototype model design Purchase of materials Manufacture of prototype Revision of design Initial production run Staff training Staff input on prototype Sales traini ng Pre-production advertisement Post-production advertisement Total Cost (x10000) 2250 180 90 300 231 250 70 392 510 1350 5.

Latest Times Earliest Start-Earliest Finish Budget Feasible Budgets Latest Start-Latest Finish Budget Time 20 40 60 80 100 120 140 160 180 200 43 .55 50 45 40 35 30 25 20 15 10 5 Cumulative Daily Expenditure – Earliest Times vs.

Daily Expenditure of the ES Schedule 55 50 45 40 35 30 25 20 15 10 5 25 C Cost Leveling I IIIIII ES = 90 45 LS = 110 39 I 32 27 22 I I F I D G 55 H H 44 E H E E H I 30 J A B F F J J J J 15 20 40 60 80 100 120 140 160 180 200 44 .

55 50 45 40 35 30 25 20 15 10 5 25 Cost Leveling 55 H H 44 I E 32 27 22 I I F I D G H H 30 I C H E E J A B F F J J J J 15 20 40 60 80 100 120 140 160 180 200 45 .

• PERT is a technique that treats activity completion times as random variables.5.8 The Probability Approach to Project Scheduling • Activity completion times are seldom known with 100% accuracy. • Completion time estimates are obtained by the Three Time Estimate approach 46 .

The Probability Approach – Three Time Estimates • The Three Time Estimate approach provides completion time estimate for each activity. b = a pessimistic time to perform the activity. • We use the notation: a = an optimistic time to perform the activity. m = the most likely time to perform the activity. 47 .

Mean. and Standard Deviation of an Activity Approximations for the mean and the standard deviation of activity completion time are based on the Beta distribution.The Distribution. a + 4m + b m = the mean completion time = 6 b -a s = the standard deviation = 6 48 .

The Project Completion Time Distribution Assumptions To calculate the mean and standard deviation of the project completion time we make some simplifying assumptions. 49 .

The Project Completion Time Distribution Assumptions • Assumption 1 – A critical path can be determined by using the mean completion times for the activities. • Assumption 2 – The time to complete one activity is independent of the time to complete any other activity. – The project mean completion time is determined solely by the completion time of the activities on the critical path. • Assumption 3 – There are enough activities on the critical path so that the distribution of the overall project completion time can be approximated by the normal distribution. 50 .

the following parameters: Mean = Sum of mean completion times along the critical path. Variance = Sum of completion time variances along the critical path. Standard deviation = Variance 51 .The Project Completion Time Distribution The three assumptions imply that the overall project completion time is normally distributed.

The Probability Approach – KLONE COMPUTERS A ctivity A B C D E F G H I J O p tim istic M o st L ikely P essim istic 76 12 4 15 18 16 10 24 22 38 86 15 5 18 21 26 13 18 27 43 120 18 6 33 24 30 22 32 50 60 52 .

The Probability Approach – KLONE COMPUTERS • Management at KLONE is interested in information regarding the completion time of the project. • The probabilistic nature of the completion time must be considered. 53 .

78 1.44 4.67 s2 53.00 0.00 0.78 s = (120 76) / 6 = 7.67 3.33 1.33 4.33 s A A Activity A B C D E F G H I J m 90 15 5 20 21 25 14 28 30 45 s 7.00 2.78 13.33)2 = 53.00 1.00 5.KLONE COMPUTERS – Finding activities‟ mean and variance mA = [76+4(86)+120]/6 = 90 2 = (7.33 3.00 1.78 21.00 1.11 9.00 1.33 2.44 54 .

– Expected completion time = mA +mF +mG +mD +mJ=194.D – J. – The project variance =sA2 +sF2 +sG2 +sD2 +sJ2 = 85.255 55 .F.66 – The standard deviation = s2 = 9.G . the critical path is A . previously solved for KLONE. • Thus.KLONE COMPUTERS – Finding mean and variance for the critical path • The mean times are the same as in the CPM problem.

255 56 .5 9.The Probability Approach – Probabilistic analysis • The probability of completion in 194 days = 194 194 -194 P(X 194) = P(Z ) P(Z 0) 0.

95.255) @ [175.96(9.213] is 0.95 m • The interval is = 194 ± 1.The Probability Approach – Probabilistic analysis • An interval in which we are reasonably sure the completion date lies is m ± z 0. 213] days.025 s . 57 . • The probability that the completion time lies in the interval [175.

0655 180 -1.The Probability Approach – Probabilistic analysis • The probability of completion in 180 days = 0.0.51) = 0.4345 = 0.0655 58 .5 .51 194 0 X Z P(X 180) = P(Z -1.

73 X Z 0.73) = 0.The Probability Approach – Probabilistic analysis • The probability that the completion time is longer than 210 days = .458 = 0.5 .0418 ? P(X 210) = P(Z 1.0.0418 59 .4582 194 0 210 1.

01. There is 99% chance that the project is completed in 215.33(9.56 days. .The Probability Approach – Probabilistic analysis • Provide a completion time that has only 1% chance to be exceeded.01.255) = 215. or P(Z X0 – m)/s] = P(ZZ0) = .49 194 0 0.01 X0 X 2.01 P(Z 2.33) = 0. X0=m+Z0s =194 + 2.56 days.33 Z P(XX0) = 0. 60 .

9. TRUE) NORMINV(.255) NORMDIST(180. 9. 9.255.255) 61 . 194. TRUE) 1 .NORMDIST(210. 194. 194. 9. 194.The Probability Approach – Probabilistic analysis with a spreadsheet NORMDIST(194. 194.99. 9.255.025. 194.255) NORMINV(.975. 9. TRUE) NORMINV(.255.

111111 9 1 5.333333 2 1. the variance on one critical path of interest.333333 4.666667 3.333333 3 1 2. PROBABILITY COMPLETE BEFORE 180 = 0.77778 1 0.44444 ES 0 90 105 129 149 90 115 149 90 149 EF 90 105 110 149 170 115 129 177 120 194 LS 0 95 110 129 173 90 115 166 119 149 LF 90 110 115 149 194 115 129 194 149 194 Slack 0 5 5 0 24 0 0 17 29 0 62 . Advertise J * m 90 15 5 20 21 25 14 28 30 45 s 7.The Probability Approach – Critical path spreadsheet CRITICAL PATH ANALYSIS MEAN 194 STANDARD DEVIATION* 9.065192 Acitivty Node Critical Design A * Materials B Manufacture C Design Revision D * Production Run E Staff Training F * Staff Input G * Sales Training H Preprod.333333 1 0. Advertise I Post.777778 21.66667 If not.255629 * Assumes all critical activities are on one critical path VARIANCE* 85.444444 4 1.77778 13.666667 s2 53. enter in gold box.

probabilities of interest (for x))cannot s2 Acitivty Node Critical the m s ES example.159152 standard deviation.333333 1. determine the probabilities for each critical path separately using its PROBABILITY COMPLETE BEFORE 180 = 0.111111 105 110 105 110 0 IfD the paths are (no Design Revision * 20 independent 3 9 common 124 activities 144 among 124 the paths).77778 0 90 0 check 90 0 be determined path alone. VARIANCE* 81. 144 0 Production Run E the probabilities 21 1 144 165 168 189 24 multiply of 1 all the paths: Staff Training F 14 0. 63 . the variance on one critical path of interest.44444 144 189 144 189 0 more practical. Manufacture C * 5 0.444444 90 104 96 110 6 [Pr(Completion time x) = Pr(Path 1 x)P(Path 2 x)…Path k x)] Staff Input G * 14 2 4 110 124 110 124 0 IfH the paths are the calculations might Sales Training 28 dependent. Advertise J * 45 3.777778 144 172 become 161 very189 17 Preprod.666667 0. 1. enter in gold box.The Probability Approach – critical path spreadsheet CRITICAL PATH ANALYSIS MEAN 189 A comment – multiple critical paths STANDARD DEVIATION* 9.0185 * Assumes all critical activities are on one critical path In the case of multiple critical paths (a not unusual situation). EF P(X LS LF Slack Design A * by each 90 7. However.333333 0. in which running a computer simulation seems to be Post.77778 90 120 114 144 24 cumbersome.666667 13.666667 21.333333 53.33333 If not. Advertise I 30 case 4. To find these probabilities. Materials B * 15 1 1 90 105 90 105 0 whether the paths are independent.

5.9 Cost Analysis Using the Expected Value Approach • Spending extra money. • Is this operation cost effective? • The expected value criterion is used to answer this question. 64 . in general should decrease project duration.

65 . – Completion time between 180 days and 200 days.000. yields an additional profit of $400. – Completion time reduction can be achieved by additional training.KLONE COMPUTERS Cost analysis using probabilities • Analysis indicated: – Completion time within 180 days yields an additional profit of $1 million.

000.000. – Sales personnel training: • • Which option should be Cost $200. pursued? New time estimates are a = 19. and b = 16. 66 . – Technical staff training: • Cost $250. m= 21. and b = 23 days. m = 14.KLONE COMPUTERS Cost analysis using probabilities • Two possible activities are considered for training. • New time estimates are a = 12.

– Under the assumption that the project completion time is determined solely by critical activities.000. this option should not be considered further. • Calculate expected profit when spending $250. – This activity (F) is critical.000.KLONE COMPUTERS Cost analysis using probabilities • Evaluation of spending on sales personnel training. – This activity (H) is not critical. 67 . – This option should be further studied as follows: • Calculate expected profit when not spending $250. • Evaluation of spending on technical staff training. • Select the decision with a higher expected profit.

P(X>200) =. • Expected gross additional profit = E(GP) = P(X<180)($1 million) + P(180<X<200)($400. .676398. • Use Excel to find the required probabilities: P(X<180) = .065192.751.25841 • Expected gross additional profit = .25841(0) = $335. • Let X represent the project’s completion time.000) + P(X>200)(0).000 on training.20 68 .065192(1M)+.676398(400K)+ . P(180<X<200) = .KLONE COMPUTERS Cost analysis using probabilities – Case 1: Do not spend $250.

000 on training.67 sF2= 0(. and a standard deviation of = 9. • The revised mean time and standard deviation estimates for activity F are: mF= (12 + 4 (14) + 16)/6 = 14 sF= (16 -12)/6 =0. 69 .67)2 =0.0185 days.KLONE COMPUTERS Cost analysis using probabilities – Case 2: Spend $250.44 • Using the Excel PERT-CPM template we find a new critical path (A-B-C-G-D-J). with a mean time = 189 days.

111287(0) = $450.729561(400K)+ .976.159152(!M)+ . • P(180 < X < 200) = .40 70 . From Excel we find: • P(X < 180) = .729561 • P(X > 200) = .159152.111287 – Expected Gross Additional Revenue = P( X<180)(1M)+P(180<X<200)(400K)+P(X>200)(0) = .KLONE COMPUTERS Cost analysis using probabilities – The probabilities of interest need to be recalculated.

751 Expected additional net profit when spending $250.000 on training Expected profit without spending $250. 71 .976-250.000 on training Conclusion: Management should not spend money on additional training of technical personnel.KLONE COMPUTERS Cost analysis using probabilities The expected net additional profit = 450.976 < $335.000 = $200.

• Completion time depends only on the amount of money allocated to activities.10 Cost Analyses Using The Critical Path Method (CPM) • The critical path method (CPM) is a deterministic approach to project planning. • Reducing an activity’s completion time is called “crashing.” 72 .5.

Crash time/Crash cost • There are two crucial completion times to consider for each activity. The activity is completed in TC. – Normal completion time (TN). The activity is completed in TN. the minimum possible completion time. 73 . – Crash cost (CC). • The cost spent on an activity varies between – Normal cost (CN). – Crash completion time (TC).

74 . • Any percentage of the maximum extra cost (CN – CC) spent to crash an activity. yields the same percentage reduction of the maximum time savings (TC – TN).Crash time/Crash cost – The Linearity Assumption • The maximum crashing of activity completion time is TC – TN. • This can be achieved when spending CN – CC.

..Time 20 …and save on completion time on 18 … and save more completion time 16 14 12 10 8 6 4 2 Normal CN = $2000 TN = 20 days Total Cost = $2600 A demonstration Job time = 18 days of the Linearity Assumption … to save 25% of the max.cost. time reduction Add to Add more tothe the normal normal cost. Crashing CC = $4400 TC = 12 days 5 10 15 20 25 30 35 40 45 Cost ($100) 75 ..... Add 25% of the extra cost.

Crash time/ Crash cost The Linearity Assumption Marginal Cost = Additional Cost to get Max.12) = $300 per day M= E R 76 .2000)/(20 . Time Reduction Maximum Time reduction = (4400 .

Crashing activities –

Meeting a Deadline at Minimum Cost

• If the deadline to complete a project cannot be met using normal times, additional resources must be spent on crashing activities. • The objective is to meet the deadline at minimal additional cost.

77

**Baja Burrito Restaurants –
**

Meeting a Deadline at Minimum Cost

• Baja Burrito (BB) is a chain of Mexican-style fast food restaurants. • It is planning to open a new restaurant in 19 weeks. • Management wants to

– Study the feasibility of this plan, – Study suggestions in case the plan cannot be finished by the deadline.

78

Baja Burrito Restaurants –

Without spending any extra money, the restaurant will open in 29 weeks at a normal cost of $200,000.

When all the activities are crashed to the maximum, the restaurant will open in 17 weeks at crash cost of $300,000.

Determined by the PERT.xls template 79

Baja Burrito Restaurants – Network presentation E I F C G J K M N O B A H D L 80 P .

5 81 .Baja Burrito Restaurants – Marginal costs R = TN – TC = 5 – 3 = 2 E = CC – CN = 36 – 25 = 11 M = E/R = 11/2 = 5.

• Three observations lead to the heuristic. – The maximum time reduction for each activity is limited.Baja Burrito Restaurants – Heuristic Solution • Small crashing problems can be solved heuristically. – The project completion time is reduced only when critical activity times are reduced. – The amount of time a critical activity can be reduced before another path becomes critical is limited. 82 .

Baja Burrito Restaurants – Linear Programming • Linear Programming Approach – Variables Xj = start time for activity j. – Constraints • No activity can be reduced more than its Max. • The project must be completed by the deadline date D. • Start time of an activity takes place not before the finish time of all its immediate predecessors. 83 . – Objective Function Minimize the total additional funds spent on crashing activities. time reduction. Yj = the amount of crash in activity j.

5YA+10YB+2.67YG+10YH+ 5.33YI+12YJ+4YK+5.67YC+4YD+2.33YP Minimize total crashing costs 84 .33YL+1.5YN+4YO+5.Baja Burrito Restaurants – Linear Programming Min 5.8YE+6YF+6.

5 YH 0.33YL+1..8YE+6YF+6.5 Y F 0.67YC+4YD+2.5 Y D 1.5YA+10YB+2.67YG+10YH+ 5.0 Y E 2. Maximum time-reduction constraints 85 .5 Y C 1.5 …….33YP ST X ( FIN ) 19 Meet the deadline YA 2.33YI+12YJ+4YK+5.Linear Programming Min 5.5 Y G 1.5YN+4YO+5.0 Y B 0.

86 .Linear Programming Min 5.67YG+10YH+ 5.67YC+4YD+2.8YE+6YF+6.33YL+1.5YN+4YO+5.33YI+12YJ+4YK+5.5YA+10YB+2.33YP XBXA+(5 – YA) -YA Baja Burrito Restaurants – Network presentation E I F C H D L 84 O K J M N XA A A XA+5-YA XA+5 B A G B B BBB X X X X B BB B BX P Activity can start only after all the Predecessors are completed.

Linear Programming Min 5..5YN+4YO+5.67YG+10YH+ 5.33YL+1.33YI+12YJ+4YK+5.8YE+6YF+6.33YP XBXA+(5 – YA) XCXA+(5 – YA) XDXA+(5 – YA) XeXA+(5 – YA) XFXA+(5 – YA) XBXB+(1 – YB) XFXC+(3 – YC) XGXF+(1 – YF) ……. P X(FIN)XN+(3 – YN) X(FIN)XO+(4 – YO) X(FIN)XP+(4 – YP) 87 .67YC+4YD+2.5YA+10YB+2. Baja Burrito Restaurants – Network presentation E I F C H D L 84 O K J M N B A G Activity can start only after all the predecessors are completed.

5 0 0 1.5 0 Cost of Crashing 11 0 4 0 0 3 7.5 0.5 2.5 15 16.75 19 PROJECT NORMAL COST PROJECT CRASH COST Finish Time 3 4 4.5 5 9 9 11.5 16.5 13.5 19 19 17.5 200 300 NODE A B C D E F G H I J K L M N O P Completion Time 3 1 1.5 13 13.87637E-11 0 8 0 0 8 8 0.5 0 0 0.5 1.5 Amount Crashed 2 0 1.Baja Burrito Restaurants – Deadline Spreadsheet CRASHING ANALYSIS TOTAL PROJECT COST COMPLETION TIME ACTIVITY Revisions/Approvals Grade Land Purchase Materials Order Equipment Order Furniture Concrete Floor Erect Frame Install Electrical Install Plumbing Install Drywall/Roof Bathrooms Install Equipment Finish/Paint Inside Tile Floors Install Furniture Finish/Paint Outside 248.5 4 2 2.5 1.5 4.75 6 0 Total Cost 36 10 22 8 8 15 20 12 21 10 8 22 18 6.5 5 16.5 2 2 1.5 1.5 5 9 11 11.75 14 18 88 .5 0 0 1.5 13.5 2.5 15 15 16.5 4 Start Time 0 3 3 3 12.5 2 4 0.

Crash budget = (12.000 • Management wants to minimize the project completion time under the budget constraint.5% above the “normal cost” projection. 89 .000) = 25.5%)(200.Baja Burrito Restaurants – Operating within a fixed budget • Baja Burrito has the policy of not funding more than 12.

5YA + 10YB + 2.8YE + 6YF + 6.5YA + 10YB + 2.33YI + 12YJ + 4YK + 5.67YC + 4YD + 2.Baja Burrito Restaurants – Operating within a fixed budget The crash funds become a constraint Minimize Minimize X(FIN) 5.67YG + 10YH + 5.8YE + 6YF + 6.33Y L+ 1.33YP 25 The completion time becomes the objective function The other constraints of the crashing model remain the same.67YG + 10YH + 5.67YC + 4YD + 2. 90 .5YN + 4YO + 5.33Y L+ 1.5YN + 4YO + 5.33YI + 12YJ + 4YK + 5.33YP X(FIN) 19 5.

1875 0 1 0 Cost of Crashing 0 0 4 0 0 0 0 0 8 0 0 8 1 0 4 0 Total Cost 25 10 22 8 8 12 20 12 21 10 8 22 11 6 12 18 91 .5 2.3125 23.5 0 0 1.5 7 20.8125 3 3 4 Start Time 0 5 5 5 16.3125 23.5 20.5 0 0 0 0 0 1.5 12 11.Baja Burrito Restaurants – Budget Spreadsheet CRASHING ANALYSIS TOTAL PROJECT COST COMPLETION TIME ACTIVITY Revisions/Approvals Grade Land Purchase Materials Order Equipment Order Furniture Concrete Floor Erect Frame Install Electrical Install Plumbing Install Drywall/Roof Bathrooms Install Equipment Finish/Paint Inside Tile Floors Install Furniture Finish/Paint Outside PROJECT NORMAL COST 23.3125 0 0 1.3125 23.5 20.3125 19.3125 PROJECT CRASH COST 225 200 300 NODE A B C D E F G H I J K L M N O P Completion Time 5 1 1.5 2 2 1.3125 Finish Amount Time Crashed 5 6 6.3125 7.3125 20.5 7.5 2 4 1 4 2 2.5 0.5 14 14 16 16 17.5 14 14 16 17.3125 6.5 11.

7. Each segment is a collection of work packages. • PERT/Cost is based on analyzing a segmented project. PROJECT Work Package 1 Activity 1 Activity 2 Work Package 3 Work Package 2 Activity 3 Activity 5 Activity 4 Activity 6 92 .11 PERT/COST • PERT/Cost helps management gauge progress against scheduled time and cost estimates.

a work package is performed continuously until it is finished. 93 .Work Package .Assumptions – Once started. – The costs associated with a work package are spread evenly throughout its duration.

– Expected remaining completion time = (1 – p)(Original Expected Completion Time) 94 .Monitoring Project progress • For each work package determine: – Work Package Forecasted Weekly cost = Budgeted Total Cost for Work Package Expected Completion Time for Work Package (weeks) – Value of Work to date = p(Budget for the work package) where p is the estimated percentage of the work package completed.

[Value of Work to Date].Monitoring Project progress • Completion Time Analysis Use the expected remaining completion time estimates. 95 . to revise the project completion time. • Cost Overrun/Underrun Analysis For each work package (completed or in progress) calculate Cost overrun = [Actual Expenditures to Date] .

96 . – Problematic departments or contractors that cause delays. and or experiencing cost overruns. – Mistaken work package completion times estimates and cost estimates. • Management seeks out causes such as: – Mistaken project completion time and cost estimates.Monitoring Project Progress – Corrective Actions • A project may be found to be behind schedule.

to be taken whenever needed. – Reduce resource allocation to non-critical activities. 97 . – Focus on uncompleted activities.Monitoring Project Progress – Corrective Actions • Possible Corrective actions. – In the case of cost underrun. – Determine whether crashing activities is desirable. channel more resources to problem activities.

• If the campaign is not on target or not within budget. • Twenty weeks before the election the campaign remaining activities need to be assessed. 98 .TOM LARKIN‟s MAYORAL CAMPAIGN • Tom Larkin is running for Mayor. recommendations for corrective actions are required.

000 700 5.000 0 Status Finish Finish Finish Finish Finish 40% complete Finish 25% complete 0% complete 99 Hire campaign staff Prepare position paper Recruit volunteers Raise funds File candidacy papers Prepare campaign material Locate/staff headquarter Run personal campaign Run media campaign Work packages to focus on .000 3.600 5.000 5.MAYORAL CAMPAIGN – Status Report Work Package A B C D E F G H I Expenditures ($) 2.600 700 2.

25)(20)=15 20+15=35 Finish F 7.8=27.MAYORAL CAMPAIGN – Completion Time Analysis – The remaining network at the end of week 20.8 .8 weeks longer than the deadline of 36 weeks.8 The remaining activities are expected to take 0. 100 .8 I 9 20+7.8+9=36. H 15 (1-p)(original expected completion time)=(1-0.8 27.

000 3.000 700 5.000 4.500 500 5200 1.MAYORAL CAMPAIGN – Project Cost Control Budgeted Values Work Total Total Percent Package Time Cost Completed A B C D E F G H I Total 4 6 4 6 2 13 1 20 9 2000 3.700 2.500 6.000 3.500 500 13.500 0 20.000 5.000 4.000 7.600 600 2000 -1500 2.500 2.500 1.000 0 24.600 5.000 1.600 700 2.000 40.000 100% 100% 100% 100% 100% 40% 100% 25% 0% Estimated Actual Cost Value Value Ocerrun 2.900 .500 200 400 -800 -500 0 101 3.500 2.

102 . – Work package I: 9 weeks. • Cost over-run is observed in – Work package F: $400.8 weeks behind schedule • There is a cost over-run of $3900.8 weeks. – Work package H: $500. – Work package H: 15 weeks.MAYORAL CAMPAIGN – Results Summary • The project is currently . • The remaining completion time for uncompleted work packages is: – Work package F: 7.

The Publisher assumes no responsibility for errors. or damages. John Wiley & Sons. Under no circumstances can copies be made for resale. All rights reserved. Adopters of the textbook are granted permission to make back-up copies for their own use only. Inc. caused by the use of these programs or from the use of the information contained herein. and to modify this material to best suit their instructional needs. to make copies for distribution to students of the course the textbook is used in. 103 . omissions. Reproduction or translation of this work beyond that named in Section 117 of the United States Copyright Act without the express written consent of the copyright owner is unlawful.Copyright 2002John Wiley & Sons. Inc. Requests for further information should be addressed to the Permissions Department.

Designing and development of advertisement

Sistem Informasi Manajemen(1)

Brand Elements

p.vasumathi

Hrd Intro

Human Resource Information System

Implementing Hrd Programs

Implementing Hrd Programs

E-HRM

chap1me-130930231759-phpapp02

DFD Examples

DFD Examples

information system

B-S MODEL

derrenvatives

Facts of the Puzzle

Strategy for Service Marketing

Money

Compititor Analysis Ex

Services Marketing

Lean

Ancy

New Microsoft Office Word Document

Feasibility Study

- Read and print without ads
- Download to keep your version
- Edit, email or read offline

Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

CANCEL

OK

You've been reading!

NO, THANKS

OK

scribd

/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->