An Assignment Problem Is A Particular Case of Transportation Problem
An Assignment Problem Is A Particular Case of Transportation Problem
Assign the programmers to the programmes in such a way that the total computer time is
minimum.
Solution:
The Hungarian method is used to obtain an optimal solution.
Step (1) & (2):
The minimum time element in row 1, 2 and 3 is 80, 80 and 110. resp. Subtract these elements
from all elements in this respective row.
The reduced time matrix is shown in following table (1) Table 1:
In reduced Table (1) the minimum time element in columns A, B, and C is 0,10 and 0 resp,
subtract these elements from all elements in this resp. column to get the reduced time matrix
as shown in Table 2.
Step 3 (a):
Examine all the rows starting from first one- until a row containing only single zero element
is located, Here, rows 1 and 3 have only one zero in the cells (1, C) and (3,A) resp, we
assigned these zeros. All zeros in the assigned column are crossed off as shown in table 3.
(b) We now examine each column starting from A in table 3, There is one zero in column B
in the cell (2, B). Assign this cell as shown in table 4.
(c) Since the no of Assignments (= 3) equal the no of rows (= 3), the optimal solution is
obtained.
The pattern of assignment among programmers and programmes with their respective line (in
minutes) is given below.
Example 2:
A department has five employees with five jobs to be performed. The time in hours) each
men will take to perform each job is given in the effectiveness matrix.
How should the jobs be allocated one per employee so as to minimize the total man- hours?
Solution:
Step (1) & (2) Applying step (2) of the algorithm, we get the reduced opportunity time matrix
as shown in Table (1).
In reduced table (1) the minimum time element in column I,II,III, IV, and V is 0,0,0,0,0 resp,
subtracting these from the elements of the resp. column we get same reduced matrix.
Step 3 (a):
We examine all the row starting from A one-by-one until a row containing only single zero
element is located. Here rows A, B and E have only one zero element in the cells (A, II), (B,
I) and (E, IV), Assignment is made in these cells. All zeros in the assigned columns are now
crossed off as shown in table 2.
(b) We now examine each column starting from column. 1. There is one zero in column III,
cell (C, III) Assignment is made in this cell. Thus cell (C, V) is Crossed off. All zeros in the
table now are either assigned or crossed off as shown in Table 2.
The solution is not optimal because only four assignments are made.
Step 4:
Cover the zeros with minimum numbers of lines (= 4) as explained below.
(a) Mark (√) row D since it has no assignment then.
(b) Mark (√) columns I and IV since row D has zero element in these columns.
(c) Mark (√) rows B & E since column 1 and (IV) have an assignment in rows B and E resp.
(d) Since no other rows or columns can be marked draw straight lines through the unmarked
rows A & C and the marked columns I and IV as shown in Table 3.
Step 5:
Develop the new revised table by selecting the smallest element among all uncovered
elements by the lines in table 3 viz., 2. subtract K = 2 from uncovered elements including
itself and add it to elements 5,10,8 and 0 in cells (A, 1), (A,IV), (C, 1)< and (E,IV) resp.
which lie at the intersection of two lines. Another’s revised table so obtained is shown in
table 4.
Step 7:
Repeat step (3) to (5) to find a new solution. The new assignment is shown in Table 5.
Since the no. of assignment (= 5) equals the no of rows (or columns), the solution is optimal.
The pattern of assignments among jobs and employees with their respective time (in
hour) is given below:
Find an optimum assignment of jobs to the machines to minimize the total processing time
and also find for which machine no job is assigned. What is the total processing time to
complete all the jobs.
Solution:
Since the cost matrix is not a square matrix the problem is unbalanced. We add a dummy job
5 with corresponding entries zero. Modified matrix.
Step 1 & 2:
We subtract the smallest element from all the elements in the respective row and column.
Step 3 & 4:
Now we give the zero assignment in our usual manners & get the following matrix.
But the solution is not optimal because only four assignments are made
Step 5:
In this step we draw minimum no. of lines to cover all zeros.
The no of lines to cover all zeros = 4 < the order of matrix. We form the 2nd modified matrix
by subtracting the smallest uncovered element (i) from the remaining uncovered elements and
add to the element at the point of intersection of lines.
Step 6:
Again Repeat step (3) & (4) and find following matrix.