ENM448-Project Planning and Management

Slides:



Advertisements
Similar presentations
Developing a Project Plan CHAPTER SIX Copyright © 2011 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin.
Advertisements

Developing a Project Plan CHAPTER SIX Student Version Copyright © 2011 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin.
Chapter 6: Developing a Project Plan
Project Management 6e..
Developing the Project Plan
Where We Are Now Copyright © 2011 The McGraw-Hill Companies, All Rights Reserved.
Project Management Project Management
Developing a Project Plan
PROJECT MANAGEMENT Outline What is project mean? Examples of projects…
Network Diagramming Network Analysis  The common term for network analysis is PERT  PERT stands for Program Evaluation and Review Technique  The word.
A simple set of tasks in “timeline-schedule” form Req. Gathering Req. Analysis High Level Design Detail Design & Code Test Case DevelopmentTest Execution.
Developing a Project Plan
8-1 Scheduling Scheduling Defined Gantt Charts Network Techniques: PERT and CPM Determining Task Durations Probability and Simulation Some Examples.
Project Scheduling Prof. Jiang Zhibin Dept. of IE, SJTU.
1 University of Wales Bachelor of Science (Industrial Engineering and Management) Year 3 Copyright © 2012 MDIS. All rights reserved.Section
Chapter 4: Schedule, cost, and situation analysis (pt. 1) ISE 443 / ETM 543 Fall 2013.
9-1 Project Scheduling: Networks, Duration Estimation, and Critical Path Chapter 9 © 2007 Pearson Education.
Project Scheduling: Networks, Duration estimation, and Critical Path.
MGMT 483 Week 8 Scheduling.
9-1 Project Scheduling: Networks, Duration Estimation, and Critical Path Chapter 9 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall.
5/4/20151 NETWORK SCHEDULING TECHNIQUES. 5/4/20152 Network Diagrams  PMI defines the scheduling process as: “the identification of the project objectives.
ELC 347 project management
Project Development Scheduling and Probability of Completion.
Project Management OPER 576 Project Networks Greg Magnan, Ph.D. April 29, 2004.
Project Scheduling: Networks, Duration Estimation, and Critical Path
Copyright © 2013 Pearson Education, Inc. Publishing as Prentice Hall Day 15.
Project Management (2) Chapter 16, Part 2. EJR 2006 Review of Project Management, Part 1 What is a project? Examples of projects Project performance expectations.
Chapter 10 Project Scheduling: PERT/CPM
Precedence Network Calculations the basic information that should be calculated in the precedence network are: 1) Early activity start (ES) 2) Early activity.
Project Scheduling: Networks, Duration estimation, and Critical Path
Scheduling Computations for Precedence Networks. Prof. Awad Hanna Tabular Format (Precedence Diagram)  Can be carried out on the tabular form without.
Prof. Awad Hanna Estimating Activity Duration Time Interval  Time Interval is selected according to the nature of the activity (seconds - minutes…) 
Copyright © 2013 Pearson Education, Inc. Publishing as Prentice Hall o P.I.I.M.T o American University of Leadership Ahmed Hanane, MBA, Eng, CMA, Partner.
Where We Are Now. Where We Are Now Developing the Project Plan The Project Network A flow chart that graphically depicts the sequence, interdependencies,
THE MANAGERIAL PROCESS Clifford F. Gray Eric W. Larson Developing a Project Plan Chapter 6.
MANA 705 DL © Sistema Universitario Ana G. Méndez, All rights reserved. W6 6.2 Operation Management Operation Management Managing Projects Techniques.
PERT Program Evaluation and Review Technique Tong Wang 511D ERB.
McGraw-Hill/Irwin© 2008 The McGraw-Hill Companies, All Rights Reserved Developing a Project Plan Chapter 6.
Switch off your Mobiles Phones or Change Profile to Silent Mode.
PROJECT MANAGEMENT Outline What is project mean? Examples of projects… Project Planning and Control Project Life Cycle Gantt Chart PERT/CPM.
A tutorial on MS Project James Burns. 22 Learning Objectives  Entering Tasks in the Gantt View  Task subordination  Linking of Tasks  Setting start.
Chapter 4 MIS Project Management Lecturer Sihem Smida Sihem Smida Developing a project plan.
9-1 ELC 347 project management Day 19. Agenda Integrative Project –Part 4 Due –Part 5 Due Nov 24 (page 342) –Any of the first five sections can be resubmitted.
The Network Diagram. When to Do What?  Carrying out one activity after the other may result in project completion, but it will take the longest possible.
BU630-4 Project and Operations Management
Project Management MGT 30725
Project Management -- Developing the Project Plan
Project Management: PERT/CPM
Chapter 17 Project Management McGraw-Hill/Irwin
Project Planning & Scheduling
Project Management (PERT/CPM) PREPARED BY CH. AVINASH
PERT and CPM.
Time Planning and Control Activity on Node Network (AON)
Project Planning & Scheduling
Project Planning and Scheduling
A tutorial on MS Project
Chapter 6: Project Time Management
Projects: Critical Paths
PROJECT MANAGEMENT WITH CPM/PERT.
Project Management CPM Method Tutorial-p2
Time Planning and Control Activity on Node Network (AON)
Decision making and Organization Management
Project Management Planning Models
Developing a Project Plan
Tabular Format (Precedence Diagram)
Time Planning and Control Activity on Node Network (AON)
Exercise – A small building.
Presentation transcript:

ENM448-Project Planning and Management Examples

Preliminaries for CPM Forward Pass—Earliest Times How soon can the activity start? (early start—ES) How soon can the activity finish? (early finish—EF) How soon can the project be finished? (expected time—TE) Backward Pass—Latest Times How late can the activity start? (late start—LS) How late can the activity finish? (late finish—LF) Which activities represent the critical path (CP)? This is the longest path in the network which, when delayed, will delay the project. How long can the activity be delayed? (slack or float—SL)

Forward Pass—Earliest Times Add activity times along each path in the network (ES + Duration = EF). Carry the early finish (EF) to the next activity where it becomes its early start (ES) unless… The next succeeding activity is a merge activity, in which case the largest EF of all preceding activities is selected.

Backward Pass—Latest Times Subtract activity times along each path in the network (LF - Duration = LS). Carry the late start (LS) to the next activity where it becomes its late finish (LF) unless The next succeeding activity is a burst activity, in which case the smallest LF of all preceding activities is selected.

Problem 1 (CPM) You are completing a group term paper. Given the project network that follows, complete the forward and backward pass, compute activity slack, and identify the critical path. Use this information to create a Gantt chart for the project. Be sure to show slack for noncritical activities. Activity Description Duration Predecessor A Identify topic 1 None B Research topic 5 C Draft paper 3 D Edit paper 2 E Create graphics F References G Final draft D,E,F

Solution Critical Path Network

Solution (cont’d)

Problem 2 (CPM) A.Construct a precedence diagram. B. On the diagram, compute the four schedule dates (ESD, EFD, LSD, LFD) and the four floats (TF, FF, INTF, and IDF) for each activity, and the lag for each link. C. Identify the critical path.

Preliminaries for PERT

Problem 3 (PERT)

a)Determine the expected value and the variance of the completion time for each activity. b) Use the expected times from (a) to find the critical path. c) Assuming that the normal distribution applies, determine the probability that the critical path will take between 18 and 26 days to complete. d) How much time must be allowed to achieve a 90% probability of timely completion?

Solution

Solution (cont’d) b) By using the expected time (mean) of each activity, we find that the critical path is A-C-D. Remark: For this simple project, we can find the longest path (A-C-D) has the largest expected time, which is the critical path. The mean critical path duration is μ= 6 + 14 + 4 = 24. The variance of the critical path duration is the sum of the variances along the path:   σ2cp = (4+256+4) / 36 = 264/36 so that the standard deviation is readily computed as σcp = 2.708.

Solution (cont’d) c) The interval probability may be computed as the difference between two cumulative probabilities as follows:  P(18 ≤ t  ≤  26) = P(t  ≤  26) - P(t  ≤  18). Two separate z computations are required. First at 26 we have   z26= (26-24) / 2.708=0.739 Then by looking up the normal table with z26=0.739, we have one result that P(t ≤ 26) = 0.770

Solution (cont’d) Secondly, at 18 we have z18= (18-24) / 2.708= -2.216 and P(t ≤ 18) = 0.013 Combining these two results yields the desired probability as P(18 ≤ t ≤ 26) = 0.770 - 0.013= 0.757.

Solution (cont’d) d) For 90% probability, we must pick a z value corresponding to 90% of the area under the normal curve, 50% left of mean and 40% right of mean, so z = 1.282. Then solving for t we have t = 24 +1.282*2.708 = 27.47 days.

Problem 3 (PERT) a) Determine the expected value and the variance of the completion time for each activity. b) Use the expected times from (a) to find the critical path. c) What is the probability the project will be completed before a scheduled time of 67?

Solution a) Activity times and variances

Solution (cont’d) b)

Solution (cont’d)

Problem 5 (Crashing/Reducing Project Duration) Use the information contained below to compress one time unit per move using the least cost method. Reduce the schedule until you reach the crash point of the network. For each move identify what activity(s) was crashed, the adjusted total cost, and explain your choice if you have to choose between activities that cost the same. If the indirect cost for each duration are $1,500 for 17 weeks, $1,450 for 16 weeks, $1,400 for 15 weeks, $1,350 for 14 weeks, $1,300 for 13 weeks, $1,250 for 12 weeks, $1,200 for 11 weeks, and $1,150 for 10 weeks, what is the optimum cost-time schedule for the project? What is the cost?

Problem 5 (Crashing/Reducing Project Duration)

Solution

Solution (cont’d)

Solution (cont’d)

Solution (cont’d)