Scribd Logo
Upload

Welcome to Scribd!

  • 158 views

    Shoreline Stadium Case

    Uploaded by

    sminy
    The document outlines the calculation of earliest start and finish times for activities in a network diagram for a stadium project to determine the expected finish time. It presents the network diagram and calculates the earliest finish times for each activity in a table. The critical path is identified as the longest path through the network from start to finish, taking 945 days to complete the project.

    Copyright:

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

    Shoreline Stadium Case

    Uploaded by

    sminy
    158 views4 pages
    The document outlines the calculation of earliest start and finish times for activities in a network diagram for a stadium project to determine the expected finish time. It presents the network diagram and calculates the earliest finish times for each activity in a table. The critical path is identified as the longest path through the network from start to finish, taking 945 days to complete the project.

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document outlines the calculation of earliest start and finish times for activities in a network diagram for a stadium project to determine the expected finish time. It presents the network diagram and calculates the earliest finish times for each activity in a table. The critical path is identified as the longest path through the network from start to finish, taking 945 days to complete the project.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    158 views4 pages

    Shoreline Stadium Case

    Uploaded by

    sminy
    The document outlines the calculation of earliest start and finish times for activities in a network diagram for a stadium project to determine the expected finish time. It presents the network diagram and calculates the earliest finish times for each activity in a table. The critical path is identified as the longest path through the network from start to finish, taking 945 days to complete the project.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    You are on page 1of 4

    1

    Shoreline Stadium Case

    Student Name
    Institution Affiliation
    Course
    Date
    2

    Question 1
    The network diagram for the stadium is shown below:

    11

    9 14
    10
    18 20
    2 3 4 5 6 7 12 15
    3 5
    13
    19

    16 17

    To calculate the expected finish time for each activity, we have to calculate the ES (earliest time)

    and the EF (earliest finish) of each activity.

    Because task 2 start time is 0, there is no ES for this task. It lasts for a total of 70 days.

    Therefore, the formula for determining the early finish of activity 2 is as follows:

    Earliest finish = Earliest start + Duration

    = 0+70

    = 70

    Since task 2 precedes task 3, the EF of task 2 is Earliest start of task 3. The EF of task 3 is:

    EF = 70+30

    = 100

    The EF or all activities are shown in the table below:

    Now that 19 has two predecessors, the one with the higher EF will serve as the activity's ES. EF

    for all activities is given below:


    3

    Acti 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
    vity

    EF 70 100 170 290 410 530 500 530 670 620 560 650 745 700 260 440 835 925 945

    Five activities precede activity 20 that is activity 8, 11,13,15,19. Since the EF of 19 is 925, which
    is highest among other predecessors, therefore is used as the Earliest Start for activity 20.
    As such,
    Early Finish for task 20 = 20 + 925 = 945
    Therefore, the total amount of time needed to finish the project is 945 days.
    The time span from July 3, 2017 and April 3, 2020 is exactly 1005 days. As a result, the project
    will likely be complete by April 3.
    Question 2
    To find the critical path, calculate the total days for every path.
    Path 2-3-4-5-6-9-10-14-18-19-20 = 945
    Path 2-3-4-5-6-9-11-20 = 760
    Path 1-2-3-4-16-17-19-20 = 500
    Path 2-3-4-5-6-8-20 = 640
    Path 2-3-4-5-6-9-10-15-20 = 840
    Path 2-3-4-5-6-9-13-20 = 790
    The critical path is the one that takes the most time.
    Therefore, Path 2-3-4-5-6-9-10-14-18-19-20 can be takes as the critical path since it takes the
    maximum days to complete (945) of all possible paths.
    4

    Question 3
    I recommend G&E pursue the contract since the project will likely be complete by April 3 therefore no penalties are likely to be
    incurred.

    Acti 30 60 90 120 150 180 210 24 270 300 33 360 390 42 450 480 51 540 570 60 630 660 690 720 75 780 810 84 870 900 930 960
    vity 0 0 0 0 0 0 0

    2
    3
    4
    5
    6
    7
    8
    9
    10
    11
    12
    13
    14
    15
    16
    17
    18
    19
    20

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy