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.

Slides:

Advertisements

Similar presentations

Critical Path Analysis. Why Is CPA Important? CPA is arguably the piece of maths used most often, outside of basic arithmetic. Important not only in commerce.

Advertisements

Lecture Network Analysis

WBS: Lowest level OBS: Lowest level

Work Breakdown Structure

CP Chapter 4 Schedule Planning.

Critical Path Analysis Activity duration Shower3 Dry hair8 Fetch car7 Iron clothes12 Dress and make-up10 Drive to interview20 Example 4.1 textbook pages.

Chapter 13 Project Scheduling: PERT/CPM

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.

1 Lecture by Junaid Arshad Department of Engineering Management Abridged and adapted by A. M. Al-Araki, sept WBS: Lowest level OBS: Lowest level.

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.

1 1 Slide © 2000 South-Western College Publishing/ITP Slides Prepared by JOHN LOUCKS.

Chapter 4: Schedule, cost, and situation analysis (pt. 1) ISE 443 / ETM 543 Fall 2013.

Tutorial 2 Project Management Activity Charts (PERT Charts)

CPA A house is to have new carpets fitted throughout. The work involved has been divided into a number of tasks, as shown in the table.

MGMT 483 Week 8 Scheduling.

5/4/20151 NETWORK SCHEDULING TECHNIQUES. 5/4/20152 Network Diagrams  PMI defines the scheduling process as: “the identification of the project objectives.

Project Scheduling Critical Path Method

Construction Planning and Scheduling A G E NG 520 Schedule Computations Part #2 1. Definition and Computation of Total and Free Floats: Total Float : The.

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

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.

Chapters 8, 9, and 10 Design Stage 1 Preconstruction Stage 2: Procurement Conceptual Planning Stage3: Construction Stage 4: Project Close-out.

D1: Event Times.

SCHEDULING Critical Activities are: B, F, I, M, Q.

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.

Analysing the AoA network Project Management. Total Project Time The minimum time in which the project can be completed. Calculation: forward pass Forward.

ISP-2010 Network Evaluation & Analysis ISP Project Management.

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

1 ARCH 435 PROJECT MANAGEMENT Lecture 3: Project Time Planning (Arrow Diagramming Technique) Activity on Arrow (AOA)

15C Backward scanning and crashing

Project Scheduling: Networks, Duration estimation, and Critical Path

Prof. Awad Hanna Estimating Activity Duration Time Interval  Time Interval is selected according to the nature of the activity (seconds - minutes…) 

ENGM91 ACTIVITY PLANNING Unit 2

Lesson Objective Understand what critical path analysis is Be able to prioritise events and create a precedence table Begin to use the precedence table.

Network Analysis Terminology

Switch off your Mobiles Phones or Change Profile to Silent Mode.

Analysing the AoN network Project Management (seminar)

6/10/01Network Problems: DJK1 Network Problems Chapters 9 and 10.

University of Sunderland CIFM02 Unit 2 COMM02 Activity Planning Unit 2.

Operational strategies Lean production. The adoption of techniques that help to reduce waste.

1 TCOM 5143 Lecture 11 Project Management. 2 What’s Project Management? Project management involves planning and scheduling the different activities of.

Dr. Hany Abd Elshakour 2/18/ :27 PM 1. Dr. Hany Abd Elshakour 2/18/ :27 PM 2 Time Planning and Control Activity on Arrow (Arrow Diagramming.

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.

PROJECT MANAGEMENT ENCE-7323 TO 763-N CLASS 3 September 17, 2001 Carl E. Edlund

Scheduling Scheduling : is the process of converting a project action plan into an operating time table. Why scheduling ? To answer the following questions:

UNIT II Scheduling Procedures & Techniques FLOAT

Activity networks – Example 1

Project Scheduling Lecture # 1.

Critical Path Analysis (CPA)

Project Time Management.

Analysing the AoA network

Activity on Arrow Project Management.

Project Scheduling: networks, duration estimation, and critical path

Critical Path Analysis

Analysing the AoA network

Project Scheduling Basics Activity on Node Precedence Diagrams

Project Management CPM Method Tutorial-p1

Analysing the AoA network

PERT - The Program Evaluation and Review Technique

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

Analysing the AoA network

BEST VIEWED IN SLIDE SHOW MODE

Project Management (lecture)

Activity Networks

Critical Path Analysis

Critical Path Analysis

Activity Networks

Analysing the AoA network

Project Management (lecture)

Critical Path Analysis

Presentation transcript:

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 a project, with their durations and immediate predecessors. Draw an activity network and use it to find the critical activities and the minimum duration of the project.

Activity networks – Example 1 Activities A, B and C do not depend on any other activity, so they all begin at node 1. A(3) B(4) 1 C(6) First draw a start node labelled 1.

Activity networks – Example 1 Activity D depends on A, so add event node 2 at the end of A. A(3) B(4) 1 C(6) D(5) Now add activity D. 2

Activity networks – Example 1 Activities E and F both depend on B, so add event node 3 at the end of B. A(3) B(4) 1 C(6) Now add activities E and F. E(1) D(5) F(6) 3 2

C(6) B(4) E(1) F(6) 3 Activity networks – Example 1 Activity G depends on C, D and E, so all these three events need to end at the same node. A(3) This is easiest if you redraw the network so that C is between A and B. D(5) 2 B(4) C(6) E(1) F(6) 3 1

Activity networks – Example 1 A(3) D(5) 2 C(6) B(4) E(1) F(6) 3 Now add node 4, with C, D and E leading into it. Now add activity G. 14 D(5) G(7)

Activity networks – Example 1 A(3) 2 C(6) B(4) E(1) F(6) 3 A finish node is now needed. Any activities not leading into a node must end at the finish node. 14 D(5) G(7) 5 F(6) G(7)

Activity networks – Example 1 A(3) 2 C(6) B(4) E(1) 3 The next step is to find the early event times (EETs). An EET is the earliest time that an event (denoted by the numbered nodes) can occur. The event cannot occur until all activities leading into the event node have finished. 14 D(5) 5 F(6) G(7)

Activity networks – Example 1 A(3) 2 C(6) B(4) E(1) 3 Event 1 occurs at time zero. 14 D(5) 5 F(6) G(7) 0

Activity networks – Example 1 A(3) 2 C(6) B(4) E(1) 3 Event 2 cannot occur until A is finished. The earliest time for this is D(5) 5 F(6) G(7) 0 3

Activity networks – Example 1 A(3) 2 C(6) B(4) E(1) 3 Event 3 cannot occur until B is finished. The earliest time for this is D(5) 5 F(6) G(7) 0 3 4

Activity networks – Example 1 A(3) 2 C(6) B(4) E(1) 3 Event 4 cannot occur until C, D and E are all finished. 14 D(5) 5 F(6) G(7) The earliest C can finish is 6. The earliest D can finish is = 8. The earliest E can finish is = 5. So the earliest time for event 4 is 8. 8

Activity networks – Example 1 A(3) 2 C(6) B(4) E(1) 3 Event 5 cannot occur until F and G are both finished. 14 D(5) 5 F(6) G(7) The earliest F can finish is = 10. The earliest G can finish is = 15. So the earliest time for event 5 is

Activity networks – Example 1 A(3) 2 C(6) B(4) E(1) 3 The next step is to find the late event times (LETs), working backwards through the network. A LET is the latest time that an event can occur without delaying the project. The LET is found by finding the latest time that each activity leading out of the event can begin – the LET is the earliest of these. 14 D(5) 5 F(6) G(7)

Activity networks – Example 1 A(3) 2 C(6) B(4) E(1) 3 Event 5 must occur by time 15, or the project will not finish in the minimum possible time. 14 D(5) 5 F(6) G(7)

Activity networks – Example 1 A(3) 2 C(6) B(4) E(1) 3 The only activity leading from event 4 is G, which must start by time 8 if the project is not to be delayed. So event 4 must occur by time D(5) 5 F(6) G(7)

Activity networks – Example 1 A(3) 2 C(6) B(4) E(1) 3 The activities leading from event 3 are E (which must start by time 7) and F (which must start by time 9). So event 3 must occur by time D(5) 5 F(6) G(7)

Activity networks – Example 1 A(3) 2 C(6) B(4) E(1) 3 The only activity leading from event 2 is D, which must start by time 3. So event 2 must occur by time D(5) 5 F(6) G(7)

Activity networks – Example 1 A(3) 2 C(6) B(4) E(1) 3 Finally, event 1 must occur by time zero. 14 D(5) 5 F(6) G(7)

Activity networks – Example 1 The completed network shows that the project can be completed in 15 hours. The critical activities are the activities (i, j) for which the LET for j – the EET for i is equal to the activity duration. The critical activities are A,Dand G. For analysis of the float in this example, see the Notes and Examples. A(3) C(6) B(4) E(1) 3 D(5) F(6) G(7)