Module 5 – Networks and Decision Mathematics Chapter 24 – Directed Graphs.

Slides:



Advertisements
Similar presentations
Lecture Network Analysis
Advertisements

Chapter 7 Project Management
CP Chapter 4 Schedule Planning.
Copyright © 2008 Pearson Education, Inc. Slide 13-1 Unit 13C Scheduling Problems.
PROJECT MANAGEMENT Network or Critical Path Analysis
Network analysis is the general name given to certain specific techniques which can be used for the planning, management and control of projects. Use.
Based on the book: Managing Business Process Flows
Critical Path Analysis. There are no pre-requisites for this Achievement Standard so it can be placed in any course. No knowledge is pre-supposed.
Operations Management Session 27: Project Management.
D1: Critical Events And Critical Paths. D1: Critical Events And Paths A critical path is the list of activities on an activity network that, if they are.
Scheduling the Project
Scheduling The Project  Scheduling Planning, budgeting and scheduling are all part of the same process Planning a project, developing a budget for it,
Copyright © 2008 Pearson Education, Inc. Slide 13-1 Unit 13C Scheduling Problems.
Chapter 10: Project Schedule Planning
1 1 Slide © 2000 South-Western College Publishing/ITP Slides Prepared by JOHN LOUCKS.
Tutorial 2 Project Management Activity Charts (PERT Charts)
5.8 Project Management Chapter 37 HL - Only.
MGMT 483 Week 8 Scheduling.
Chapters 8, 9, and 10 Design Stage 1 Preconstruction Stage 2: Procurement Conceptual Planning Stage3: Construction Stage 4: Project Close-out.
Activity networks – Example 1 TaskDuration (hours)Immediate predecessors A3- B4- C6- D5A E1B F6B G7C, D, E The table below shows the tasks involved in.
Critical Paths.
Analysing the AoA network Project Management. Total Project Time The minimum time in which the project can be completed. Calculation: forward pass Forward.
ME 380 Project Planning. Critical Path Method (CPM) Elements: Activities & Events Feature: Precedence relations ActivityDurationPrecedence A4- B5- C3A.
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.
15C Backward scanning and crashing
This work is licensed under a Creative Commons Attribution 3.0 Unported LicenseCreative Commons Attribution 3.0 Unported License (CC-BY). Project Management.
PROJECT MANAGEMENT Outline What is project mean? Examples of projects… Project Planning and Control Project Life Cycle Gantt Chart PERT/CPM.
A brief summary of Critical Path (or network) Analysis Critical Path Analysis is a way of planning complex projects. It allows one to find those parts.
Module 5 – Networks and Decision Mathematics Chapter 23 – Undirected Graphs.
Lesson Objective Understand what critical path analysis is Be able to prioritise events and create a precedence table Begin to use the precedence table.
© Pearson Education Limited 2004 OHT 8.1 Cadle and Yeates: Project Management for Information Systems, 4th edition Critical Path Method(CPM)
Network Analysis Terminology
1 Selected Topics on Project Management The Critical Path Dr Marc Conrad 1Marc Conrad.
Irwin/McGraw-Hill © The McGraw-Hill Companies, Inc., 1999 PROJECT MANAGEMENT 18-1 Project Management.
Project Management Chapter 16. MGMT 326 Foundations of Operations Introduction Strategy Managing Projects Quality Assurance Facilities Products & Processes.
In Chapter 5: Scheduling the Project From Action Plan and WBS to Gantt chart and project network.  Gantt Chart  Project Network  Activity-on-arrow 
Analysing the AoN network Project Management (seminar)
Copyright 2006 John Wiley & Sons, Inc. Beni Asllani University of Tennessee at Chattanooga Project Management Operations Management - 5 th Edition Chapter.
6/10/01Network Problems: DJK1 Network Problems Chapters 9 and 10.
1 TCOM 5143 Lecture 11 Project Management. 2 What’s Project Management? Project management involves planning and scheduling the different activities of.
 Chapter 6: Activity Planning – Part 3 NET481: Project Management Afnan Albahli.
15B Critical path analysis. In a critical path analysis, edges represent activities. Nodes (vertices) represent the end of one activity and the start.
Graphs Definition: a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected.
 Chapter 6: Activity Planning – Part 2 NET481: Project Management Afnan Albahli.
DECISION 1. How do you do a Bubble Sort? Bubble Sort:  You compare adjacent items in a list;  If they are in order, leave them.  If they are not in.
First name ??? ist auf Englisch. Critical Path Analysis.
IE 366 Chapter 6, Section 10 Project Planning and Scheduling.
Critical Path Analysis (CPA)
Critical Path Method(CPM)
UNIT II Scheduling Procedures & Techniques FLOAT
Chapter 5: Project Time Management Doddy Prayogo, Ph.D.
Activity networks – Example 1
Project Scheduling Lecture # 1.
Project Management for Business
Critical Path Analysis (CPA)
Analysing the AoA network
Developing a Project Plan
Project Scheduling: networks, duration estimation, and critical path
Critical Path Analysis
Analysing the AoA network
תזמון פרויקטים.
Analysing the AoA network
PERT - The Program Evaluation and Review Technique
Analysing the AoA network
Activity Networks
Critical Path Analysis
Critical Path Analysis
Activity Networks
Analysing the AoA network
Critical Path Analysis
Presentation transcript:

Module 5 – Networks and Decision Mathematics Chapter 24 – Directed Graphs

24.3 Critical Path Problems 0 Developing and manufacturing products frequently involves many interconnected activities. 0 Some activities cannot be started until other activities have been completed. 0 Weighted digraphs can be used and are often created using a table.

Important facts about critical paths 0 The weight of the critical path is the minimal length of time required to complete the project. 0 Increasing the time required for any critical activity will also increase the time necessary to complete the project. 0 A critical activity is any task, that if delayed, will also delay the entire project.

Drawing Weighted Diagrams When drawing weighted diagrams for critical path problems, the following conventions apply: 0 The edges (arcs) represent the activities 0 The vertices (nodes) represent events 0 The ‘start vertices’ have no immediate predecessors (activities that must take place before them) 0 A vertex (finishing node) representing the completion of the project, must be included in the network

0 No multiple edges (an activity can only be represented by one edge) 0 2 vertices can be connected by, at most, one edge. In order to satisfy the last two conventions, it is sometimes necessary to include a dummy activity that takes zero time. Insert diagram

Earliest Starting Time (EST) 0 The earliest time an activity can be commenced. 0 The EST for activities without predecessors is zero. Insert diagram (page 653)

Latest Starting Time (LST) 0 The time an activity can be left if the whole project is to be completed on time. 0 LSTs are found by working backwards through the network. Insert diagram (page 653)

Float 0 The float or slack of a non-critical activity is the amount by which the latest starting time is greater than its earliest starting time. Float time = latest starting time – earliest starting time 0 The existence of a float means that an activity can start later than its earliest start time, or the duration of the activity can be increased.

0 For critical activities, the float time is zero. 0 For non-critical activities this is the difference between the LST & EST. Insert diagram Critical Path = B – D – E – F Float times: Activity A = 3-0 = 3 Activity B = 9-9 = 0 Activity C = 18-9 = 9 Activity D = 9-9 = 0 etc…

Project Crashing 0 Project Crashing is the process of shortening the length of time in which a project can be completed by completing some activities more quickly. 0 This can usually only be done by increasing the cost of the project. Insert diagram