Scribd Logo
Upload

Welcome to Scribd!

  • 566 views

    Pham Thuy Dung - EBBA 10.2 - 11181050. Problem 1 Given The Following Activities and Precedences, Draw An AOA or AON Diagram

    Uploaded by

    Dung Thuy Pham
    This document contains 5 problems related to project scheduling and critical path analysis. It provides network diagrams, critical paths, slack calculations, and probability analyses for projects with multiple activities and precedence relationships. Solutions are provided that include drawing networks, identifying critical paths, calculating slacks, and determining critical path probabilities for on-time project completion.

    Copyright:

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

    Pham Thuy Dung - EBBA 10.2 - 11181050. Problem 1 Given The Following Activities and Precedences, Draw An AOA or AON Diagram

    Uploaded by

    Dung Thuy Pham
    566 views5 pages
    This document contains 5 problems related to project scheduling and critical path analysis. It provides network diagrams, critical paths, slack calculations, and probability analyses for projects with multiple activities and precedence relationships. Solutions are provided that include drawing networks, identifying critical paths, calculating slacks, and determining critical path probabilities for on-time project completion.

    Original Title

    Kfc

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document contains 5 problems related to project scheduling and critical path analysis. It provides network diagrams, critical paths, slack calculations, and probability analyses for projects with multiple activities and precedence relationships. Solutions are provided that include drawing networks, identifying critical paths, calculating slacks, and determining critical path probabilities for on-time project completion.

    Copyright:

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

    Pham Thuy Dung - EBBA 10.2 - 11181050. Problem 1 Given The Following Activities and Precedences, Draw An AOA or AON Diagram

    Uploaded by

    Dung Thuy Pham
    This document contains 5 problems related to project scheduling and critical path analysis. It provides network diagrams, critical paths, slack calculations, and probability analyses for projects with multiple activities and precedence relationships. Solutions are provided that include drawing networks, identifying critical paths, calculating slacks, and determining critical path probabilities for on-time project completion.

    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 5

    CHAPTER 8 - PROJECT SCHEDULING

    ASSIGNMENT
    Pham Thuy Dung - EBBA 10.2 – 11181050.

    Problem 1
    Given the following activities and precedences, draw an AOA or AON diagram:

    Answer
    AON diagram:

    Problem 2
    Given the following network,
    a. What is the critical path?
    b. How long will it take to complete this project?
    c. Can activity B be delayed without delaying the completion of the project? If so,
    how many days?
    Answer
    a.  Possible paths 
    A-D-G = 8 + 7 + 5 = 20 
    A-C-E-G = 8 + 3 + 6 + 5 = 22 
    A-C-F-H = 8 + 3 + 7 + 3 = 21 
    B-E-G = 10 + 6 + 5 = 21 
    B-F-H = 10 + 7 + 3 = 20 
    Critical path is path with longest duration, here longest duration is of path A-C-E-G
    with duration 22 days. Therefore the critical path is A-C-E-G.

    b.  Project duration is the length of the critical path which is 22 days. 

    c.  Activity B is not on the critical and can be delayed without delaying the
    project. Longest path containing activity B is B-E-G with duration 21. Hence
    activity B can be delayed 22 - 21 days = 1 day Do give a positive rating if you
    think this answer helped.

    Problem 3
    Given the estimated activity times below and the network in Problem 2 above

    Activity a m b

    A 6.5 7.5 14.5


    B 8.5 10.5 12.5
    C 2.5 3.5 4.5
    D 6.5 7.5 8.5
    E 5.5 5.5 9.5

    F 5.5 7.5 9.5


    G 4.5 6.5 8.5
    H 2.5 3.5 3.5
    What is the critical path probability that the project will be completed within:
    (a) 21 days?
    (b) 22 days?
    (c) 25 days?
    Answer

    Activity a m b te=(a+4m+b)/6 SD= (b-a)/6 Var= SD^2

    A 6.5 7.5 14.5 8.500 1.333 1.778

    B 8.5 10.5 12.5 10.500 0.667 0.444

    C 2.5 3.5 4.5 3.500 0.333 0.111

    D 6.5 7.5 8.5 7.500 0.333 0.111

    E 5.5 5.5 9.5 6167 0.667 0.444

    F 5.5 7.5 9.5 7.500 0.667 0.444

    G 4.5 6.5 8.5 6.500 0.667 0.444

    H 2.5 3.5 3.5 3.333 0.167 0.028

    Activit te=(a+4m+b) Predecesso Successo ES EF LS LF Slac


    y /6 rs rs k

    A 8.500  C,D 0.00 8.50 0.00 8.50 0.00

    B 10.500  E,F 0.00 10.5 1.50 12.0 1.50


    0 0

    C 3.500 A E,F 8.50 12.0 8.50 12.0 0.00


    0 0

    D 7.500 A G 8.50 16.0 10.6 18.1 2.17


    0 7 7

    E 6167 B,C G 12.0 18.1 12.0 18.1 0.00


    0 7 0 7

    F 7.500 B,C H 12.0 19.5 13.8 21.3 1.83


    0 0 3 3
    G 6.500 D,E  18.1 24.6 18.1 24.6 0.00
    7 7 7 7

    H 3.333 F  19.5 22.8 21.3 24.6 1.83


    0 3 3 7

    Base on zero slack, the critical path is A-C-E-G


    a. p(x <= 21) = 1.39%
    b. p(x <= 22) = 5.48%
    c. p(x <= 25) = 57.93%

    Problem 4

    Activit a m b
    y

    AB 3 6 9

    AC 1 4 7

    CB 0 3 6

    CD 3 3 3

    CE 2 2 8

    BD 0 0 6

    BE 2 5 8

    DF 4 4 10

    DE 1 1 1

    EF 1 4 7

    Find
    (a) The AOA network and the critical path.
    (b) All event slacks.
    (c) Critical path to event D.
    (d) Critical path probability of completion in 14 days.
    (e) The effect if CD slips to 6 days; to 7 days; to 8 days.
    Answer
    a. Critical path: ABCEF (AC - CB - BE - EF)
    b. Event slacks:
    A    0 - 0 = 0
    B    7 - 7 = 0
    C    4 - 4 = 0
    D    11 - 8 = 3
    E    12 -12 = 0
    F    16 - 16 = 0
         (c) Critical path to event D is:  AC - CB - BD if we consider up to event D
         (d)  p (x < 14) = p ([(x - 14)/6] <= [(14 - 16)/2]) 
                                = p (2 <= -1)
                                = 0,15866
         (e) if CD = 6, there is no change in CD.
              if CD = 7 days, there will be two more CD:  AC-CD-DF and AC-CD-DE-EF.
              If CD = 8 days, there will be only two CD:  AC-CD-DE and AC-CD-DE-EF.

    Problem 5

    The events of the project below are designated as 1, 2, and so on.


    (a) Draw the network.
    (b) Find the critical path.
    (c) Find the slacks on all the activities.

    Activities Prec. Suc. Evt. TE (weeks) Prec. Activ.


    Evt.

    a 1 2 3 none
    b 1 3 6 none
    c 1 4 8 none
    d 2 5 7 a
    e 3 5 5 b
    f 4 5 10 c
    g 4 6 4 c
    h 5 7 5 d, e, f
    i 6 7 6 g

    Answer

    You might also like