Scribd Logo
Upload

Welcome to Scribd!

  • 11 views

    Assignment Problem - Hungarian Method

    Uploaded by

    jecoxol388
    The document discusses the meaning and definition of an assignment problem and describes the Hungarian method for solving assignment problems. It provides an example of using the Hungarian method to solve an assignment problem involving assigning 5 jobs to 5 machines to minimize the total cost.

    Copyright:

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

    Assignment Problem - Hungarian Method

    Uploaded by

    jecoxol388
    11 views5 pages
    The document discusses the meaning and definition of an assignment problem and describes the Hungarian method for solving assignment problems. It provides an example of using the Hungarian method to solve an assignment problem involving assigning 5 jobs to 5 machines to minimize the total cost.

    Original Title

    Assignment Problem_Hungarian Method (1)

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document discusses the meaning and definition of an assignment problem and describes the Hungarian method for solving assignment problems. It provides an example of using the Hungarian method to solve an assignment problem involving assigning 5 jobs to 5 machines to minimize the total cost.

    Copyright:

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

    Assignment Problem - Hungarian Method

    Uploaded by

    jecoxol388
    The document discusses the meaning and definition of an assignment problem and describes the Hungarian method for solving assignment problems. It provides an example of using the Hungarian method to solve an assignment problem involving assigning 5 jobs to 5 machines to minimize the total cost.

    Copyright:

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

    Meaning of Assignment Problem:

    An assignment problem is a particular case of transportation problem


    where the objective is to assign a number of resources to an equal
    number of activities so as to minimise total cost or maximize total
    profit of allocation.

    The problem of assignment arises because available resources such as


    men, machines etc. have varying degrees of efficiency for performing
    different activities, therefore, cost, profit or loss of performing the
    different activities is different.

    Definition of Assignment Problem:


    Suppose there are n jobs to be performed and n persons are available
    for doing these jobs. Assume that each person can do each job at a
    term, though with varying degree of efficiency, let c ij be the cost if the
    i-th person is assigned to the j-th job. The problem is to find an
    assignment (which job should be assigned to which person one on-one
    basis) So that the total cost of performing all jobs is minimum, problem
    of this kind are known as assignment problem.
    The assignment problem can be stated in the form of n x n cost matrix
    C real members as given in the following table:
    Hungarian Method for Solving Assignment Problem:

    Step 1: Develop the Cost Table from the given Problem:

    Step 2: Find the Opportunity Cost Table:


    (a) Locate the smallest element in each row of the given cost table and
    then subtract that from each element of that row, and

    (b) In the reduced matrix obtained from 2 (a) locate the smallest
    element in each column and then subtract that from each element.
    Each row and column now have at least one zero value.

    Step 3: Draw minimum no. of lines covering all zeros. If no. of lines
    drawn < n (order of the matrix), then proceed to next step.

    Step 4: Obtaining reduced matrix.


    a) Determine the smallest uncovered element (x)
    b) Write uncovered values = uncovered values – x
    c) Intersection values = intersection value + x
    d) Line values remain same

    How to find minimum number of lines?

    Choose any row or column with a single zero. If it is a row, draw a line
    through the column the zero is in; if it is a column, draw a line through
    the row the zero is in. Continue in this fashion until you cover all the
    zeros.
    Step 5: Repeat step 3 with the reduced matrix obtained in step 4. If no.
    of lines drawn = n (order of the matrix), then stop and assign jobs by
    marking zeros (only one per row/ column), else proceed to step 4 till
    you get the equality.

    Tips to assign jobs:

    a) Allocate (mark zero) to those rows/ columns where there is only


    one zero.
    b) Then, judicially allocate the remaining zeros such that total
    allocation is equal to n and there must be only one allocation per
    row/ column.
    Problem: Assign jobs to machines such that total cost is minimum. The
    cost matrix is given below:

    Machines
    A B C D E
    1 1
    1 13 8 16 8 9
    1
    2 9 15 24 9 2
    Jobs

    3 12 9 4 4 4
    1
    4 6 12 10 8 3
    1 2
    5 15 17 18 2 0

    A B C D E
    1 1
    1 5 0 8 0 1
    1
    2 0 6 5 0 3

    3 8 5 0 0 0

    4 0 6 4 2 7

    5 3 5 6 0 8
    No. of min lines = 4 < 5

    x=3

    A B C D E
    1
    1 5 0 5 0 8
    1
    2 0 6 2 0 0
    1
    3 1 8 0 3 0
    4 0 6 1 2 4
    5 3 5 3 0 5
    No. of lines = 5

    Optimal Allocation:

    A B C D E
    1 5 0 5 10 8
    2 0 6 12 0 0
    3 11 8 0 3 0
    4 0 6 1 2 4
    5 3 5 3 0 5

    Jobs Machines

    1 B

    2 E

    3 C

    4 A

    5 D
    Min cot of job assignment = 8+12+4+6+12 = 42

    You might also like