1 / 9

Critical Path Analysis

This resource provides an in-depth overview of Critical Path Analysis (CPA), focusing on the identification of precedence relationships in project management. It explains key concepts like Earliest Event Times (EET) and Latest Event Times (LET), and how they are calculated through forward and backward progression in a network diagram. Critical activities that must start on time are highlighted, and the relationship between different types of float is explored. This foundational knowledge is essential for effective project scheduling and management.

pennie
Télécharger la présentation

Critical Path Analysis

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Critical Path Analysis Example 4.1 textbook pages 101 - 106

  2. The last activities that must be completed before an activity can begin Precedence table

  3. Activity on Arc Network 2 B(8) A(3) D(12) 1 3 5 E(10) F(20) C(7) 4 The network will build up with each mouse click, in the order you would construct it on paper.

  4. Earliest event timeEET Latest event timeLET Event Times Each event node needs two boxes, to mark in the event times. 2 B(8) A(3) D(12) 1 3 5 E(10) F(20) C(7) 4

  5. Earliest Event Times The EET for an event occurs when all activities leading into that event are complete. 3 2 B(8) A(3) 42 12 D(12) 1 3 5 E(10) 0 F(20) C(7) 4 22 To find EETs, work forwards through the network from the start node to the finish node.

  6. Latest Event Times The LET for an event is the latest it can occur without delaying subsequent events. 4 2 B(8) A(3) 42 12 D(12) 1 3 5 E(10) 0 F(20) C(7) 4 22 To find LETs, work backwards through the network from the finish node to the start node.

  7. Critical Activities Critical activities are activities that cannot run late. For critical activities: Latest finish — Earliest start = length of activity 2 B(8) A(3) D(12) 1 3 5 E(10) F(20) C(7) 4 The green arrows mark the critical activities, which form the critical path. The critical path(s) must form a continuous route from the start node to the finish node.

  8. Float • Total Floatlatest finish – earliest start – length of activity • Independent Floatearliest finish – latest start – length of activity • Interfering Float Total float – Independent float It is useful to represent float in a table.

  9. Float (answers) Hint:Total is maximum possible float so take “outside” no.sIndependent is minimum possible float so take “inside” no.s

More Related