Scribd Logo
Upload

Welcome to Scribd!

  • 5 views

    Todays Lecture: Assignment Problem

    Uploaded by

    Venumadhav 18-222
    Faculty member Rakesh gave a lecture on the assignment problem. He showed how to use row minimization, column minimization, row scanning, and column scanning techniques to find the optimal assignment that minimizes the total time. The optimal assignment was A to II for 5 hours, B to IV for 3 hours, C to III for 3 hours, and D to I for 5 hours, for a total minimum time of 16 hours.

    Copyright:

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

    You might also like

    Todays Lecture: Assignment Problem

    Uploaded by

    Venumadhav 18-222
    5 views7 pages
    Faculty member Rakesh gave a lecture on the assignment problem. He showed how to use row minimization, column minimization, row scanning, and column scanning techniques to find the optimal assignment that minimizes the total time. The optimal assignment was A to II for 5 hours, B to IV for 3 hours, C to III for 3 hours, and D to I for 5 hours, for a total minimum time of 16 hours.

    Original Description:

    Original Title

    Download

    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
    Faculty member Rakesh gave a lecture on the assignment problem. He showed how to use row minimization, column minimization, row scanning, and column scanning techniques to find the optimal assignment that minimizes the total time. The optimal assignment was A to II for 5 hours, B to IV for 3 hours, C to III for 3 hours, and D to I for 5 hours, for a total minimum time of 16 hours.

    Copyright:

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

    Todays Lecture: Assignment Problem

    Uploaded by

    Venumadhav 18-222
    Faculty member Rakesh gave a lecture on the assignment problem. He showed how to use row minimization, column minimization, row scanning, and column scanning techniques to find the optimal assignment that minimizes the total time. The optimal assignment was A to II for 5 hours, B to IV for 3 hours, C to III for 3 hours, and D to I for 5 hours, for a total minimum time of 16 hours.

    Copyright:

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

    Todays Lecture:

    Assignment Problem

    Faculty: Ch.Rakesh
    Date: 26-11-2020
    Time: 12:00-1:00 PM
    I II III IV

    A 10 5 13 15

    B 3 9 18 3

    C 10 7 3 2

    D 5 11 9 7
    ROW MINIMIZATION

    I II III IV

    A 5 0 8 10

    B 0 6 15 0

    C 8 5 1 0

    D 0 6 4 2
    COLUMN MINIMIZATION

    I II III IV

    A 5 0 7 10

    B 0 6 14 0

    C 8 5 0 0

    D 0 6 3 2
    ROW SCANNING AND COLUMN SCANNING

    I II III IV

    A 5 0 7 10

    B 0 6 14 0

    C 8 5 0 0

    D 0 6 3 2
    I II III IV

    A 10 5 13 15

    B 3 9 18 3

    C 10 7 3 2

    D 5 11 9 7
    OPTIMAL ASSIGNMENT AND TOTAL MINIMUM
    TIME
    • Optimal Assignment:
    A - II = 5
    B - IV = 3
    C - III = 3
    D-I=5
    Total time taken is: 5+3+3+5 = 16 hours

    You might also like