Managing time ‘Time is nature’s way of stopping everything happening at once’ Hughes & Cotterell 2002 Production Process.

Slides:



Advertisements
Similar presentations
Lecture Network Analysis
Advertisements

WBS: Lowest level OBS: Lowest level
© The McGraw-Hill Companies, Software Project Management 4th Edition Activity planning Chapter 6.
Project Management Projects are unique, one-time operations designed to accomplish a specific set of objectives in a limited timeframe Project managers.
1 1 Slide © 2006 Thomson South-Western. All Rights Reserved. Slides prepared by JOHN LOUCKS St. Edwards University.
Chapter 13 Project Scheduling: PERT/CPM
Chapter 9 Project Scheduling: PERT/CPM
Network analysis is the general name given to certain specific techniques which can be used for the planning, management and control of projects. Use.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edwards University.
ES=32 EF=34 LS=33 LF=35 ES=10 EF=16 LS=10 LF=16 ES=4+6=10 EF=10 LS=4
1 1 Slide © 2001 South-Western College Publishing/Thomson Learning Anderson Sweeney Williams Anderson Sweeney Williams Slides Prepared by JOHN LOUCKS QUANTITATIVE.
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.
1 Topics to cover in 2 nd part ( to p2). 2 Chapter 8 - Project Management Chapter Topics ( to p3)
CEN th Lecture CEN 4021 Software Engineering II Instructor: Masoud Sadjadi Software Project Planning.
Gantt Chart Graph or bar chart with a bar for each project activity that shows passage of time Provides visual display of project schedule Slack amount.
Project Scheduling Prof. Jiang Zhibin Dept. of IE, SJTU.
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
Defining activities – Activity list containing activity name, identifier, attributes, and brief description Sequencing activities – determining the dependencies.
1 1 Slide © 2000 South-Western College Publishing/ITP Slides Prepared by JOHN LOUCKS.
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.
Project Scheduling Critical Path Method
1 1 Slide © 2009 South-Western, a part of Cengage Learning Slides by John Loucks St. Edward’s University.
Project Management OPER 576 Project Networks Greg Magnan, Ph.D. April 29, 2004.
Chapter 3 (Continued) Outline Recap CPM (continued)  Assign time estimates to each activity  Compute the longest time path through the network.
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.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
Chapter 10 Project Scheduling: PERT/CPM
1 Slide © 2005 Thomson/South-Western Chapter 10 Project Scheduling: PERT/CPM Project Scheduling with Known Activity Times Project Scheduling with Known.
Precedence Network Calculations the basic information that should be calculated in the precedence network are: 1) Early activity start (ES) 2) Early activity.
Projects: Critical Paths Dr. Ron Lembke Operations Management.
Project Management Techniques.
EMGT 501 HW # Due Day: Sep 27.
EMGT 501 HW #2 Answer. 020/3 X 3 05/601-1/62/3050/3 X 6 0-5/300-2/3-1/3180/3 (c).3/230with )3/80,0,0,3/50,3/20,0(*)*, ( solution Optimal   Z.
Projmgmt-1/14 DePaul University Project Management I - Realistic Scheduling Instructor: David A. Lash.
Software project management (intro) Scheduling Network.
Prof. Awad Hanna Estimating Activity Duration Time Interval  Time Interval is selected according to the nature of the activity (seconds - minutes…) 
Project Management Chapter 3 BUSI 2106 – Operations Management.
Project Time Management J. S. Chou, P.E., Ph.D.. 2 Activity Sequencing  Involves reviewing activities and determining dependencies.  A dependency or.
The Critical Path – Precedence diagram method Luise Lorenz Christina Mohr.
Dr. Godfried Williams1 Project Management – Topic 6 Lecture Content Planning Tools/Techniques Optimization Techniques Resource Planning & Allocation Linear.
Project Time Management J. S. Chou, P.E., Ph.D.. 2 Activity Sequencing  Involves reviewing activities and determining dependencies.  A dependency or.
Software Project Management Task Estimating and Scheduling
Copyright 2006 John Wiley & Sons, Inc. Beni Asllani University of Tennessee at Chattanooga Project Management Operations Management - 5 th Edition Chapter.
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
6/10/01Network Problems: DJK1 Network Problems Chapters 9 and 10.
Mark Kelly Vceit.com Gantt Having Fun with. 2 Well, “fun” might be optimistic At least they’re more fun than this…
Chapter 7 – PERT, CPM and Critical Chain Operations Management by R. Dan Reid & Nada R. Sanders 4th Edition © Wiley 2010.
5 th LectureCEN 4021: Software Engineering II Task Sequence and Effort representation  All tasks share at least two basic characteristics –Require effort.
(M) Chapter 12 MANGT 662 (A): Procurement, Logistics and Supply Chain Design Purchasing and Supply Chain Analysis (1/2)
TK3333 Software Management Topic 6: Scheduling. Contents  Estimate the duration for each activity  Establish the estimated start time and required completion.
Prof.Dr. Ahmet R. Özdural – Class Notes_06 - KMU417 Project Planning and Organization – Fall Semester.
Project Management – Part 1. Overview What is a project? Project management techniques Activity lists Network diagrams Critical path analysis Gant charts.
Unit 2 Time Management Prepared by: Prof. Seemaah Keddar.
Scheduling Scheduling : is the process of converting a project action plan into an operating time table. Why scheduling ? To answer the following questions:
Project Management: PERT/CPM
Project Management (PERT/CPM) PREPARED BY CH. AVINASH
Project Planning & Scheduling
Projects: Critical Paths
Software Project Management
BEST VIEWED IN SLIDE SHOW MODE
Slides Prepared by JOHN LOUCKS
Exercise – A small building.
Presentation transcript:

Managing time ‘Time is nature’s way of stopping everything happening at once’ Hughes & Cotterell 2002 Production Process

Lecture content Recap on last week Scheduling What is Critical Path Analysis? – Why use CPA? – Problems associated with CPA – How to perform CPA

Recap on last week Stakeholders Identifying the goals of the project Defining tasks – Activity based approach – Product based approach – Hybrid approach

Scheduling Scheduling is the process of assigning tasks to a set of resources. It is an important concept in many areas such as computing and production processes. In mathematical terms, a scheduling problem is often solved as an optimisation problem, with the objective of maximising a measure of schedule quality.

Scheduling Forward scheduling planning the tasks from the start date. Reverse scheduling planning the tasks from the due date.

CPA & PERT Critical Path Analysis and PERT are powerful tools that help you to schedule and manage complex projects. Developed in the 1950s to control large defense projects. Have been used routinely since then.

Why use CPA? Shows the sequence of activities Shows dependencies Aids scheduling resources & financial planning Used as a basis of control Diagrammatic therefore easier to read

What is Critical Path Analysis? 1. Using intertask dependencies, determine every possible path through the project. 2. For each path, sum the durations of all tasks in the path. 3. The path with the longest total duration is the critical path.

Problems associated with CPA Pay too much attention to critical path Experience needed to gauge durations Difficulties in separating tasks Only deals with numbers Doesn’t guarantee good project management, nothing does!!!

Events v. activities Event = a point in time – has no duration – e.g the start or end of an activity Activity = a task or an action with a recognisable start and finish and a duration Prepare breakfast Eat breakfast activities events

Start & Finish times Activity = a task or action with a recognisable start/finish time e.g. ‘write report software’ Earliest start (ES) Earliest finish (EF) = ES + duration Latest finish (LF) = latest task can be completed without affecting project end Latest start = LF – duration Earliest start Latest finish Earliest finish Latest start activity

Example Earliest start = 5 days Latest finish = day 30 Duration = 10 days Float = LF-ES-Duration Earliest finish =? Latest start = ? Float = ? The total float of an activity is the amount of time by which the task may be extended or delayed without delaying completion of the project.

Notation Activity description Activity labelduration ES LS EF LF Activity span Float

Earliest start time/date Earliest start date for the current activity = earliest finish date for the previous When there is more than one previous activity, take the latest earliest finish Note ‘day 7’ = end of work on day 7

Example EF = day 7 EF = day10 ES = day 10

What is the ES for G? A B C D F E G ES = day 0 Duration 5 Duration 6 Duration 10 Duration 9 Duration 8 Duration 3 Duration 4

Complete the table

Latest start date Start from the last activity Latest finish (LF) for last activity = earliest finish (EF) work backwards Latest finish for current activity = Latest start for the following More than one following activity - take the earliest LS Latest start (LS) = LF for activity - duration

LS for all activities? A B C D F E G ES = day 0 Duration 5 Duration 6 Duration 10 Duration 9 Duration 8 Duration 3 Duration 4

Complete the table

Now add the float!

Answer

Find the Critical path Note the path through network with zero floats Critical path: any delay in an activity on this path will delay whole project Can there be more than one critical path? Can there be no critical path? Sub-critical paths

Estimating task duration 1. minimum amount of time it would take to perform the task = optimistic duration (OD). 2. maximum amount of time = pessimistic duration (PD). 3. expected duration (ED) 4. Calculate the most likely duration (D) as follows: D = (1 x OD) + (4 x ED) + (1 x PD) 6

Something to think about… Can we truly say that by adding more human resource to a project it will reduce the time it takes to perform the task?

Further Reading PM_04.htm PM_04.htm of.htm inc.com/projex/PERT/cpa.htm inc.com/projex/PERT/cpa.htm eatures/criticalpath/default.asp eatures/criticalpath/default.asp