Analysing the AoN network Project Management (seminar)

Slides:



Advertisements
Similar presentations
Lecture Network Analysis
Advertisements

WBS: Lowest level OBS: Lowest level
Chapter 7 Project Management
Exemplar A. Introduction Proman is a company that specialises in managing building projects. It has been contracted to manage a project to build a new.
Based on the book: Managing Business Process Flows
3 - 1 Course Title: Production and Operations Management Course Code: MGT 362 Course Book: Operations Management 10 th Edition. By Jay Heizer & Barry Render.
Operations Management Session 27: Project Management.
1 Lecture by Junaid Arshad Department of Engineering Management Abridged and adapted by A. M. Al-Araki, sept WBS: Lowest level OBS: Lowest level.
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.
Floats in the AoA network
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,
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.
إدارة المشروعات Projects Management
Tutorial 2 Project Management Activity Charts (PERT Charts)
PREPARED BY : NOR AZAH BINTI AZIZ KOLEJ MATRIKULASI TEKNIKAL KEDAH PROJECT NETWORK DIAGRAM.
MGMT 483 Week 8 Scheduling.
Network exercise (P2) Consider the PERT/CPM network shown below. D A 2
Chapter 3 (Continued) Outline Recap CPM (continued)  Assign time estimates to each activity  Compute the longest time path through the network.
Project Scheduling: Networks, Duration Estimation, and Critical Path
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.
Managing Projects. Project Management Questions zWhat activities are required to complete a project and in what sequence? zWhen should each activity be.
Network planning Learning objectives After these lectures you should be able to: - Produce and analyse activities networks - Calculate earliest and latest.
Analysing the AoA network Project Management. Total Project Time The minimum time in which the project can be completed. Calculation: forward pass Forward.
Module 5 – Networks and Decision Mathematics Chapter 24 – Directed Graphs.
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 CTC-415. Activity Network Development Network Models Activity on Node Precedence Diagram Method Activity on Arrow Network Characteristics Discrete.
Drawing AOA and AON networks
MANA 705 DL © Sistema Universitario Ana G. Méndez, All rights reserved. W6 6.2 Operation Management Operation Management Managing Projects Techniques.
Project Management. Projects „Unique, one-time operations designed to accomplish a specific set of objectives in a limited time frame.”
Switch off your Mobiles Phones or Change Profile to Silent Mode.
3 - 1© 2011 Pearson Education 3 3 Managing Projects PowerPoint presentation to accompany Heizer and Render Operations Management, 10e, Global Edition Principles.
© Pearson Education Limited 2004 OHT 8.1 Cadle and Yeates: Project Management for Information Systems, 4th edition Critical Path Method(CPM)
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.
Business Department Session 6 Exam Question –Draw Network diagram –Identify Critical path –Sketch Gantt Chart –‘Crash’ the project Reduce the project completion.
Switch off your Mobiles Phones or Change Profile to Silent Mode.
In Chapter 5: Scheduling the Project From Action Plan and WBS to Gantt chart and project network.  Gantt Chart  Project Network  Activity-on-arrow 
Project Management Part 5 Project Scheduling. Topic Outline: Project Scheduling Identifying relationships among activities Project network diagrams Identifying.
Lags in Precedence Relationships
15B Critical path analysis. In a critical path analysis, edges represent activities. Nodes (vertices) represent the end of one activity and the start.
Project Management – Part 1. Overview What is a project? Project management techniques Activity lists Network diagrams Critical path analysis Gant charts.
Chapter 4 MIS Project Management Lecturer Sihem Smida Sihem Smida Developing a project plan.
Operations and Project Management Session 3 Extra Some Additional Details on CPM and PERT.
Project Planning, Scheduling and Control Planning: –defines objectives, tasks and preceeding relationships; estimates time and resources Scheduling: –identifies.
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
Projects: Critical Paths
Multiple dependency activity on node networks
Analysing the AoA network
Project Scheduling: networks, duration estimation, and critical path
Analysing the AoA network
Analysing the AoA network
Activity on Node Approach to CPM Scheduling
Analysing the AoA network
Project Management (lecture)
Project Management (lecture)
Exercise – A small building.
Project management (seminar)
Analysing the AoA network
Project Management (lecture)
Project Management (lecture)
Multiple dependency activity on node (AoN) networks
Multiple dependency activity on node (AoN) networks
Presentation transcript:

Analysing the AoN network Project Management (seminar)

Activity label & description Data on the activity node ESTEFT Duration LSTLFT Total Float

Total Project Time The shortest time in which the project can be completed. Determined by the critical path. Calculation: forward pass Forward pass: The earliest start times (EST) of all activities are calculated. Trom these the earliest finishing times (EFT) are also calculated

Critical path sequence of activities that has no float time, and that determines the duration of the project. It is the longest path. Activities on the critical path are the critical activities. The critical path can be identified by a backward pass, calculating the Latest Finishing Times (LFT), and from these the Latest Starting Times (LST).

Floats in AoN Total float: the time by which an activity can be delayed or extended without affecting the TPT. It can be used to delay the start of an activity or to increase its duration. TF = LST - EST Free float: the time by which an activity can be delayed or extended without affecting the start of any succeding activity. FF = EST j+1 - EFT j

Example: organising a conference Objectives: to organise a 3 days long open scientific conference with participants, lectures, buffet reception, a conference book of the best studies and TV and radio interviews with some of the most known lecturers. Create the WBS chart and create the task list with estimated durations and precedence relations (in a table form) Plot both the AoA and AoN diagram Calculate the TPT, identify the critical path the total and the free float times.

Example: WBS Project BookMarketing Event management Organising interviews Editing Collecting articles Publishing Peer reviewing Arranging event Infra- structure Organising participants StaffFacilitiesMaterials Invitation and marketing

Activity label Task descriptionDurationImmediate predecessors a Invitation b Organising participants c Facilities d Staffing e Materials h Collecting articles j Peer reviewing k Publishing l Organising interviews m Arranging event Activity label Task descriptionDuration (weeks) Immediate predecessors a Invitation2 b Organising participants4 c Facilities3 d Staffing4 e Materials3 h Collecting articles6 j Peer reviewing3 k Publishing5 l Organising interviews1 m Arranging event1 Activity label Task descriptionDuration (weeks) Immediate predecessors a Invitation2– b Organising participants4a c Facilities3b d Staffing4b e Materials3b f Collecting articles6b g Peer reviewing3f h Organising interviews1c, d, e i Publishing5g j Arranging event1h, i Task list with precedence relations

AoA a2a 3e3e 4d4d 3 4b4b c f 6 3g3g i 1h1h 5 1j1j TPT = 21 CP: a-b-f-g-i-j

AoN a b f e d c g i j h TPT: 21 CP: a-b-f-g-i-j

Activity times for the previous diagram (continue individually) ActivityDurationESTLSTEFTLFTTotal float Free float a b C d e f g h i j

Example 2 (for individual practice) a) Draw the AoA and AoN diagram with the data below: Activity label Duration (weeks) Immediate predecessors a 1– b 2a c 5a d 3a e 2b f 2e g 4f, c, d b) Determine the TPT and the critical path and activity floats. c) Compute the EETs, LETs and slack for every node in the AoA & ESTs, LSTs, EFTs, LFTs in the AoN diagram.

Solution: AoA a1a 2e2e 2b2b 5c5c 3d3d 4g4g 2f2f 7 11 TPT: 11 CP: a-b-e-f-g Float: 0 T. float: 3 F. float: 3 Float: 0 Slack: 0 Slack: 3 Slack: 0 T. float: 1 F. float: 1 0

Solution: AoN a b c d f e g TPT: 11 CP: a-b-e-f-g

Example a2a 3e3e 2b2b 5c5c 3d3d 4g4g f1f 2h2h a)Calculate the EETs and LETs. b)Create a precedence table (with task, duration, immediate predecessor, total and free floats). 0

Solution ActivityDurationTotal float Free float a200 b200 C511 d333 e300 f155 g400 h200

Readings Lockyer – Gordon (2005) Chapter 14.

Thanks for the attention!