Scribd Logo
Upload

Welcome to Scribd!

  • 3 views

    Engineering Planning

    Uploaded by

    soudip27ce

    Copyright:

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

    Engineering Planning

    Uploaded by

    soudip27ce
    3 views10 pages

    Original Title

    Engineering Planning (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
    3 views10 pages

    Engineering Planning

    Uploaded by

    soudip27ce

    Copyright:

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

    CE 420/520

    ENGINEERING PLANNING
    Activity Durations and Resource Requirements
    Activity Duration Engineers (E) Trucks (T)
    A 1 day 1E 1T
    B 3 days 2E 1T
    C 2 days 2E 2T
    D 2 days 1E 1T
    E 3 days 1E 2T
    F 4 days 2E 2T
    G 5 days 3E 0T
    H 1 day 1E 0T
    I 3 days 3E 2T
    J 5 days 1E 2T
    K 3 days 2E 2T
    L 2 days 1E 1T

    Precedence Relationships
    From the precedence diagram, the relationships between activities are:

    A → B, C
    B → D, E
    C → E, F
    D, E → G
    F→G
    G → H, I, J
    H→K
    I, J, K → L

    Critical Path Calculation


    earliest start (ES), earliest finish (EF), latest start (LS), and latest finish (LF)
    Critical
    Activity ES EF LS LF Float
    (Y/N)
    A 0 1 0 1 0 Yes
    B 1 4 2 5 1 No
    C 1 3 1 3 0 Yes
    D 4 6 6 8 2 No
    E 4 7 6 9 2 No
    F 3 7 3 7 0 Yes
    G 7 12 7 12 0 Yes
    H 12 13 12 13 0 Yes
    I 12 15 12 15 0 Yes
    J 12 17 12 17 0 Yes
    K 13 16 13 16 0 Yes
    L 17 19 17 19 0 Yes
    Critical Path:
    The critical path is the longest path with no slack or float. This path is:
    A→C→F→G→I→L

    The total duration of the project is 19 days.

    Resource Allocation Without Constraints


    Before applying resource constraints, we assume that all activities can start at their earliest possible time.

    Day-by-Day Resource Usage (Before Constraints):

    1. Day 1: Activity A

    Engineers: 1, Trucks: 1

    2. Days 2-3: Activities B, C

    Engineers: 4 (2E for B, 2E for C), Trucks: 3 (1T for B, 2T for C)

    3. Days 4-6: Activities B, D, E

    Engineers: 4 (2E for B, 1E for D, 1E for E), Trucks: 4 (1T for B, 1T for D, 2T for E)

    4. Days 7-12: Activities F, G

    Engineers: 5 (3E for G, 2E for F), Trucks: 2 (2T for F, G requires no trucks)

    5. Days 12-13: Activities H, I, J

    Engineers: 5 (1E for H, 3E for I, 1E for J), Trucks: 4 (2T for I, 2T for J)

    6. Days 13-16: Activities I, J, K

    Engineers: 5 (2E for K, 1E for J, 3E for I), Trucks: 4 (2T for K, 2T for J)

    7. Days 17-19: Activity L

    Engineers: 1, Trucks: 1
    Resource Allocation with Constraints
    Now, we apply the resource limits: 5 Engineers and 4 Trucks

    Day-by-Day Resource Usage (After Constraints):

    1. Day 1: Activity A

    Engineers: 1, Trucks: 1

    2. Days 2-3: Activities B, C

    Engineers: 4, Trucks: 3

    3. Days 4-6: Activities B, D, E

    Engineers: 4, Trucks: 4

    4. Days 7-12: Activities F, G

    Engineers: 5, Trucks: 2

    5. Days 12-13: Activities H, I, J

    Engineers: 5, Trucks: 4

    6. Days 13-16: Activities I, J, K

    Engineers: 5, Trucks: 4

    7. Days 17-19: Activity L

    Engineers: 1, Trucks: 1
    Graphing Resource Usage
    Graph (Before Constraints):

    Graph (After Constraints):


    2)

    Extract Information from the Diagram


    Duration
    Activity Engineers (E)
    (Days)
    A 1 1E
    B 2 4E
    C 4 3E
    D 1 3E
    E 1 4E
    F 3 5E
    G 2 1E
    H 2 6E
    I 4 3E
    J 3 3E
    K 2 4E
    L 2 1E
    M 1 2E

    Total Engineer Usage Before Leveling

    Total Engineers (Before


    Day Active Activities
    Leveling)

    1 A, B, D, E 1E + 4E + 3E + 4E = 12E

    2 B, C, E, F 4E + 3E + 4E + 5E = 16E

    3E + 5E + 1E + 6E + 3E =
    3 C, F, G, H, I
    18E

    3E + 5E + 1E + 6E + 3E =
    4 C, F, G, H, I
    18E

    5 I, J, K 3E + 3E + 4E = 10E

    6 J, K, L, M 3E + 4E + 1E + 2E = 10E

    7 L 1E
    Apply Resource Leveling

    Active Activities (After Total Engineers (After


    Day
    Leveling) Leveling)

    1 A, B, D, E 10E

    2 B, C, E, F 14E

    3 C, F, G, H, I 14E

    4 C, F, G, H, I 14E
    5 I, J, K 12E
    6 J, K, L, M 8E
    7 L, M 4E

    Minimum Moment Algorithm


    Moment=∑(Engineers in each period)2

    Moment Before Leveling:

    12^2 + 16^2 + 18^2 + 18^2 + 10^2 + 10^2 + 1^2 =1249

    Moment After Leveling:

    10^2 + 14^2 + 14^2 + 14^2 + 12^2 + 8^2 + 4^2 =912


    Resources (Engineers) Used Per Day
    Day Before Leveling After Leveling

    Day 1 12 engineers 10 engineers

    Day 2 16 engineers 14 engineers

    Day 3 18 engineers 14 engineers

    Day 4 18 engineers 14 engineers

    Day 5 10 engineers 12 engineers

    Day 6 10 engineers 8 engineers

    Day 7 1 engineer 4 engineers


    Graph

    You might also like