Project Management Critical Path Method Demonstration

Slides:

Advertisements

Similar presentations

PROJECT MANAGEMENT Chu Eu Ho Dept. of Civil and Environmental Engineering Massachusetts Institute of Technology.

Advertisements

Precedence Diagramming

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

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

Prosjektstyring A 5 WEEKS B 10 WEEKS C 12 WEEKS D 8 WEEKS E 6 WEEKS ACTIVITY (t) ESEF FL LS LF We have a network with.

CPM Network Computation

ES=32 EF=34 LS=33 LF=35 ES=10 EF=16 LS=10 LF=16 ES=4+6=10 EF=10 LS=4

Network Diagramming Network Analysis  The common term for network analysis is PERT  PERT stands for Program Evaluation and Review Technique  The word.

CSSE Sep.2008 Constructing and Analyzing the Project Network Diagram Chapter 6.

A simple set of tasks in “timeline-schedule” form Req. Gathering Req. Analysis High Level Design Detail Design & Code Test Case DevelopmentTest Execution.

CSSE 372 Week 6 Day 2 Constructing and Analyzing the Project Network Diagram  PERT Chart PERT was invented for the Nautilus submarine project. Ok, maybe.

1 University of Wales Bachelor of Science (Industrial Engineering and Management) Year 3 Copyright © 2012 MDIS. All rights reserved.Section

إدارة المشروعات Projects Management

PREPARED BY : NOR AZAH BINTI AZIZ KOLEJ MATRIKULASI TEKNIKAL KEDAH PROJECT NETWORK DIAGRAM.

Prosjektstyring A (12) B (10) C (12) D (9) E (18) F (11) H (10) G (11) I (7) FF3 SS8 FF5 FF7FS0 SF21 SS8 FF3.

Dr. Neal CIS 480 MS Project Concepts Dr. Greg Neal CIS 480 Systems Analysis and Design.

Dr. Hany Abd Elshakour 5/4/2015 3:55 PM 1. Dr. Hany Abd Elshakour 5/4/2015 3:55 PM 2 Time Planning and Control Activity on Node Network and Precedence.

Project Networks. A,4 B,3 C,4 D,6 E,3 H,6 F,5 G,4 I,2 St,0 Fin,0 Example Network - terminology C,t Activity Duration of Activity (ES, LS) Early Start.

Project Management OPER 576 Project Networks Greg Magnan, Ph.D. April 29, 2004.

Project Scheduling: Networks, Duration Estimation, and Critical Path

ActivityDurationPredecessor Activity A3- B5- C4A D7B E10B F3E G8C, D In this example, we will carry out a calculation by using an AOA-network and the information.

ActivityDurationPredecessor Activity A3- B5- C4A D7B E10B F3E G8C, D In this example we will carry out a calculation by using AOA-network, on the basis.

Network planning Learning objectives After these lectures you should be able to: - Produce and analyse activities networks - Calculate earliest and latest.

Precedence Network Calculations the basic information that should be calculated in the precedence network are: 1) Early activity start (ES) 2) Early activity.

CE 405 – SCHEDULING CRITICAL PATH In order to be an effective Scheduler/ Project Manager – and realizing that you will have too many things demanding your.

Time Management Ahmed Awad, Ph.D., PMP. Time Management It includes the processes required to ensure timely completion of the project. b Activity Definition.

Project Management Chapter 3 BUSI 2106 – Operations Management.

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,

Time Planning and Con trol Precedence Diagram.  Precedence Diagramming  An important extension to the original activity-on-node concept appeared around.

THE MANAGERIAL PROCESS Clifford F. Gray Eric W. Larson Developing a Project Plan Chapter 6.

Software Project Management Task Estimating and Scheduling

© Construction Management Association of America. Do Not Duplicate or Reproduce. Standards of Practice Course CPM Scheduling Lab.

Irwin/McGraw-Hill © The McGraw-Hill Companies, Inc., 1999 PROJECT MANAGEMENT 18-1 Project Management.

Washington DC Metro Chapter April 13, Basic Project Scheduling Techniques Presented by: David Hunsberger MCP – Microsoft Project (1995)

PROJECT MANAGEMENT Definitions WBS = Work Breakdown Structure

A tutorial on MS Project James Burns. 22 Learning Objectives  Entering Tasks in the Gantt View  Task subordination  Linking of Tasks  Setting start.

Developing a Project Plan

Project Management Fundamentals - Planning Tools 1.

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.

Project Management MGT 30725

Add and Subtract Negative Numbers

A tutorial on MS Project

Projects: Critical Paths

Analysing the AoA network

Project Management CPM Method Tutorial-p2

Time Planning and Control Precedence Diagram

ENM448-Project Planning and Management

Project Scheduling Basics Activity on Node Precedence Diagrams

IS Project Management Mini review

Project Management CPM Method Tutorial-p1

תזמון פרויקטים.

Solution to Problem 2 Developed by: Alex J. Ruiz-Torres, Ph.D.

1 Total Slack A 3d Task Early Start Late Start Early Finish

Project Scheduling: Lagging, Crashing and Activity Networks

Solution to Problem 1 Developed by: Alex J. Ruiz-Torres, Ph.D.

Management & Project Control - Present by Dr.Amir.A.Shojaie

BEST VIEWED IN SLIDE SHOW MODE

ELC 347 project management

Lecture 5: Project Time Planning (Precedence Diagramming Technique)

Exercise – A small building.

Time Planning and Control Precedence Diagram

Presentation transcript:

Project Management Critical Path Method Demonstration V4.4

1. Determine # of paths 300 1 4 5 7 8 11 Go through each sequence of activities and identify the ‘paths’ starting on the left at Start. A 4 B 3 C 4 4 7 8 10 14 17 1 5 6 13 8 14 Start D 5 E 8 F 7 Finish 1 5 6 13 11 17 Paths: 6 11 Start-A-B-C-Finish 14 17 G 6 H 4 8 13 14 17

1. Determine # of paths 300 1 4 5 7 8 11 Go through each sequence of activities and identify the ‘paths’ starting on the left at Start. A 4 B 3 C 4 4 7 8 10 14 17 1 5 6 13 8 14 Start D 5 E 8 F 7 Finish 1 5 6 13 11 17 Paths: Start-A-B-C-Finish 6 11 14 17 Start-A-B-F-Finish G 6 H 4 8 13 14 17

1. Determine # of paths 300 1 4 5 7 8 11 Go through each sequence of activities and identify the ‘paths’ starting on the left at Start. A 4 B 3 C 4 4 7 8 10 14 17 1 5 6 13 8 14 Start D 5 E 8 F 7 Finish 1 5 6 13 11 17 Paths: Start-A-B-C-Finish 6 11 14 17 Start-A-B-F-Finish G 6 H 4 Start-D-E-H-Finish 8 13 14 17

1. Determine # of paths 300 1 4 5 7 8 11 Go through each sequence of activities and identify the ‘paths’ starting on the left at Start. A 4 B 3 C 4 4 7 8 10 14 17 1 5 6 13 8 14 Start D 5 E 8 F 7 Finish 1 5 6 13 11 17 Paths: Start-A-B-C-Finish 6 11 14 17 Start-A-B-F-Finish G 6 H 4 Start-D-E-H-Finish Start-D-G-H-Finish 8 13 14 17

2. Determine each path’s aggregate duration 300 1 4 5 7 8 11 Add-up the durations of each path. Be careful of special relationships such as SS or FF, lags or leads! A 4 B 3 C 4 4 7 8 10 14 17 1 5 6 13 8 14 Start D 5 E 8 F 7 Finish 1 5 6 13 11 17 Paths: Start-A-B-C-Finish 6 11 14 17 Start-A-B-F-Finish G 6 H 4 Start-D-E-H-Finish Start-D-G-H-Finish 8 13 14 17

2. Determine each path’s aggregate duration 300 1 4 5 7 8 11 Add-up the durations of each path. Be careful of special relationships such as SS or FF, lags or leads! A 4 B 3 C 4 4 7 8 10 14 17 1 5 6 13 8 14 Start D 5 E 8 F 7 Finish 1 5 6 13 11 17 Paths: Start-A-B-C-Finish 11 6 11 14 17 Start-A-B-F-Finish G 6 H 4 Start-D-E-H-Finish Start-D-G-H-Finish 8 13 14 17

2. Determine each path’s aggregate duration 300 1 4 5 7 8 11 Add-up the durations of each path. Be careful of special relationships such as SS or FF, lags or leads! A 4 B 3 C 4 4 7 8 10 14 17 1 5 6 13 8 14 Start D 5 E 8 F 7 Finish 1 5 6 13 11 17 Paths: Start-A-B-C-Finish 11 6 11 14 17 Start-A-B-F-Finish 14 G 6 H 4 Start-D-E-H-Finish Start-D-G-H-Finish 8 13 14 17

2. Determine each path’s aggregate duration 300 1 4 5 7 8 11 Add-up the durations of each path. Be careful of special relationships such as SS or FF, lags or leads! A 4 B 3 C 4 4 7 8 10 14 17 1 5 6 13 8 14 Start D 5 E 8 F 7 Finish 1 5 6 13 11 17 Paths: Start-A-B-C-Finish 11 6 11 14 17 Start-A-B-F-Finish 14 G 6 H 4 Start-D-E-H-Finish 17 Start-D-G-H-Finish 8 13 14 17

2. Determine each path’s aggregate duration 300 1 4 5 7 8 11 Add-up the durations of each path. Be careful of special relationships such as SS or FF, lags or leads! A 4 B 3 C 4 4 7 8 10 14 17 1 5 6 13 8 14 Start D 5 E 8 F 7 Finish 1 5 6 13 11 17 Paths: Start-A-B-C-Finish 11 6 11 14 17 Start-A-B-F-Finish 14 G 6 H 4 Start-D-E-H-Finish 17 Start-D-G-H-Finish 15 8 13 14 17

3. Determine the critical path 300 1 4 5 7 8 11 3. Determine the critical path The path(s) with the highest cumulative duration will be the critical path. A 4 B 3 C 4 4 7 8 10 14 17 1 5 6 13 8 14 Start D 5 E 8 F 7 Finish 1 5 6 13 11 17 Paths: Start-A-B-C-Finish 11 6 11 14 17 Start-A-B-F-Finish 14 G 6 H 4 Start-D-E-H-Finish 17 Start-D-G-H-Finish 15 8 13 14 17

3. Determine the critical path 300 1 4 5 7 8 11 3. Determine the critical path The path(s) with the highest cumulative duration will be the critical path. A 4 B 3 C 4 4 7 8 10 14 17 1 5 6 13 8 14 Start D 5 E 8 F 7 Finish 1 5 6 13 11 17 Paths: Start-A-B-C-Finish 11 6 11 14 17 Start-A-B-F-Finish 14 G 6 H 4 Start-D-E-H-Finish 17 Start-D-G-H-Finish 15 8 13 14 17

4. Forward Pass 5. Backward Pass 300 1 4 5 7 8 11 Start with 1 for ES of each path Increment values (not add) Use highest value at convergences A 4 B 3 C 4 4 7 8 10 14 17 1 5 6 13 8 14 Start D 5 E 8 F 7 Finish 1 5 6 13 11 17 5. Backward Pass Use highest EF as LF of each path Decrement values (not subtract) Use lowest value at convergences 6 11 14 17 G 6 H 4 8 13 14 17