Scribd Logo
Upload

Welcome to Scribd!

  • 6 views

    ﻲﻛﺒﺸﻟا لﯿﻠﺤﺘﻟا ﺔﻘﯿرط Net-work Analysis

    Uploaded by

    anmar
    The document discusses network analysis and network diagrams as tools for project planning and scheduling. It notes that traditional bar chart scheduling methods have limitations in showing the logical relationships between project activities, flexibility in determining start and finish times, and impact of delays. Network diagrams were developed as a scientific and practical alternative. The key features of network diagrams listed are determining early and late start/finish times of activities and events, calculating schedule float, identifying critical activities and paths, and scheduling resources and costs. The two main types of network representations - activity-on-arrow and activity-on-node - are also described.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    ﻲﻛﺒﺸﻟا لﯿﻠﺤﺘﻟا ﺔﻘﯿرط Net-work Analysis

    Uploaded by

    anmar
    6 views10 pages
    The document discusses network analysis and network diagrams as tools for project planning and scheduling. It notes that traditional bar chart scheduling methods have limitations in showing the logical relationships between project activities, flexibility in determining start and finish times, and impact of delays. Network diagrams were developed as a scientific and practical alternative. The key features of network diagrams listed are determining early and late start/finish times of activities and events, calculating schedule float, identifying critical activities and paths, and scheduling resources and costs. The two main types of network representations - activity-on-arrow and activity-on-node - are also described.

    Original Description:

    manger for civil engeneering

    Original Title

    2

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document discusses network analysis and network diagrams as tools for project planning and scheduling. It notes that traditional bar chart scheduling methods have limitations in showing the logical relationships between project activities, flexibility in determining start and finish times, and impact of delays. Network diagrams were developed as a scientific and practical alternative. The key features of network diagrams listed are determining early and late start/finish times of activities and events, calculating schedule float, identifying critical activities and paths, and scheduling resources and costs. The two main types of network representations - activity-on-arrow and activity-on-node - are also described.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    6 views10 pages

    ﻲﻛﺒﺸﻟا لﯿﻠﺤﺘﻟا ﺔﻘﯿرط Net-work Analysis

    Uploaded by

    anmar
    The document discusses network analysis and network diagrams as tools for project planning and scheduling. It notes that traditional bar chart scheduling methods have limitations in showing the logical relationships between project activities, flexibility in determining start and finish times, and impact of delays. Network diagrams were developed as a scientific and practical alternative. The key features of network diagrams listed are determining early and late start/finish times of activities and events, calculating schedule float, identifying critical activities and paths, and scheduling resources and costs. The two main types of network representations - activity-on-arrow and activity-on-node - are also described.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 10

    .

    Net-work Analysis



    . :

    .
    .
    .
    .
    .


    .
    .
    .
    ,


    ) ( )(

    .1 Activity on Arrow (A.o.A)networks :

    .2 Activity on Node (A.o.N)networks:

    (also called Precedence Diagram Method (PDM


    .
    .

    ) (

    .
    ) ( )(
    .
    .
    A
    8


    Preceding Activity :


    . Followed Activity :

    .


    )
    (:

    .
    .
    :
    .

    -
    -


    .
    .

    Dummy Activity :



    .

    .



    .

    .

    .
    : E.S Early Start
    .

    :E.F Early Finish


    E.S .
    .

    :L.F Latest Finish


    .

    :L.S Latest Start


    L.F .

    :Foreword &Backward
    .


    .

    :T.F Total Float



    ) (L.S-E.S ) ( L.F-E.F

    A .
    2 2 8 9 11

    :F.F Free Float


    . ) E.S E.F - (

    ). .
    A

    3
    2 2 9 11

    :I.F In depended Float



    .

    ) E.S L.F (
    .
    A

    2 2 3 9 11

    Critical Path:

    .

    .

    E.F E.S
    C.P I.F F.F T.F L.SL.F
    Act. (Dur. Prece E.S E.F L.F L.S T.F F.F I.F C.P
    )day ded
    by
    A 2 - 0 2 2 0 0 0 0
    B 6 A 2 8 8 2 0 0 0
    C 6 B 8 14 14 8 0 0 0
    D 1 B 8 9 11 10 2 0 0
    E 3 A 2 5 11 8 6 4 4
    F 3 DE 9 12 14 11 2 2 0
    G 2 FC 14 16 16 14 0 0 0

    8 8 16 16
    C 14 14 G
    B
    2 2
    0 0 A 6 2
    6 D
    2 E 1 F
    3
    3

    9 11
    H.W

    :

    .
    .
    E.F E.S
    . C.P I.F F.F T.F L.SL.F
    .

    Act. Dur.(day) Preceded Followed E.S E.F L.F L.S T.F F.F I.F C.P
    by by
    A 3 BC, D 0 3 3 0 0 0 0
    B 3 A E, F 3 6 8 5 2 0 0
    C 6 A F, G 3 9 9 3 0 0 0
    D 4 A G, H 3 7 9 5 2 0 0
    E 5 B I 6 11 13 8 2 2 0
    F 4 BC I 9 13 13 9 0 0 0
    G 4 C, D I, J 9 13 13 9 0 0 0
    H 3 D K 7 10 19 16 9 9 7
    I 6 E, F, G K 13 19 19 13 0 0 0
    J 5 G K 13 18 19 14 1 1 1
    K 3 I, J, H 19 22 22 19 0 0 0

    6 8
    E

    13 13
    B 5
    3
    3 3
    F
    0 0 9 9
    A C 4
    9 9

    3 13 13 I
    6
    J
    G 6
    D
    4
    4
    5
    9 9 K 22 22
    H
    3
    19 19
    3

    7 9
    .

    E.F E.S
    . C.P I.F F.F T.F L.SL.F

    Act. )Dur.(day E.S E.F L.F L.S T.F F.F I.F C.P
    1-2 4 0 4 4 0 0 0 0
    2-3 4 4 8 11 7 3 0 0
    2-4 7 4 11 11 4 0 0 0
    2-5 4 4 8 24 20 16 0 0
    3-6 0 8 8 11 11 3 3 0
    3-10 15 8 23 45 30 22 22 19
    4-6 0 11 11 11 11 0 0 0
    4-8 7 11 18 24 17 6 0 0
    5-8 0 8 8 24 24 16 10 0
    5-10 10 8 18 45 35 27 27 11
    6-7 6 11 17 17 11 0 0 0
    7-8 0 17 17 24 24 7 1 1
    7-9 14 17 31 31 17 0 0 0
    8-9 7 18 25 31 24 6 6 0
    8-10 10 18 28 45 35 17 17 11
    9-10 14 31 45 45 31 0 0 0
    C.P=1-2,2-4,4-6,6-7,7-9,9-10

    =4+7+0+6+14+14=45
    8 11

    15

    4 11 11
    17 17 45 45
    31 31
    7
    4 4 6
    0 0 6 10
    14
    9 14
    1 2
    4
    7

    8 10
    7
    4 7 18 24

    11 11 10
    4

    8 24
    .

    Activity on Nodes
    ) (A.O.N :

    .1 .

    .2 ) ) A.O.N .

    .3 .
    .4 .
    .5 .
    .6 :

    E.S Dur. E.F


    Act. Name
    L.S T.F L.F
    : ) ( A.O.N
    .
    Act. Dur.(d Prece Follow E.S E.F L.F L.S T.F F.F I.F C.P
    )ay ded by ed by
    A 2 - B,E 0 2 16 14 0 0 0 *
    B 6 A C,D 2 8 8 2 0 0 0 *
    C 6 B G 8 14 14 8 0 0 0 *
    D 1 B F 8 9 11 10 2 0 0
    E 3 A F 2 5 11 8 6 4 4
    F 3 DE G 9 12 14 11 2 2 0
    G 2 FC 14 16 16 14 0 0 0 *
    C.P:A,B,C,G
    = 2+6+6+2

    2 8 8 6 14
    6

    B
    C
    0 2 2
    8 0 14
    2 0 8
    A 14 2 16

    8 1 9
    0 0 2 G
    D
    14 0 16

    2 3 5 10 2 11
    9 3 12

    E
    F
    8 6 11
    11 2 14
    .

    : 20
    .

    Act. )Dur.(day Followed by Relationship

    A 2 B F.S=2
    E S.S=3
    B 6 C F.F=4
    F.S=2
    D F.S=2
    C 6 G F.S=2

    D 1 F S.F=3

    E 3 F F.F=2

    F 3 G F.S=0

    G 2

    32 6 38
    24 6 30
    2 C
    B 2
    32 0 38
    24 0 30
    40 2 42
    2
    4
    G
    20 22 40 0 42
    2 2 32 1 13

    A D 0
    20 0 22 37 5 38

    32 3 35

    3
    23 3 26 F

    E 37 5 40

    35 12 38 3

    C.P:A,B,C,G=2+2+6+2+6+2+2=22
    .

    22

    : A.O.N :

    Act. A B C D E F G H I J K
    Dur. 5 4 3 2 7 2 5 3 5 6 4
    Follow. D C E F H G J I K I
    Relation =F.S =F.S =F.S =S.S S.F=5 S.S=4 =F.F =F.S =F.S =F.S
    . 3 0 2 6 F.S=2 F.S=0 5 3 5 0

    8 2 10 12 3 15
    3
    0 5 5 D 2 0
    H 15 5 20
    A
    15 7 17 19 22
    7 7 12
    I
    0 0 0
    5
    22 7 27
    Start
    4 3 7 3
    0 0 0 27 0 27

    0
    C End
    10 2 12
    11 6 17
    11 7 14 27 0 27
    0 4 4
    F J
    B 6
    17 7 19
    21 10 27
    0 0 4 5
    23 4 27
    2 K
    23 0 27
    6 7 13 13 5 18 5
    0
    E G

    6 0 13 13 18
    4

    Critical Path :B, E, G, k

    4+2+7+5+4=27

    You might also like