Scribd
Upload
48 views16 pages

Research Engliner Project

Uploaded by

saik17769
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
48 views16 pages

Research Engliner Project

Uploaded by

saik17769
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/ 16

Student Name : S MANISH RAO

Email Id :[email protected]
Roll No : 228123672109
College Code : 2281
ASBM MBA College - Hyderabad
Assignment Problem
 An Assignment problem is a special type of
transportation problem in which the objectives is to
assign a number of resources to an equal number of
activities.
 Various Methods of solving assignment problems
1.Enumeration Method
2.Simplex Method
3.Transportation Method
4.Hungarian Method
2. The Assignment Problem (AP) —
a special case of TP with m=n and si=dj for all
i, and j.

The Hungarian Algorithm


=> solving the assignment problem of a least
cost assignment of m workers to m jobs
Assumptions:
1. There is a cost assignment matrix for the m
“people” to be assigned to m “tasks.” (If necessary
dummy rows or columns consisting of all 0’s are
added so that the numbers of people and tasks are
the same.)
2. All costs are nonnegative.
3. The problem is a minimization problem.
The Hungarian Algorithm
Initialization
1. For each row, subtract the minimum number from
all numbers in that row.
2. In the resulting matrix, subtract the minimum
number in each column from all numbers in the
column.
Iterative Steps
1. Make as many 0 cost assignments as possible. If
all workers are assigned, STOP; this is the minimum
cost assignment. Otherwise draw the minimum
number of horizontal and vertical lines necessary to
cover all 0’s in the matrix. (A method for making the
maximum number of 0 cost assignments and
drawing the minimum number of lines to cover all
0’s follows.)
2. Find the smallest value not covered by the lines;
this number is the reduction value.
3. Subtract the reduction value from all numbers not
covered by any lines. Add the reduction value to any
number covered by both a horizontal and vertical
line.
For small problems, one can usually determine the maximum
number of zero cost assignments by observation. For larger
problems, the following procedure can be used:
Determining the Maximum Number of Zero-Cost Assignments
1. For each row, if only one 0 remains in the row, make that
assignment and eliminate the row and column from consideration in
the steps below.
2. For each column, if only one 0 remains, make that assignment
and eliminate that row and column from consideration.
3. Repeat steps 1 and 2 until no more assignments can be made. (If
0’s remain, this means that there are at least two 0’s in each
remaining row and column. Make an arbitrary assignment to one of
these 0’s and repeat steps 1 and 2.)
Again, for small problems, the minimum number of lines required
to cover all the 0’s can usually be determined by observation. The
following procedure, based on network flow arguments, can be
used for larger problems:
Drawing the Minimum Number of Lines to Cover All 0’s
1. Mark all rows with no assignments (with a “‧”).
2. For each row just marked, mark each column that has a 0 in
that row (with a “‧”).
3. For each column just marked, mark each row that has an
assignment in that column (with a “‧”).
4. Repeat steps 2 and 3 until no more marks can be made.
5. Draw lines through unmarked rows and marked columns.
Example:
Minimum uncovered
number
Minimum uncovered
number
CONVERSION OF A MAXIMIZATION
PROBLEM TO A MINIMIZATION
PROBLEM

The Hungarian algorithm works only if the matrix is a


cost matrix. A maximization assignment problem can be
converted to a minimization problem by creating a lost
opportunity matrix. The problem then is to minimize the
total lost opportunity.
Profit Matrix:
J1 J2 J3 J4
W1 67 58 90 55
W2 58 88 89 56
W3 74 99 80 22
(D) 0 0 0 0
The lost opportunity matrix given below is derived by
subtracting each number in the J1 column from 74, each
number in the J2 column from 99, each number in the J3
column from 90, and each number in the J4 from 56.

J1 J2 J3 J4
W1 7 41 0 1
W2 16 11 1 0
W3 0 0 10 34
(D) 74 99 90 56

The Hungarian algorithm can now be applied to this lost


opportunity matrix to determine the maximum profit set of
assignments.

You might also like