1. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Chapter 17 Project Management Part (a)

2. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Elements Of Project Management Project team –individuals from different departments within company Matrix organization –team structure with members from different functional areas depending on skills needed Project manager –leader of project team

3. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Project Planning Statement of work –written description of goals, work & time frame of project Activities require labor, resources & time Precedence relationship shows sequential relationship of project activities

4. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Simplified Project Network 132 Construct formsPour concrete

5. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Elements Of Project Planning Define project objective(s) Identify activities Establish precedence relationships Make time estimates Determine project completion time Compare project schedule objectives Determine resource requirements to meet objective

6. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Project Control Two phases –1. planning –2. control Work breakdown structure (WBS) –determine subcomponents, activities & tasks

7. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Gantt Chart Popular tool for project scheduling Graph with bar for representing the time for each task Provides visual display of project schedule Also shows slack for activities –(amount of time activity can be delayed without delaying project)

8. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. 2 0 41068 31579 Month   Activity Design house and obtain financing Lay foundation Order and receive materials Build house Select paint Select carpet Finish work A Gantt Chart

9. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. CPM/PERT Critical Path Method (CPM) –DuPont & Remington-Rand (1956) –deterministic task times –activity-on-node network construction Project Eval. & Review Technique (PERT) –US Navy, Booz, Allen & Hamilton –multiple task time estimates –activity-on-arrow network construction

10. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. The Project Network Network consists of branches & nodes 132 Branch Node

11. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Network Construction In AON, nodes represent activities & arrows show precedence relationships In AOA, arrows represent activities & nodes are events for points in time An event is the completion or beginning of an activity A dummy shows precedence for two activities with same start & end nodes

12. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Concurrent Activities 4 3 2 Dummy Lay foundation 2 3 Lay foundation Order material Incorrect precedence relationship Correct precedence relationship

13. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Network Convention: Activity-on- Arc (AOA) a b ca b c a b c d a b c Dummy activity

14. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Network Convention: Activity-on- Node (AON)

15. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Problem 1 Management Decision Systems (MDS) is a consulting company specializing in the development of decision support systems. MDS has just obtained the contract to develop a computer system to assist the management of a large company in formulating its capital expenditure plan. The project leader has developed the list of activities and immediate predecessors as shown in the table. Construct the precedence network (AOA and AON) for this problem.

16. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Problem 1

17. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Problem 1 - Solution Activity-On-Arc (AOA)

18. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Problem 1 - Solution Activity-On-Node

19. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Critical Path A path is a sequence of connected activities running from start to end node in network The critical path is the path with the longest duration in the network Project cannot be completed in less than the time of the critical path

20. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. PERT and CPM By utilizing project planning and control techniques (such as PERT and CPM), a variety of important questions can be answered, such as: –When will the project be completed? –Which activities are most critical regarding the projects completion time? –How long can individual tasks be delayed without causing the project itself to be delayed?

21. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. PERT and CPM: Solution Approaches Enumerating all Paths in the Project Network. By Calculating Early Start, Early Finish, Late Start, Late Finish, and Total Slack.

22. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Example Project Network For Building A House 124 6 7 3 5 3 2 0 1 3 1 1 1 Lay foundation Design house and obtain financing Order and receive materials Dummy Finish work Selec t carpe t Select paint Build house

23. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Solution: All Possible Paths A: 1-2-3-4-6-7 3 + 2 + 0 + 3 + 1 = 9 months (36 weeks); the critical path B: 1-2-3-4-5-6-7 3 + 2 + 0 + 1 + 1 + 1 = 8 months (32 weeks) C: 1-2-4-6-7 3 + 1 + 3 + 1 = 8 months (32 weeks) D: 1-2-4-5-6-7 3 + 1 + 1 + 1 + 1 = 7 months (28 weeks)

24. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. End of Part (a)

25. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Chapter 17 Project Management Part (b)

26. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Definitions Early Start (ES), the earliest time an activity can start Early Finish (EF), the earliest time an activity can finish EF = ES + Activity Time

27. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Definitions Late Start (LS), the latest time the activity can finish and not delay the project Late Finish (LF), the latest time the activity can finish and not delay the project LS = LF – Activity Time

28. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Definitions Total Slack (TS) or Slack Time is: TS = LS – ES or TS = LF – EF

29. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Definitions A path is a sequence of connected activities running from start to end node in network The Critical Path (CP) is the path with the longest duration in the network. Also, it is the path in the network along which the activities have a zero total slack value. Project cannot be completed in less than the time of the critical path

30. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Computing Algorithm Forward Pass: Calculate the Early Finish Time for Each Activity Backward Pass: Calculate the Late Start for Each Activity Determine the Total Slack for Each Activity Identify the Critical Path for the project

31. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Problem 2 For the given activities and their immediate predecessors, draw the precedence diagram. Then find the early start, early finish, late start, and late finish for each activity. Also, determine the length of the critical path and the activities along the critical path.

32. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Problem 2

33. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Problem 2 – Precedence Diagram (AON) B A C E D F G H J I K

34. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Problem 2 – Precedence Diagram (AOA) 12 4 35 6 7 8 910

35. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved.

47. Problem 2 – Precedence Diagram (AOA) 12 4 35 6 7 8 910

48. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved.

60. End of Part (b)

61. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Chapter 17 Project Management Part (c)

62. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Probabilistic Time Estimates Reflect uncertainty of activity times Beta distribution is used in PERT b - a 6 ( ) Variance:  2 = a = optimistic estimate m = most likely time estimate b = pessimistic time estimate Where, 2 Mean (expected time): a + 4m + b 6 t =

63. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Example Beta Distributions m = t ba P (time) ba tm b mta

64. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. PERT Example 1 2 4 6 7359 8 Manual Testing Dummy System Training Dummy System Testing Orientation Position recruiting System development Equipment installation Equipment testing and modification Final debugging System changeover Job training

65. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Activity Information 1 - 268108.44 1 - 336961.00 1 - 41353.44 2 - 50000.00 2 - 6 241252.78 3 - 5 2343.11 4 - 53454.11 4 - 82222.00 5 - 7371171.78 5 - 82464.44 7 - 80000.00 6 - 914741.00 7 - 91101394.00 Time estimates (wks)Mean Time Variance Activityambt  2

66. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Early And Late Times 1 - 280.4408191 1 - 361.0006060 1 - 430.4403252 2 - 500.0088991 2 - 6 52.7881316218 3 - 5 30.1169690 4 - 540.1137592 4 - 820.0035141611 5 - 771.789169160 5 - 840.4491312163 7 - 800.00131316163 6 - 941.00131721258 7 - 994.00162516250 Activityt  2 ESEFLSLFTS

67. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Network With Times 1 2 4 6 7359 8 ( ) ES=8, EF=8 LS=9, LF=9 ( ) ES=6, EF=9 LS=6, LF=9 ( ) ES=3, EF=5 LS=14, LF=16 ( ) ES=0, EF=3 LS=2, LF=5 ( ) ES=0, EF=6 LS=0, LF=6 ( ) ES=0, EF=8 LS=1, LF=9 3 8 0 5 4 4 7 0 2 93 6 ( ) ES=3, EF=7 LS=5, LF=9 4 ( ) ES=9, EF=13 LS=12, LF=16 ( ) ES=9, EF=13 LS=9, LF=16 ( ) ES=13, EF=13 LS=16 LF=16 ( ) ES=13, EF=25 LS=16 LF=25 ( ) ES=13, EF=25 LS=16 LF=25 ( ) ES=8, EF=13 LS=16 LF=21

68. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Critical Path and Project Variance The Length of the Critical Path: 25 The Critical Path: 1-3, 3-5, 5-7, 7-9. Project variance is the sum of variances on the critical path

69. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Probabilistic Network Analysis Determine probability that project is completed within specified time where  = t p = project mean time  = project standard deviation x = proposed project time Z = number of standard deviations x is from mean Z = x -  

70. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Normal Distribution Of Project Time  = t p Timex ZZ Probability

71. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Probabilistic Analysis Example What is the probability that the project is completed within 30 weeks?

72. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Determining Probability From Z Value Z0.000.01...0.09 1.90.47130.4719…0.4767............  = 25 Time (weeks) x = 30 P( x<= 30 weeks) = 0.9719

73. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. What is the probability that the project is completed within 22 weeks?  = 25 Time (weeks) x = 22 P( x<= 22 weeks) =0.1271

74. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Project Crashing Crashing is reducing project time by expending additional resources Crash time is an amount of time an activity is reduced Crash cost is the cost of reducing the activity time Goal is to reduce project duration at minimum cost

75. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Time-Cost Relationship Crashing costs increase as project duration decreases Indirect costs increase as project duration increases Reduce project length as long as crashing costs are less than indirect costs

76. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Time-Cost Trade- offs Cost ($) Project Duration Crashing Total cost Indirect cost Direct cost Time Minimum cost = optimal project time

77. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Time-Cost Trade-offs: Crashing Trial and Error Approach for small size problems (which is described and used for Problem 3) Mathematical Procedures (for example, Linear Programming Formulation) for large size problems

78. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Advantages of PERT/CPM Forces managers to organize Provides graphic display of activities Identifies – Critical activities – Slack activities Build A A Done Build B B Done Build C C Done Build D Ship JANFEBMARAPRMAYJUN On time!

79. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. 1 2 3 4 56 Limitations of PERT/CPM Important activities may be omitted Precedence relationships may not be correct Estimates may include a fudge factor 200 weeks

80. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Problem 3 Office Automation, Inc., has developed a proposal for introducing a new computerized office system that will improve word processing and interoffice communications for a particular company. Contained in the proposal is a list of activities that must be accomplished in order to complete the new office system project. Information about the activities is shown below. Times are in weeks and costs are in thousands of dollars.

81. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Problem 3

82. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Problem 3 Show the network for the project. Develop the activity schedule for the project. What are the critical path activities and what is the expected project completion date? Assume that the company wishes to complete the project in 26 weeks. What crashing decisions would be recommended in order to meet the completion date at least possible cost. Work through the network and attempt to make crashing decisions. Develop an activity schedule for the crashed project. What is the added project cost to meet the 26-week completion date?

83. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Problem 3 - Solution Project Network - AON

84. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Problem 3 - Solution Activity Schedule Based on Normal Time

85. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Problem 3 - Solution Based on the activity schedule, it can be determined that the critical path is along activities A-B-C-F and the length of the critical path is 31 weeks. Hence, the Expected Project Completion Date is in 31 weeks

86. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Problem 3 - Solution Also, from the project network it can easily be seen that there are 2 Paths in the network. They are: –Path 1: A-B-C-F with a length of 31 weeks –Path 2: A-D-E-F with a length of 30 weeks How do we get to complete the project in 26 weeks?

87. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Problem 3 - Solution Determine the potential Crash Cost per time period (weeks) for each activity Crash Cost per time period for activity i = K i = Total Crash Cost – Total Normal Cost Normal Time – Crash Time

88. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Problem 3 - Solution

89. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Problem 3 - Solution First crash activities on the Critical Path Note that by crashing critical path activities will lead to other paths with the same completion time (and thus will also become critical)

90. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Problem 3 - Solution 1.Activity B has the lowest crash cost on the critical path, A-B-C-F. Crash activity B by 1 week since the maximum crash weeks for Activity B are 2 weeks. The length of critical path = 30 weeks. Added cost = $15,000. 2.Now, there are two critical paths. Reduce a common activity or a combination of activities from each path, which ever is the lowest.

91. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Problem 3 - Solution 3.Next, reduce the common activity to both paths, activity A by 2 weeks (one week at a time). The length of the critical path = 28. Added cost = $20,000 + $20,000 4.Next, reduce activities B and D by 1 week each. The length of the critical path = 27. Added cost = $15,000 + $10,000 5.Next, reduce activities C and E by 1 week each. The length of the critical path = 26. Added cost = $20,000 + $12,500

92. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Problem 3 - Solution 6.The desired completion time for the project of 26 weeks has been achieved. 7.The total added cost = $112,500

93. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Problem 3 - Solution Revised Activity Schedule based on Crashing

94. To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. THE END