Chapter 9 Project Scheduling: PERT/CPM

Slides:



Advertisements
Similar presentations
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Advertisements

Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
3 Project Management PowerPoint presentation to accompany
Precedence Diagramming
Lecture 4 – PERT Diagrams & CPM
WBS: Lowest level OBS: Lowest level
Developing a Project Plan CHAPTER SIX Copyright © 2011 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin.
Chapter 6 Scheduling. 222 Learning Objectives Estimate the duration for each activity Establish the estimated start time and required completion time.
Chapter 10 Project Scheduling: PERT/CPM
© The McGraw-Hill Companies, Software Project Management 4th Edition Activity planning Chapter 6.
Associate Professor MIS Department UNLV
Chapter 8 - Project Management Chapter Topics
Chapter 6: Developing a Project Plan
Project Management 6e..
Chapter 17 Project Management McGraw-Hill/Irwin
Project Scheduling: PERT-CPM
Project Scheduling: PERT/CPM n Managers are often responsible for planning, scheduling and controlling projects that consist of numerous separate jobs.
Developing the Project Plan
Project Management Projects are unique, one-time operations designed to accomplish a specific set of objectives in a limited timeframe Project managers.
Start D finish A B C E I G H F J KL N M ActivityDescription AExcavate BFoundation CRough wall DRoof EExterior plumbing FInterior.
Copyright 2006 John Wiley & Sons, Inc. Beni Asllani University of Tennessee at Chattanooga Project Management Operations Management - 5 th Edition Chapter.
Where We Are Now Copyright © 2011 The McGraw-Hill Companies, All Rights Reserved.
Finding the Critical Path
Project Management in Practice, Fourth Edition Prepared by Scott M. Shafer, Updated by William E. Matthews and Thomas G. Roberts, William Paterson University.
Project Management CPM/PERT Professor Ahmadi.
Developing a Project Plan
Project Scheduling: PERT/CPM
1 1 Slide © 2006 Thomson South-Western. All Rights Reserved. Slides prepared by JOHN LOUCKS St. Edwards University.
Chapter 13 Project Scheduling: PERT/CPM
Chapter 3 Project Management.
Network analysis is the general name given to certain specific techniques which can be used for the planning, management and control of projects. Use.
CPM Network Computation
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edwards University.
25 seconds left…...
Introduction to Management Science
PROJECT MANAGEMENT Outline What is project mean? Examples of projects…
1 1 Slide © 2001 South-Western College Publishing/Thomson Learning Anderson Sweeney Williams Anderson Sweeney Williams Slides Prepared by JOHN LOUCKS QUANTITATIVE.
1 Lecture by Junaid Arshad Department of Engineering Management Abridged and adapted by A. M. Al-Araki, sept WBS: Lowest level OBS: Lowest level.
1 Topics to cover in 2 nd part ( to p2). 2 Chapter 8 - Project Management Chapter Topics ( to p3)
1 Project Scheduling CP - Chapter 10 Lecture 3. 2 Project Management  How is it different?  Limited time frame  Narrow focus, specific objectives 
1 1 Slide © 2005 Thomson/South-Western Q 5 – 13 x 1 = the probability that Station A will take Sitcom Rerun x 2 = the probability that Station A will take.
1 1 Slide © 2004 Thomson/South-Western Chapter 12 Project Scheduling: PERT/CPM n Project Scheduling with Known Activity Times n Project Scheduling with.
Project Scheduling Prof. Jiang Zhibin Dept. of IE, SJTU.
1 1 Slide © 2000 South-Western College Publishing/ITP Slides Prepared by JOHN LOUCKS.
1 1 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole.
MGMT 483 Week 8 Scheduling.
ELC 347 project management
1 1 Slide © 2009 South-Western, a part of Cengage Learning Slides by John Loucks St. Edward’s University.
Example: Frank’s Fine Floats
1 1 Slide © 2005 Thomson/South-Western Chapter 10 Project Scheduling: PERT/CPM n Project Scheduling with Known Activity Times n Project Scheduling with.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
Chapter 10 Project Scheduling: PERT/CPM
1 Slide © 2005 Thomson/South-Western Chapter 10 Project Scheduling: PERT/CPM Project Scheduling with Known Activity Times Project Scheduling with Known.
Projects: Critical Paths Dr. Ron Lembke Operations Management.
© 2000 by Prentice-Hall Inc Russell/Taylor Oper Mgt 3/e Chapter 6 Project Management.
8-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Project Management Chapter 8.
Network Planning Methods Example PERT & CPM
1 1 Project Scheduling PERT/CPM Networks. 2 2 Originated by H.L.Gantt in 1918 GANTT CHART Advantages - Gantt charts are quite commonly used. They provide.
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
1 1 Slide © 2005 Thomson/South-Western Chapter 10 Project Scheduling: PERT/CPM n Project Scheduling with Known Activity Times n Project Scheduling with.
Dr. C. Lightner Fayetteville State University 1 Chapter 10 Project Scheduling: PERT/CPM Project Scheduling with Known Activity Times Project Scheduling.
Project Management Chapter 13 Sections 13.1, 13.2, and 13.3.
Prof.Dr. Ahmet R. Özdural – Class Notes_06 - KMU417 Project Planning and Organization – Fall Semester.
8-1 Example: Frank’s Fine Floats Frank’s Fine Floats is in the business of building elaborate parade floats. Frank and his crew have a new float to build.
Project Management (PERT/CPM) PREPARED BY CH. AVINASH
Projects: Critical Paths
PROJECT MANAGEMENT WITH CPM/PERT.
Slides Prepared by JOHN LOUCKS
Project Management CPM/PERT Professor Ahmadi.
Presentation transcript:

Chapter 9 Project Scheduling: PERT/CPM Projects are usually complex, unique, expensive to implement and may have several thousand activities. Moreover, some activities depend on the completion of other activities before they can be started. Examples of projects include: R&D of new products and processes Construction of buildings and highways Maintenance of large and complex equipment Design and installation of new systems PERT/CPM is used to plan the scheduling of individual activities that make up a project.

PERT/CPM PERT Program Evaluation and Review Technique Developed by U.S. Navy for Polaris missile project Developed to handle uncertain activity times CPM Critical Path Method Developed by DuPont & Remington Rand Developed for industrial projects for which activity times are fixed Today’s project management software packages have combined the best features of both approaches.

PERT/CPM Project managers rely on PERT/CPM to help them answer questions such as: What is the total time to complete the project? What are the scheduled start and finish dates for each specific activity? Which activities are critical and must be completed exactly as scheduled to keep the project on schedule? How long can non-critical activities be delayed before they cause an increase in the project completion time?

Project Network A project network can be constructed to model the precedence of the activities. The nodes of the network represent the activities. The arcs of the network reflect the precedence relationships of the activities. A critical path for the network is a path consisting of activities with zero slack. It is also the path that takes the longest time to complete.

Example: Frank’s Fine Floats Frank’s Fine Floats is in the business of building elaborate parade floats. Frank ‘s crew has a new float to build and want to use PERT/CPM to help them manage the project. The table on the next slide shows the activities that comprise the project as well as each activity’s estimated completion time (in days) and immediate predecessors. Frank wants to know the total time to complete the project, which activities are critical, and the earliest and latest start and finish dates for each activity.

Example: Frank’s Fine Floats Immediate Completion Activity Description Predecessors Time (days) A Initial Paperwork --- 3 B Build Body A 3 C Build Frame A 2 D Finish Body B 3 E Finish Frame C 7 F Final Paperwork B,C 3 G Mount Body to Frame D,E 6 H Install Skirt on Frame C 2

Example: Frank’s Fine Floats Project Network B ES EF ES EF D 3 LS LF 3 LS LF G ES EF 6 LS LF S F ES EF 3 LS LF A ES EF Start Finish 3 LS LF E ES EF 7 LS LF C ES EF H ES EF 2 LS LF 2 LS LF

Earliest Start and Finish Times Step 1: Make a forward pass through the network as follows: For each activity i beginning at the Start node, compute: Earliest Start Time, ESi = the maximum of the earliest finish times of all activities immediately preceding activity i. (This is 0 for an activity with no predecessors.) Earliest Finish Time, EFi = (Earliest Start Time) + (Time to complete activity i ). The project completion time is the maximum of the Earliest Finish Times all the activities that end at the Finish node.

Example: Frank’s Fine Floats Earliest Start and Finish Times B 3 6 D 6 9 3 3 G 12 18 6 F 6 9 3 A 0 3 Start Finish 3 E 5 12 7 C 3 5 H 5 7 2 2 H ES EF 2 LS LF

Latest Start and Finish Times Step 2: Make a backwards pass through the network as follows: Move sequentially backwards from the Finish node to the Start node. For each activity, i, compute: Latest Finish Time, LFi = the minimum of the latest start times of all the successor activity/ies of node i. (For node last node/s, this is the project completion time or the largest earliest finish times of the nodes that end at the Finish node.) Latest Start Time, LSi = (Latest Finish Time) - (Time to complete activity i ).

Example: Frank’s Fine Floats Latest Start and Finish Times B 3 6 D 6 9 3 6 9 3 9 12 G 12 18 6 12 18 F 6 9 3 15 18 A 0 3 Start Finish 3 0 3 E 5 12 7 5 12 C 3 5 H 5 7 2 3 5 2 16 18 H ES EF 2 LS LF

Determining the Critical Path Step 3: Calculate the slack time for each activity by: Slack = (Latest Start) - (Earliest Start), or = (Latest Finish) - (Earliest Finish). B 3 6 D 6 9 3 6 9 3 9 12 G 12 18 6 12 18 F 6 9 3 15 18 A 0 3 Start Finish 3 0 3 E 5 12 7 5 12 C 3 5 H 5 7 2 3 5 2 16 18

Example: Frank’s Fine Floats Activity Schedule including the Slack Time Activity ES EF LS LF Slack A 0 3 0 3 0 (critical) B 3 6 6 9 3 C 3 5 3 5 0 (critical) D 6 9 9 12 3 E 5 12 5 12 0 (critical) F 6 9 15 18 9 G 12 18 12 18 0 (critical) H 5 7 16 18 11

Example: Frank’s Fine Floats A critical path is a path of activities, from the Start node to the Finish node, with 0 slack times. B 3 6 D 6 9 3 6 9 3 9 12 G 12 18 6 12 18 F 6 9 3 15 18 A 0 3 Start Finish 3 0 3 E 5 12 7 5 12 C 3 5 H 5 7 2 3 5 2 16 18 Critical Path: A – C – E – G Project Completion Time: 18 days

PERT/CPM Critical Path Procedure Step 1. Develop a list of the activities of the project. Step 2. Determine the immediate predecessor(s) for each activity in the project. Step 3. Estimate the completion time for each activity. Step 4. Draw a project network depicting the activities and immediate predecessors listed in steps 1 and 2. Step 5. Determine the earliest start and the earliest finish time for each activity by making a forward pass through the network. Step 6. Use backward pass through the network to identify the latest start and latest finish time for each activity.

PERT/CPM Critical Path Procedure Step 7. Use the difference between the latest start time and the earliest start time for each activity to determine the slack for each activity. Step 8. Find the activities with zero slack; these are the critical activities. Step 9. Use the information from steps 5 and 6 to develop the activity schedule for the project.

Classroom Exercise: ABC Associates Consider the following project: Activity Immed. Predec. Activity time (hours) A -- 6 B -- 4 C A 3 D A 5 E A 1 F B,C 4 G B,C 2 H E,F 6 I E,F 5 J D,H 3 K G,I 5 i) Draw the project network diagram for ABC Associates. ii) Calculate the ES, EF, LS, LS and S for each activity. iii) Determine the critical path. iv) What is the project completion time?

Classroom Exercise: ABC Associates Solution

Uncertain Activity Times for PERT Calculation of activity’s mean completion time and completion time variance. An activity’s mean completion time is: t = (a + 4m + b)/6 a = the optimistic completion time estimate b = the pessimistic completion time estimate m = the most likely completion time estimate An activity’s completion time variance is:  2 = ((b-a)/6)2

Example: ABC Associates Consider the following project: 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 5 H 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

Example: ABC Associates Activity Expected Times and Variances t = (a + 4m + b)/6  2 = ((b-a)/6)2 Activity Expected Time Variance A 6 4/9 B 4 4/9 C 3 0 D 5 1/9 E 1 1/36 F 4 1/9 G 2 4/9 H 6 1/9 I 5 1 J 3 1/9 K 5 4/9

Example: ABC Associates Critical Path (A-C-F-I-K); Project Completion time: 23 hours 6 11 15 20 19 22 20 23 5 3 13 19 14 20 0 6 6 7 12 13 6 6 1 13 18 6 9 9 13 5 3 4 18 23 0 4 5 9 9 11 16 18 5 4 2 Important Note: The variance of the project completion time is the sum of the variances of the activities on the critical path.

Example: ABC Associates Probability the project will be completed within 24 hrs: Step 1: Calculate the variance of the project completion time  2 =  2A +  2C +  2F +  2I +  2K = 4/9 + 0 + 1/9 + 1 + 4/9 = 2  = 1.414 Step 2: Calculate the standard normal, z = (X – m)/ , where m = expected project completion time. z = (24 - 23)/ (24-23)/1.414 = .71 Step 3: Calculate the probability from the standard normal distribution table (See Appendix A in the textbook): P(z < .71) = 0.5 + .2611 = 0.7611

Example: ABC Associates i) What is the probability that the project will be completed with 25 hours? ii) What is the probability that the project will be completed between 20 and 25 hours?