Scribd
Upload
39 views

Assignment Problem

This document discusses the Hungarian method for solving assignment problems. It begins with an introduction to assignment problems, which aim to allocate resources to activities in an optimal one-to-one manner. It then covers the Hungarian algorithm, which involves creating a cost matrix and using horizontal and vertical lines to find a minimum cost assignment. Special cases like maximization, multiple optimal solutions, and unbalanced assignment problems are also addressed. Worked examples demonstrate applying the Hungarian method step-by-step. The document concludes with review questions.

Uploaded by

Samia Rahman
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
39 views

Assignment Problem

This document discusses the Hungarian method for solving assignment problems. It begins with an introduction to assignment problems, which aim to allocate resources to activities in an optimal one-to-one manner. It then covers the Hungarian algorithm, which involves creating a cost matrix and using horizontal and vertical lines to find a minimum cost assignment. Special cases like maximization, multiple optimal solutions, and unbalanced assignment problems are also addressed. Worked examples demonstrate applying the Hungarian method step-by-step. The document concludes with review questions.

Uploaded by

Samia Rahman
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 16

ASSIGNMENT PROBLEMS

Outlines

 Introduction
 Assignment Models.
 Hungarian Method of Assignment Problems.
 Special Cases in Assignment Problems.
 Exercises
Introduction
The Assignment problem
deals in allocating the various items
(resources) to various receivers
(activities) on a one to one basis in
such a way that the resultant
effectiveness is optimised.

Assignment Models
This is a special case of
transportation problem. In this
problem, supply in each now
represents the availability of a
resource such as man, vehicle,
produce, etc.
Hungarian Method of Assignment problem
Step I :- Create Zero elements in the cost matrix by subtract the smallest
element in each row column for the corresponding row and column.
Step II:- Drop the least number of horizontal and vertical lines so as to
cover all zeros if the no of there lines are ‘N’
i) If N = n (n=order of the square matrix) then an optimum assignment
has been obtained
ii) If N<n proceeds to step III
Step III :- determine the smallest cost cell from among the uncrossed
cells subtract. This cost from all the uncrossed cells and add the same
to all those cells laying in the intersection of horizontal and vertical
lines.
Step IV:- repeat steps II and III until N=n.
Step V:- examine the rows (column) successively until a row (column)
with are zero is found enclose the zero in a square (0) and cancel out
(0) any other zeros laying in the column (row) of the Matrix.
Continue in this way until all the rim requirements are satisfied i.e
Step VI:- repeat step 5 successively one of the following arises.
i) No unmarked zero is left
ii) If more then one unmarked zeros in one column or row.

In case i) the algorithm stops


ii)Encircle one of the unmarked zeros arbitrary and mark a cross in the cells
of remaining zeroes in it’s row and column. Repeat the process until no
unmarked zero is left in the cost matrix.
Step VII) we now have exactly one encircled zero in each row and each column
of the cost matrix. The assignment schedule corresponding to there zeros is
the optimum (maximal) assignment.
Example
Three jobs A B C are to be assigned to three machines x Y Z. The
processing costs are as given in the matrix shown below. Find the
allocation which will minimize the overall processing cost.
Solution
Step 1: create zero in each row or column by subtracting by
selecting least number in each row and column
Solution
Step 2: Draw Horizontal and vertical lines

Here, no of horizontal lines is one and vertical line is one


The order of matrix is 3 x 3, therefore, N≠ n
Solution
Step 3: Now, in the uncrossed cell the least cost is selected and
subtracted for the remaining uncrossed cell by the least value and for the
intersection of the horizontal line and vertical line the least value should be
added and the resulting matrix.

The assignment are:


A  X = 19
B Y = 17
C Z = 13
Total Cost = 19+17+13 = 49
Special Cases in Assignment Problems
1. Maximization Cases.
2. Multiple Optimal Solution
3. Unbalanced Assignment Problem

1. Maximization Cases :-
The Hungarian method explained earlier can be used for
maximization case.
The problem of maximization can be converted into a minimization by
simply multiplying each element of given matrix by -1.
Select the most negative in the matrix. With this element subtract all the
elements in the matrix. The resulting is minimization table
Using the updated table we can apply the Hungarian method to find the
assignment for the given problem and the value should be taken from
the original table since, it is a maximization problem
Multiple Optimal Solution:
Sometimes, it is possible to have two or more ways to cross out
all zero elements in the final reduced matrix for a given problem. This
implies that there are more than required number of independent zero
elements. In such cases, there will be multiple optimal solutions with the
same total cost of assignment. In such type of situation, management
may exercise their judgment or preference and select that set of optimal
assignment which is more suited for their requirement.

….
Summary
Assignment problem is a special case of
transportation problem. It deals with allocating the various
items to various activities on a one to one basis in such a
way that the resultant effectiveness is optimised. In this
unit, we have solved assignment problem using Hungarian
Method. We have also disscussed the special cases in
assignment problems.
Unbalanced Assignment problem
If the cost matrix of an assignment problem is not a square
matrix (number of sources is not equal to the number of
destinations), The assignment problem is called an
unbalanced assignment problem.
In such cases, fictitious rows and columns are added in the
matrix so as to form a square matrix.
Then the usual assignment algorithm can be applied to this
resulting balanced problem.
Unbalanced Assignment problem
If the cost matrix of an assignment problem is not a square
matrix (number of sources is not equal to the number of
destinations), The assignment problem is called an
unbalanced assignment problem.
In such cases, fictitious rows and columns are added in the
matrix so as to form a square matrix.
Then the usual assignment algorithm can be applied to this
resulting balanced problem.
Review Questions and Exercises
Review Questions and Exercises.
1. What is an assignment problem?
2. Solve the assignment problem.

You might also like