Scribd
Upload
14 views14 pages

3 Assignment Problem - For Students 1684053857546

Uploaded by

MADHUSUDAN KUMAR
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
14 views14 pages

3 Assignment Problem - For Students 1684053857546

Uploaded by

MADHUSUDAN KUMAR
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 14

The Assignment Problem

the Hungarian Method


The Assignment Problem
• Suppose we have n resources to which we
want to assign to n tasks on a one-to-one
basis. Suppose also that we know the cost of
assigning a given resource to a given task. We
wish to find an optimal assignment–one which
minimizes total cost.
The Hungarian Method
• The Hungarian method is an algorithm which
finds an optimal assignment for a given cost
matrix.
The Hungarian Method: The following algorithm applies the above theorem
to a given n × n cost matrix to find an optimal assignment.

• Step 1. Subtract the smallest entry in each row from all the entries of its row.
• Step 2. Subtract the smallest entry in each column from all the entries of its column.
• Step 3. Draw lines through appropriate rows and columns so that all the zero entries of the
cost matrix are covered and the minimum number of such lines is used.
• Step 4. Test for Optimality:
• (i) If the minimum number of covering lines is n, an optimal assignment of zeros is
possible and we are finished.
• (ii) If the minimum number of covering lines is less than n, an optimal assignment of zeros is
not yet possible. In that case, proceed to Step 5.
• Step 5. Determine the smallest entry not covered by any line. Subtract this entry from each
uncovered row, and then add it to each covered column. Return to Step 3
ASSIGNMENT ALGORITHM (The
Hungarian Method)
• In order to find the proper assignment it is essential for
us to know the Hungarian method. This method is
dependent upon two vital theorems, stated as below.
Theorem 1: If a constant is added (or subtracted) to
every element of any row (or column) of the cost
matrix [cij] in an assingment problem then an
assingment which minimises the total cost for the new
matrix will also minimize the total cost matrix.
ASSIGNMENT ALGORITHM (The Hungarian Method)
• Theorem 2

• then this solution is an optimal solution, i.e.,


minimizes z.
• (i) Total assigned zero’s = n
The assignment is optimal.

• (ii)Total assigned zero’s < n


UNBALANCED ASSIGNMENT
PROBLEM
• Whenever the cost matrix of an assignment problem is not a square
matrix.
• whenever the number of sources is not equal to the number of
destinations, the assignment problem is called an unbalanced
assignment problem.
• In such problems, dummy rows (or columns) are added in the
matrix so as to complete it to form a square matrix.
• The dummy rows or columns will contain all costs elements as
zeroes. The Hungarian method may be used to solve the problem.
• The addition of Dummy rows or columns does not effect the
solution method
UNBALANCED ASSIGNMENT
PROBLEM
UNBALANCED ASSIGNMENT
PROBLEM
The total cost of this assignment is
400 + 350 + 200 = 950.

You might also like