Scribd Logo
Upload

Welcome to Scribd!

  • 0 views

    Tutorial Chp15 Answers

    Uploaded by

    Tian Xiang

    Copyright:

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

    Tutorial Chp15 Answers

    Uploaded by

    Tian Xiang
    0 views4 pages

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

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

    Tutorial Chp15 Answers

    Uploaded by

    Tian Xiang

    Copyright:

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

    15.

    4 (a)
    Original data
    Job/ A B C D
    Machine
    1 7 8 8 10
    2 10 9 7 6
    3 11 5 9 6
    4 9 11 5 8
    First, we create a minimizing table by subtracting every number from 11
    Job/ A B C D
    Machine
    1 4 2 3 1
    2 1 2 4 5
    3 0 6 2 5
    4 2 0 6 3
    then we do row subtraction:
    Job/ A B C D
    Machine
    1 3 1 2 0
    2 0 1 3 4
    3 0 6 2 5
    4 2 0 6 3

    then we do column subtraction:


    Job/ A B C D
    Machine
    1 3 1 0 0
    2 0 1 1 4
    3 0 6 0 5
    4 2 0 4 3
    Because it takes four lines to cover all zeros, an optimal assignment can be made at zero squares.
    Assignment:
    Job to Machine
    1 D
    2 A
    3 C
    4 B
    (b) Total production: 40 [= 10 + 10 + 9 + 11]

    15.6 Convert the minutes into $:

    Human
    Marketin Financ Operatio
    Resources
    g e ns
    Chris $80 $120 $125 $140
    Steve $20 $115 $145 $160
    Juana $40 $100 $85 $45
    Rebecc $25
    $65 $35 $75
    a

    The minimum-cost solution =


    Chris Finance $120
    Steve Marketing $20
    Juana Human Resources $45
    Rebecca Operations $25
    $210
    15.15
    Job Due Date Duration
    (Days)
    A 313 8
    B 312 16
    C 325 40
    D 314 5
    E 314 3
    FCFS
    Job Due Date Duration Flow Star End Latenes
    (days) t s
    A 313 8 8 275 282 0
    B 312 16 24 283 298 0
    C 325 40 64 299 338 13
    D 314 5 69 339 343 29
    E 314 3 72 344 346 32
    Totals: 72 237 74

    EDD
    Job Due Date Duration Flow Star End Latenes
    (days) t s
    B 312 16 16 275 290 0
    A 313 8 24 291 298 0
    D 314 5 29 299 303 0
    E 314 3 32 304 306 0
    C 325 40 72 307 346 21
    Totals: 72 173 21

    SPT
    Job Due Date Duration Flow Star End Latenes
    (days) t s
    E 314 3 3 275 277 0
    D 314 5 8 278 282 0
    A 313 8 16 283 290 0
    B 312 16 32 291 306 0
    C 325 40 72 307 346 22
    Totals: 72 131 22

    LPT
    Job Due Date Duration Flow Star End Latenes
    (days) t s
    C 325 40 40 275 314 0
    B 312 16 56 315 330 18
    A 313 8 64 331 338 25
    D 314 5 69 339 343 29
    E 314 3 72 344 346 32
    Totals: 72 301 104

    (a) FCFS (first come, first served):


    Because all jobs arrived on day 275, and presumably in the order given, the FCFS sequence is:
    A, B, C, D, E
    (b) EDD (earliest due date):
    Job Sequence Due Date
    B 312
    A 313
    D 314
    E 314
    C 325

    (c) SPT (shortest processing time):

    Job Sequence Processing Time


    E 3
    D 5
    A 8
    B 16
    C 40

    (d) LPT (longest processing time):

    Job Sequence Processing Time


    C 40
    B 16
    A 8
    D 5
    E 3

    Scheduling Average Average Average


    Number
    Rule Tardines Flow Time of Jobs in
    s System
    FCFS 14.8 47.4 3.3
    EDD 4.2* 34.6 2.4
    SPT 4.2* 26.2* 1.8*
    LPT 20.8 60.2 4.2
    * = Best

    15.16

    15.13 (a)
    Dispatchin Average Average
    g Job Sequence Flow Time Utilization Number Late
    Rule of Jobs
    EDD CX–BR–SY–DE–RG 385 37.6% 2.66 10
    SPT BR–CX–SY–DE–RG 375 38.6% 2.59 12
    LPT RG–DE–SY–CX–BR 495 29.3% 3.41 44
    FCFS CX–BR–DE–SY–RG 390 37.2% 2.69 12

    Starting day number: 241 (i.e., work can be done on day 241)
    Method: SPT—Shortest processing time
    Completion
    (b) The best flowtime is SPT; (c) best utilization is SPT;
    (d) best lateness is EDD.
    (e)
    Either of these choices.
    LPT scores poorly on all three criteria.

    You might also like