Project Management Techniques (PMT)

Similar documents
A convenient analytical and visual technique of PERT and CPM prove extremely valuable in assisting the managers in managing the projects.

CHAPTER 9: PROJECT MANAGEMENT

Project Planning. Identifying the Work to Be Done. Gantt Chart. A Gantt Chart. Given: Activity Sequencing Network Diagrams

UNIVERSITY OF BOLTON SCHOOL OF ENGINEERING. MSc CIVIL ENGINEERING MSc CONSTRUCTION PROJECT MANAGEMENT SEMESTER ONE EXAMINATION 2017/2018

INSE 6230: Assignment 1 - Winter (0% of final grade) 1. The table below provides information about a short IT project.

SCHEDULE CREATION AND ANALYSIS. 1 Powered by POeT Solvers Limited

Program Evaluation and Review Techniques (PERT) Critical Path Method (CPM):

GPE engineering project management. Project Management in an Engineering Context

Textbook: pp Chapter 11: Project Management

SSC-JE STAFF SELECTION COMMISSION CIVIL ENGINEERING STUDY MATERIAL ESTIMATING, COSTING AND VALUATION

Project Management Chapter 13

PROJECT MANAGEMENT CPM & PERT TECHNIQUES

Network Analysis Basic Components. The Other View. Some Applications. Continued. Goal of Network Analysis. RK Jana

Optimization Prof. A. Goswami Department of Mathematics Indian Institute of Technology, Kharagpur. Lecture - 18 PERT

Introduction. Introduction. Six Steps of PERT/CPM. Six Steps of PERT/CPM LEARNING OBJECTIVES

UNIT-II Project Organization and Scheduling Project Element

6/7/2018. Overview PERT / CPM PERT/CPM. Project Scheduling PERT/CPM PERT/CPM

Project Planning. Jesper Larsen. Department of Management Engineering Technical University of Denmark

Teori Pengambilan Keputusan. Week 12 Project Management

06IP/IM74 OPERATIONS RESEARCH

Project Management. Chapter 2. Copyright 2013 Pearson Education, Inc. publishing as Prentice Hall

Lecture 3 Project Scheduling

CHAPTER 6 CRASHING STOCHASTIC PERT NETWORKS WITH RESOURCE CONSTRAINED PROJECT SCHEDULING PROBLEM

Real-World Project Management. Chapter 15

Project Management with Brief Information regarding CPM and PERT Methods

PROJECT MANAGEMENT COURSE 5: PROJECT TIME MANAGEMENT. G.N. Sandhy Widyasthana

1 of 14 4/27/2009 7:45 AM

Probabilistic Completion Time in Project Scheduling Min Khee Chin 1, Sie Long Kek 2, Sy Yi Sim 3, Ta Wee Seow 4

Line Balancing S K Mondal Chapter 3

A METHOD FOR STOCHASTIC ESTIMATION OF COST AND COMPLETION TIME OF A MINING PROJECT

Programme Evaluation and Review Technique

CHAPTER 5 STOCHASTIC SCHEDULING

NPV Method. Payback Period

Logistics. Lecture notes. Maria Grazia Scutellà. Dipartimento di Informatica Università di Pisa. September 2015

Outline. Global Company Profile: Bechtel Group. The Importance of Project Management Project Planning Project Scheduling Project Controlling

CHAPTER 5. Project Scheduling Models

Programme Evaluation and Review Techniques (PERT) And Critical Path Method (CPM) By K.K. Bandyopadhyay. August 2001

u w 1.5 < 0 These two results imply that the utility function is concave.

MnDOT use of Calendars in Primavera P6

Chapter 11: PERT for Project Planning and Scheduling

WHY ARE PROJECTS ALWAYS LATE?

Project Management Fundamentals

ADVANCED QUANTITATIVE SCHEDULE RISK ANALYSIS

Appendix A Decision Support Analysis

Construction Management

International Project Management. prof.dr MILOŠ D. MILOVANČEVIĆ

After complete studying this chapter, You should be able to

NETWORK ANALYSIS QUESTION BANK

Management Management

A continuous random variable is one that can theoretically take on any value on some line interval. We use f ( x)

PROJECT MANAGEMENT: PERT AMAT 167

CONSTRUCTION MANAGEMENT CHAPTER 3 PLANNING

UNIT 5 PROJECT ANALYSIS PERT/CPM MODULE - 2

MnDOT Project Management Office Presents: Project Reporting. Presenter: Jonathan McNatty Senior Schedule Consultant DRMcNatty & Associates, Inc.

Comparison between Deterministic and Stochastic Time Estimating Techniques

Formulas to Know for EXAM

56:171 Operations Research Midterm Examination Solutions PART ONE

Making sense of Schedule Risk Analysis

EXERCISE Draw the network diagram. a. Activity Name A B C D E F G H

Chapter 2 The PERT/CPM Technique

ETSF01: Software Engineering Process Economy and Quality

PERMUTATION AND COMBINATIONS APPROACH TO PROGRAM EVALUATION AND REVIEW TECHNIQUE

A UNIT BASED CRASHING PERT NETWORK FOR OPTIMIZATION OF SOFTWARE PROJECT COST PRITI SINGH, FLORENTIN SMARANDACHE, DIPTI CHAUHAN, AMIT BHAGHEL

PROJECT MANAGEMENT. Trying to manage a project without project management is like trying to play a football game without a game plan

Project Management Professional (PMP) Exam Prep Course 06 - Project Time Management

Project Management -- Developing the Project Plan

Poor Man s Approach to Monte Carlo

MS Project 2007 Page 1 of 18

Project Network Analysis Model to Dredging Operations In Niger Delta

Project Management. Project Mangement. ( Notes ) For Private Circulation Only. Prof. : A.A. Attarwala.

Roll No. :... Invigilator s Signature :.. CS/B.TECH(IT)/SEM-5/M(CS)-511/ OPERATIONS RESEARCH AND OPTIMIZATION TECHNIQUES

Project Management and Cost Control

56:171 Operations Research Midterm Examination Solutions PART ONE

Statistics and Their Distributions

CHAPTER 5 SCHEDULING AND TRACKING WORK IN CONSTRUCTION PROJECT MANAGEMENT. UWB10202 Effective Communication by Norazmi Danuri

11/1/2018. Overview PERT / CPM. Network representation. Network representation. Project Scheduling. What is a path?

Activity Predecessors Durations (days) a - 3 b a 4 c a 5 d a 4 e b 2 f d 9 g c, e 6 h f, g 2

IE 102 Spring Project Management

Program Evaluation and Review Technique (PERT) in Construction Risk Analysis Mei Liu

Chapter 3 Discrete Random Variables and Probability Distributions

56:171 Operations Research Midterm Exam Solutions October 22, 1993

INSE 6230 Total Quality Project Management Winter 2018 Quiz I. Max : 70 points. This is a closed book exam. Answer all the questions in the booklet.

MODULE: INTRODUCTION TO PROJECT MANAGEMENT / PROJECT MANAGEMENT

56:171 Operations Research Midterm Examination October 28, 1997 PART ONE

CISC 322 Software Architecture

Optimization of Rescheduling and Economy. Analysis of the Implementation of Kwitang Office. Park Building Construction Project in Jakarta

SAMPLE. DETERMINING ACTIVITY DURATIONS TCM Framework: 7.2 Schedule Planning and Development. AACE International Recommended Practice No.

Answer Assignment # 3. ENGR 301 Lecture 12. Examples. Examples

ECSE 321: INTRODUCTION TO SOFTWARE ENGINEERING

Uniform Probability Distribution. Continuous Random Variables &

No, because np = 100(0.02) = 2. The value of np must be greater than or equal to 5 to use the normal approximation.

56:171 Operations Research Midterm Examination October 25, 1991 PART ONE

NODIA AND COMPANY. GATE SOLVED PAPER Mechanical Engineering Industrial Engineering. Copyright By NODIA & COMPANY

Homework solutions, Chapter 8

Research Methods Outline

Plan Implementation. Pushpa Lal Shakya


PASS4TEST. IT Certification Guaranteed, The Easy Way! We offer free update service for one year

PAPER 5: ADVANCED MANAGEMENT ACCOUNTING QUESTIONS

OPTIMISING NET PRESENT VALUE USING PRIORITY RULE-BASED SCHEDULING

Transcription:

Project Management Techniques (PMT) Critical Path Method (CPM) and Project Evaluation and Review Technique (PERT) are 2 main basic techniques used in project management. Example: Construction of a house. Construction of a bridge. Construction of a power plant. Large industrial projects etc. Organizing research and development activities etc. ACTIVITY DESCRIPTION DURATION (WEEKS) IMMEDIATE PREDECESSORS A Obtain budget approval 2 - B Obtain machine 5 A C Hire operator 1 A D Install machine 1 B E Train operator 6 C F Produce the goods 1 D, E A B D F 6 C E Activity Activity NODES Events In Time Begins Ends (Tail Event) (Head Event)

RULES OF NETORK CONSTRUCTION: 1. Each defined activity is represented by one and only one arrow in the network. 2. Before an activity begins, all activities preceding it must be completed. 3. The arrow direction indicates general progression in time. The arrow head represents the point in time at which the activity completion event takes place. 4. Events are identified by numbers. There should be no duplication of numbers. 5. A network should have only one initial and one terminal node. 6. Parallel activities between two events, without intervening events, are prohibited i.e., 2 activities cannot have same head and tail events. A A B Dummy Activity A (1-2) A (1-2) B B (1-2) B (1-3) Minimum number of dummy activities should be used for efficient network. 7. Looping is not permitted in a network. A B If A precedes B and B precedes C, then C cannot precede A C

Critical Path Method (CPM) LC ES 8 15 E (6) J (5) 20 0 0 A (2) F (8) K (4) B (6) G (3) L (3) N (7) 27 D (3) C (4) H (7) M (13) 9 14 I (2) PHASE 1: Earliest Start Times (ES) {Forward Pass} Let D ij duration of activity (i, j). ES j Earliest start times of all the activities at node j. ES j = max (ES i + D ij ) Node 1: ES 1 = 0 Node 2: ES 2 = ES 1 + D 12 = 0 + 2 = 2 Node 3: ES 3 = ES 1 + D 13 = 0 + 6 = 6 Node 4: ES 4 = max (ES i + D i4 ) (i = 1, 3) = max [(ES 1 + D 14), (ES 3 + D 34 )] = max [4, (6 + 3)] = 9 Node 5: ES 5 = ES 2 + D 25 = 2 + 6 = 8 Node 6: ES 6 = max (ES i + D i6 ) (i = 2, 3, 4)

= 16 Node 7: ES 7 = ES 4 + D 47 = 9 + 2 = 11 Node 8: ES 8 = max (ES i + D i8 ) (i = 5, 6) = max [(ES 5 + D 58), (ES 6 + D 68 )] = max [(8 + 5), (16 + 4)] = 20 Node 9: ES 9 = max (ES i + D i8 ) (i = 6, 7, 8) = max [(ES 6 + D 69), (ES 7 + D 79 ), (ES 8 + D 89 )] = max [(16 + 3), (11 + 13), (20 + 7)] = max [19, 24, 27] = 27 PHASE 2: Latest Completion Time (LC i ) {Backward Pass} Let LC j latest completion time of all activities at node j. LC i = min (LC j - D ij ) Node 9: LC 9 = ES 9 = 27 Node 8: LC 8 = LC 9 - D 89 = 27 7 = 20 Node 7: LC 7 = LC 9 D 79 = 27 13 = 14 Node 6: LC 6 = min (LC j D 6j ) = 16 Node 5: LC 5 = 15 Node 4: LC 4 = 9 Node 3: LC 3 = 6 Node 2: LC 2 = 8 Node 1: LC 1 = 0 i ES i LC i 1 0 0 2 2 8 3 6 6 4 9 9 5 8 15 6 16 16 7 11 14 8 20 20 9 27 27

Critical Activities: B D H K N. Project Completion Time: 6 + 3 + 7 + 4 +7 = 27 months. FLOATS Total FLOATS: It is the amount of time that the activity completion time can be delayed without affecting the project completion time. TF ij = LC j - ES i - D ij Free FLOATS: It is the amount of time that the activity completion time can be delayed without affecting the earliest start time of the immediate successor activities in the network. FF ij = ES j ES i - D ij Activity Duration Total FLOATS Free FLOATS (i, j) D ij TF ij FF ij 1-2 2 6 0 1 3 6 0 0 1-4 4 5 5 2-5 6 7 0 2-6 8 6 6 3-4 3 0 0 3 6 3 7 7 4 6 7 0 0 4-7 2 3 0 5 8 5 7 7 6 8 4 0 0 6 9 3 8 8 7 9 13 3 3 8-9 7 0 0

Any critical activity will have zero Total FLOAT and zero Free FLOAT. Probabilistic estimate. 3 estimate are used : a optimistic time. b pessimistic time. m most likely time. PERT Optimistic Time: If the execution goes extremely good. Pessimistic Time: If the execution goes very badly. Most Likely Time: Time estimate if execution is normal. The Probabilistic data for project activities generally follow beta distribution. The formula for mean (µ) and variance (σ 2 ) of beta distribution are given as: Mean µ = (a + 4m + b) / 6 And variance σ 2 = [(b - a) / 6] 2 The range for time estimate is from a to b. The expected project completion time is Where, µ i expected duration of critical activity The variance of the project completion time is Where, variance of the i th critical activity in the critical path. For the statistical analysis we need to know the probability of completing the project on or before due date (C). For this beta distribution is approximated to standard normal distribution whose statistics is given as: Ƶ = (x - µ) / σ Where, x actual project completion time. µ expected project completion time. σ standard deviation of the expected project completion time. Therefore, P(x <= C) represents the probability that the project is completed on or before the time C. This can be converted into the standard normal statistics Ƶ as: P { [ (x - µ) / σ] <= [(C - µ) / σ] } = P { Ƶ <= [(C - µ) / σ] }

EXAMPLE: ACTIVITY PREDECESSOR DURATION (weeks) a m b A - 6 7 8 B - 1 2 9 C - 1 4 7 D A 1 2 3 E A, B 1 2 9 F C 1 5 9 G C 2 2 8 H E, F 4 4 4 I E, F 4 4 10 J D, H 2 5 14 K I, G 2 2 8 a. Construct the project network. b. Find the expected duration and variance of each activity. c. Find the critical path and the expected project completion time. d. What is the probability of completing the project on or before 25 weeks? e. If the probability of completing the project is 0.84, find the expected project completion time.

SOLUTION: Step a. 7 7 D 14 14 A D1 H J 0 0 B E 10 10 20 20 7 7 C F I K 5 4 G 17 15

Step b. ACTIVITY DURATION (weeks) MEAN VARIANCE a m b DURATION A 6 7 8 7 0.11 B 1 2 9 3 1.78 C 1 4 7 4 1.00 D 1 2 3 2 0.11 E 1 2 9 3 1.78 F 1 5 9 5 1.78 G 2 2 8 3 1.00 H 4 4 4 4 0.00 I 4 4 10 5 1.00 J 2 5 14 6 4.00 K 2 2 8 3 1.00 Step c. Critical Path: A D1 E H J Project completion time = 20 weeks. Step d. Sum of variance of all the activities on the critical path is: 0.11 + 1.78 + 0.00 + 4.00 = 5.89 weeks Therefore, σ = 5.89 = 2.43 weeks. P ( x <= 25 ) = P { [(x - µ) / σ] <= [(25-20) / 2.43] } = P ( Ƶ <= 2.06 ) = 0.9803 Therefore, the probability if completing the project on or before 25 weeks is 0.9803.

Step e. P( x <= C) = 0.84 P { [ (x - µ) / σ] <= [(C - µ) / σ] } = 0.84 P ( Ƶ <= [(C - 20) / 2.43]) = 0.84 From the standard normal table the value of Ƶ = 0.99, when cumulative probability is 0.84. (C - 20) / 2.43 = 0.99 C = 2.44 weeks The project will be completed in 22.4 weeks ( 23 weeks) if the probability of completing the project is 0.84.