Scribd Logo
Upload

Welcome to Scribd!

  • 6 views

    CM Week 10

    Uploaded by

    Muhammad Azhar

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    CM Week 10

    Uploaded by

    Muhammad Azhar
    6 views21 pages

    Original Title

    CM WEEK 10 (1)

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    6 views21 pages

    CM Week 10

    Uploaded by

    Muhammad Azhar

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 21

    Department of Civil Engineering, Faculty of Engineering and Applied Science

    Scheduling Techniques II
    Part Ii
    WEEK-10
    Critical path analysis
    ● Critical path analysis is the process of identifying the longest path in a schedule
    network diagram.
    ● The analysis not only indicates completeness of project schedule but also ascertains
    degree of scheduling flexibility. Moreover, critical path analysis also reveals the
    minimum duration required to complete a project.
    ● Critical path analysis also specifies link between project activities. It is important to
    realize that not all activities can start and finish on time.
    ● Hence critical path analysis specifies permissible delays to activities that are not on
    critical path. Thus schedule flexibility is the permissible delay that does not affect
    project completion date.
    Critical Path Analysis Schedule Network Diagramming
    Techniques
    ● The first activity of critical path analysis is to draw a schedule network
    diagram.
    ● The critical path analysis uses Precedence Diagram Method (PDM) to
    construct the schedule network.
    ● Further, PDM method uses Activity-on-Node (AON) diagramming
    technique to represent the schedule logic.
    ● In AON the nodes represent the schedule activities. Most of the
    scheduling programs use PDM technique to construct project network
    diagram.
    ● Therefore, critical path analysis example problem uses activity-on-node
    method to represent the schedule network logic.
    Critical Path Analysis Schedule Network Diagramming
    Techniques
    ● The Critical Path Method (CPM) is a project management tool used to
    determine the sequence of activities that are critical for the completion of
    a project.
    ● It helps in identifying the longest stretch of dependent activities and
    measuring the time required to complete them from start to finish.
    ● This allows project managers to prioritize tasks and optimize the project
    schedule to meet deadlines.
    ●
    Critical Path Analysis Schedule Network Diagramming
    Techniques
    ● Activities:

    ● Tasks or work components that need to be completed. Each activity is a


    part of the project and has a defined start and end
    ● Dependencies:
    ● Relationships between activities that determine the sequence in which
    they must be performed. Dependencies can be finish-to-start (FS),
    start-to-start (SS), finish-to-finish (FF), or start-to-finish (SF).
    Critical Path Analysis Schedule Network Diagramming
    Techniques
    ● Duration:

    ● The total time required to complete an activity, usually measured in days,


    weeks, or months.
    ● Critical Path:
    ● The longest path through the project network diagram, consisting of
    activities that directly impact the project completion time. Any delay in
    the critical path activities will delay the project.
    Critical Path Analysis Schedule Network Diagramming
    Techniques
    ● Earliest Start Time (ES):The earliest time an activity can start without delaying the
    project. It is determined by the earliest finish times of its predecessor activities.

    ● Earliest Finish Time (EF):The earliest time an activity can finish. It is calculated by
    adding the activity's duration to its earliest start time (EF = ES + Duration).

    ● Latest Start Time (LS):The latest time an activity can start without delaying the project.
    It is determined by subtracting the activity's duration from its latest finish time (LS = LF
    - Duration).

    ● Latest Finish Time (LF):The latest time an activity can finish without delaying the
    project. It is calculated based on the project's required end date and the latest start times
    of its successor activities.
    Critical Path Analysis Schedule Network Diagramming
    Techniques
    Float (or Slack):The amount of time an activity can be delayed without
    affecting the project completion date. It is calculated as the difference between
    the earliest and latest start times (or finish times) of an activity.
    Network Diagram:A visual representation of the project activities and their
    dependencies. It helps in identifying the critical path and managing the project
    schedule effectively.
    Forward Pass:A technique used to calculate the earliest start and finish times
    for each activity by moving forward through the network diagram from the
    start to the finish.
    Backward Pass:A technique used to calculate the latest start and finish times
    for each activity by moving backward through the network diagram from the
    finish to the start.
    Critical Path Analysis Schedule Network Diagramming
    Techniques
    Steps to Perform CPM Analysis:
    List Activities: Identify all activities required to complete the project.
    Determine Dependencies: Define the sequence of activities and their dependencies.
    Estimate Durations: Assign duration estimates to each activity.
    Create Network Diagram: Draw the network diagram based on activities and
    dependencies.
    Perform Forward Pass: Calculate the earliest start and finish times.
    Perform Backward Pass: Calculate the latest start and finish times.
    Identify the Critical Path: Highlight the longest path through the network diagram.
    Calculate Float: Determine the float for each activity to understand scheduling
    flexibility.
    Critical Path Analysis Schedule Network Diagramming
    Techniques
    Total Float: Total float is the amount of time that a task can be delayed without delaying the project's
    completion date. It is the difference between the latest possible start time and the earliest possible start
    time, or the latest possible finish time and the earliest possible finish time.
    Total Float=LS−ES
    Total Float=LF−EF
    Free Float: Free float is the amount of time that a task can be delayed without delaying the earliest
    start time of any subsequent task. It focuses on the impact of a delay on the immediate next tasks
    rather than the entire project.

    Formula:

    ● Free Float=ES (next task) − EF


    ● Where:
    ● ESnext task: Earliest Start time of the subsequent task
    ● EF: Earliest Finish time of the current task
    Critical Path Analysis Schedule Network Diagramming
    Techniques
    ● The following figure represents PMBOK nomenclature for activity
    nodes in precedence diagram method.
    ●
    Critical Path Analysis Schedule Network Diagramming
    Techniques
    Critical Path Method Example With Solution

    To understand the critical path analysis calculation steps consider the following schedule network
    diagram.
    Critical Path Analysis Schedule

    Critical Path Method Example With Solution

    To understand the critical path analysis calculation steps consider the following schedule network
    diagram.
    Critical Path Analysis Schedule
    Critical Path Analysis Schedule
    Critical Path Analysis Schedule
    Critical Path Analysis Schedule
    Critical Path Analysis Schedule PB:1
    Critical Path Analysis Schedule PB:2
    Critical Path Analysis Schedule PB:3
    Any questions?

    You might also like