Scribd Logo
Upload

Welcome to Scribd!

  • File Important 1

    Uploaded by

    Venumadhav 18-222
    2 views10 pages
    The document provides the steps to solve an assignment problem involving 4 jobs (J1-J4) and 4 workers (W1-W4) with the time required for each worker to complete each job. It shows the processes of row minimization, column minimization, row scanning, column scanning, and subtracting the minimum remaining value to find the optimal assignment. The optimal assignment was found to be W1 to J3, W2 to J4, W3 to J2, and W4 to J1, with a total minimum time of 61 hours to complete all jobs.

    Original Description:

    cfhgfhgj

    Original Title

    file important 1

    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 provides the steps to solve an assignment problem involving 4 jobs (J1-J4) and 4 workers (W1-W4) with the time required for each worker to complete each job. It shows the processes of row minimization, column minimization, row scanning, column scanning, and subtracting the minimum remaining value to find the optimal assignment. The optimal assignment was found to be W1 to J3, W2 to J4, W3 to J2, and W4 to J1, with a total minimum time of 61 hours to complete all jobs.

    Copyright:

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

    File Important 1

    Uploaded by

    Venumadhav 18-222
    The document provides the steps to solve an assignment problem involving 4 jobs (J1-J4) and 4 workers (W1-W4) with the time required for each worker to complete each job. It shows the processes of row minimization, column minimization, row scanning, column scanning, and subtracting the minimum remaining value to find the optimal assignment. The optimal assignment was found to be W1 to J3, W2 to J4, W3 to J2, and W4 to J1, with a total minimum time of 61 hours to complete all jobs.

    Copyright:

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

    Todays Lecture:

    ASSIGNMENT PROBLEM

    Faculty: Ch.Rakesh
    Date: 27-11-2020
    Time: 12:00-1:00 PM
    v Solve the following Assignment problem:

    J1 J2 J3 J4

    W1 10 15 24 30

    W2 16 20 28 10

    W3 12 18 30 16

    W4 9 24 32 18
    Row Minimization:

    J1 J2 J3 J4

    W1 0 5 14 20

    W2 6 10 18 0

    W3 0 6 18 4

    W4 0 15 23 9
    Column Minimization:

    J1 J2 J3 J4

    W1 0 0 0 20

    W2 6 5 4 0

    W3 0 1 4 4

    W4 0 10 9 9
    Row Scanning:

    J1 J2 J3 J4

    W1 0 0 0 20

    W2 6 5 4 0

    W3 0 1 4 4

    W4 0 10 9 9
    Column Scanning:

    J1 J2 J3 J4

    W1 0 0 0 20

    W2 6 5 4 0

    W3 0 1 4 4

    W4 0 10 9 9
    • As Number of assignments are not equal to no.of
    rows/columns optimal solution is not reached.

    • subtract the minimum value of the remaining


    elements(elements not covered with lines)(in this case
    “1”) from the remaining elements and add the same
    element at junction of lines.

    • Apply row scanning and column scanning again to the


    newly obtained matrix.
    New Matrix:

    J1 J2 J3 J4

    W1 1 0 0 21

    W2 6 4 3 0

    W3 0 0 3 4

    W4 0 9 8 9
    Row Scanning and Column Scanning:

    J1 J2 J3 J4

    W1 1 0 0 21

    W2 6 4 3 0

    W3 0 0 3 4

    W4 0 9 8 9
    OPTIMAL ASSIGNMENT:

    • W1 -- J3 = 24
    • W2 -- J4 = 10
    • W3 -- J2 = 18
    • W4 -- J1 = 9

    Total Minimum Time to complete all the 4 jobs is:


    24 + 10 + 18 + 9 = 61 hours

    You might also like