Scribd
Upload
1K views

Unbalanced Assignment Problem PDF

An unbalanced assignment problem occurs when the number of sources and destinations are unequal. Dummy rows or columns with zero costs are added to create a square cost matrix. The Hungarian method can then be applied to solve the problem. Two examples are provided: 1) Assigning five machines to four jobs, where adding a dummy row results in the optimal assignment. 2) Assigning four machines to five areas, where a dummy row is added and high costs are used to represent infeasible assignments, leading to the optimal solution.

Uploaded by

asiehem
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
1K views

Unbalanced Assignment Problem PDF

An unbalanced assignment problem occurs when the number of sources and destinations are unequal. Dummy rows or columns with zero costs are added to create a square cost matrix. The Hungarian method can then be applied to solve the problem. Two examples are provided: 1) Assigning five machines to four jobs, where adding a dummy row results in the optimal assignment. 2) Assigning four machines to five areas, where a dummy row is added and high costs are used to represent infeasible assignments, leading to the optimal solution.

Uploaded by

asiehem
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/ 5

UNBALANCED ASSIGNMENT PROBLEM

Whenever the cost matrix of an assignment problem is not a square matrix, that is, 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.

Example 1: A company has five machines that are used for four jobs. Each job can be assigned to one and only
one machine. The cost of each job on each machine is given in the following Table.

Unbalanced Maximization Assignment problem example

Assignment Problem

Solution: Convert the 4 × 5 matrix into a square matrix by adding a dummy row D5.

Dummy Row D5 Added

Row-wise Reduction of the Matrix


Column-wise reduction is not necessary since all columns contain a single zero. Now, draw minimum number
of lines to cover all the zeros, as shown in Table.

All Zeros in the Matrix Covered

Number of lines drawn ≠ Order of matrix. Hence not optimal.

Select the least uncovered element, i.e., 1, subtract it from other uncovered elements, add to the elements at
intersection of lines and leave the elements that are covered with single line unchanged as shown in Table.

Subtracted or Added to Elements

Number of lines drawn ≠ Order of matrix. Hence not optimal.

Again Added or Subtracted 1 from Elements


Number of lines drawn = Order of matrix. Hence optimality is reached. Now assign the jobs to machines, as
shown in Table.

Assigning Jobs to Machines

Example 2: In a plant layout, four different machines M1, M2, M3 and M4 are to be erected in a machine shop.
There are five vacant areas A, B, C, D and E. Because of limited space, Machine M2 cannot be erected at area
C and Machine M4 cannot be erected at area A. The cost of erection of machines is given in the Table.

Assignment Problem

Find the optimal assignment plan.


Solution: As the given matrix is not balanced, add a dummy row D5 with zero cost values. Assign a high cost
H for (M2, C) and (M4, A). While selecting the lowest cost element neglect the high cost assigned H, as shown
in Table below.

Dummy Row D5 Added

Row-wise reduction of the matrix is shown in Table.

Matrix Reduced Row-wise

Note: Column-wise reduction is not necessary, as each column has at least one single zero. Now, draw
minimum number of lines to cover all the zeros, see Table.

Lines Drawn to Cover all Zeros


Number of lines drawn ≠ Order of matrix. Hence not Optimal. Select the smallest uncovered element, in this
case 1. Subtract 1 from all other uncovered element and add 1 with the elements at the intersection. The element
covered by single line remains unchanged. These changes are shown in Table. Now try to draw minimum
number of lines to cover all the zeros.

Added or Subtracted 1 from Elements

Now number of lines drawn = Order of matrix, hence optimality is reached. Optimal assignment of machines to
areas are shown in Table.

Optimal Assignment

Hence, the optimal solution is:

You might also like