Assignment Problems

Key Points

An assignment problem is a particular case of transportation problem.

The assignment is to be made on a one-to-one basis (one job to one worker).

● The objective in assignment problem is to assign certain number of resources or

facilities to an equal number of tasks or activities.( examples-job to machines or
workers, products to factories, salesmen to territories, contracts to bidders, etc)
to minimize total cost /time or maximize profit/revenue/efficiency.

An assignment problem is a balanced when the number of rows is equal to number of

columns.

● An unbalanced assignment problem can be balanced by adding dummy rows or columns

as the case may be to make rows equal to columns.

In the dummy row or column all elements are zero.

● An assignment problem involving restrictions in allocations (worker cannot be

assigned to a machine as he may not possess the skill to operate the machine) is
known as prohibited assignment.

● In case of prohibited assignment problem, we assign cost/time of higher value say

M at the prohibited combination.

An assignment problem can have more than one solution giving the same answer.

Alternate (Multiple) optimum assignment solution exists, when there are multiple
zeros in columns and rows.

● Hungarian method is the most efficient method to solve assignment problems when
the objective is minimization.

In case the objective function is maximization of say profit, we first convert the
profit table into an opportunity loss table before we apply the Hungarian method.

● A travelling salesman problem is typical assignment problem with two additional

constraints:

Salesmen should not visit the city twice until he has visited all the cities.

No assignment should be made along the diagonal line.

● Assignment technique is of little use to a firm whose facilities are perfect

substitutes of each other. For example if there are three identical machines doing
the same job, any machine can be assigned for the job and hence one-to-one
allocation will be disturbed.

Hungarian Method
● Developed by Hungarian Mathematician D. Konig.

It works on the principle of reducing the given cost matrix to a matrix of

opportunity cost.

● It reduces the given cost/time or opportunity loss matrix to the extent of having
one zero in each row and column.

Steps involved in solving Assignment Problems by Hungarian Method

Step1-Express the given problem into an n x n cost matrix or table.

Step 2- Subtract the minimum element of each row of the matrix from all elements of
the respective row. This step is known as Row Minima.

Step 3- Subtract the minimum element of each column from all the elements in that
respective column. This step is known as Column Minima.

Step 4- Draw the least (minimum) number of horizontal and/or vertical lines to
cover all zeros in the matrix. If the number of lines drawn are equal to the number
of rows or columns, optimum solution has been reached. In such a case proceed to
step number 7 for assignment. However if the number of lines are not equal to rows
or columns, proceed to tep number 5 for modification.

Step 5- Select the smallest element not covered by the lines, subtract it from all
uncovered elements including itself, add it to the elements which are crossed by
two lines and reproduce other elements crossed by one line intact.

Step6-Repeat steps 4 and 5 until an optimal solution is reached.

Step 7- Proceed to job assignments as follows:

Examine the rows one by one starting with the first row until a row with an exactly
one zero is found. Mark the zero by enclosing it in a square indicating assignment
of the task to the

facility. After doing so, cross out all the zeros (if any) in that column as they
cannot be used to make other assignments.

Examine next the columns for any column having a single zero, starting from the
first column. Mark the zero as mentioned above, crossing out the remaining zeros
(if any) in that row.

Repeat steps (i) and (ii) alternatively until either of the following conditions
occur:

All the zeros have been marked or crossed, ensuring in the process that each row
has a zero marked. This means that optimum solution has been reached.

All the zeros cannot be marked /crossed .There are at least two zeros in each row
and column which cannot be marked by using the above mentioned step 7-(i) and (ii).
This means that more than one solution exists. In such a case we mark any one zero
in a row of our choice and cross out the remaining zeros in the row and the column
where the zero is marked. Carry out this exercise till we get one zero marked or
assigned in each row and there is no further assignment required.
Step 8- Summarize the result by having the final assignment table.

Illustrations

1. A company has five jobs to be done. The following table shows the cost of
assigning each job to each machine. Assign five jobs to the five machines so as to
minimize the total cost in INR in '000'.

Machine M₁ M₂ M3 M4 M5 1 5 2 3 6 7 2 11 4 12 14 9 3 10 6 14 4 8 Job 4 12 3 6 11 12
5 4 5 4 7 5

Solution:

Hungarian method is used to obtain optimal solution.

As the numbers of rows are equal to columns, we have a balanced assignment table
and move on to step number 2.

Step 2- Subtract the minimum element of each row of the matrix from all elements of
the respective row. This step is known as Row Minima.

Machine M₁ M₂ M3 M4 M5 1 1 0 0 2 2 2 7 2 9 10 4 3 6 4 11 0 3 Job 4 8 1 3 7 7 5 сл 0
3 1 3 0

Note-In the first row 4 is lowest element and we have subtracted this lowest
element from all the elements in that row. The same methodology is used for the
other rows.

Step 3- Subtract the minimum element of each column from all the elements in that
respective column. This step is known as Column Minima.

Machine M₁ M₂ M3 M4 M5 1 1 0 0 2 2 2 5 0 7 8 2 3 6 4 11 0 3 Job 4 7 0 2 6 6 5 0 3 1
3 0

Note- Column 1, 3 and 5 remain the same, as we have zero as the lowest element in
each of these columns. In column 2 and 4 we have 2 and 1 as the lowest elements
which we have subtracted from all elements in those respective columns.

Step 4- Draw the least (minimum) number of horizontal and/or vertical lines to
cover all zeros in the table.

Machine M₁ M₂ M3 M4 M5 1 2 5 0 7 8 2 3 Job 6 11 0 3 4 7 0 2 6 6 5

Note- We see from the above table that only four lines are sufficient to cross all
zeros. This is achieved by drawing minimum number of lines (horizontal as well as
vertical) with each line crossing out maximum zeros.

This is the most important step in the method and there is a chance that students
can make a mistake by drawing more lines to cross out all zeros than necessary. In
case you draw more lines than rows or columns it is an indication that you have a
mistake. Cancel the drawn lines and draw it up fresh. Use pencils to draw the
lines.
As numbers of lines are not equal to rows or columns optimum solution has not been
reached and we move to step number 5 for modification.

Step 5- Select the smallest element not covered by the lines, subtract it from all
uncovered elements including itself, add it to the elements which are crossed by
two lines and reproduce other elements crossed by one line intact.

Machine M₁ M₂ M3 M4 M5 1 1 2 0 4 2 2 3 0 5 8 0 3 4 4 9 0 1 Job 4 5 0 0 6 5 сл 0 5 1
5 0

Note 2 is the smallest non-crossed element we have subtracted from all non-crossed
elements including itself and added this smallest element 2 to the elements which
are crossed by two lines (for example element 3 in the second row was crossed by
two lines and hence 2 was added to the element 3 by which the new element in this
row is reading 5) .All other elements which are crossed by one line remain intact
(for example digit 2 in the last row remains unchanged as it is crossed by only one
line

We again draw minimum number of lines crossing out all zeros in the table as shown
below:

Machine M₁ M₂ M3 M4 M5 1 1 2 b 4 2 2 3 0 5 8 3 Job 4 5 0 U 6 5 51 5

Note- We require five lines as they are minimum number lines which are required to
cross out all zeros. As the number of lines is equal to rows or columns optimum
solution has been reached and we move to step number 7 for assignment.

Step 7- Proceed to job assignments as follows:

Examine the rows one by one starting with the first row until a row with an exactly
one zero is found. Mark the zero by enclosing it in a square indicating assignment
of the task to the facility. After doing so, cross out all the zeros (if any) in
that column as they cannot be used to make other assignments.

Examine next the columns for any column having a single zero, starting from the
first column. Mark the zero as mentioned above, crossing out the remaining zeros
(if any) in that row.

Repeat steps (i) and (ii) alternatively until all the zeros have been either
assigned or crossed.

Machine M₁ M₂ M3 M4 M5 1 1 2 0 4 2 2 3 X 5 8 0 Job 3 4 4 9 0 1 4 5 0 x 6 4 5 0 5 1
5 X

Note- (i) On examining, we find that since in row number one there is a single zero
for assignment which we mark it by having a square around it. After doing so we
check for any other zeros in that respective column for it to be crossed out. We
find that a zero is therein column number five which we cross out.

(ii) After doing the row exercise, we try to find a single zero in the column
starting from column number one. We find that in column no one itself there is a
single zero which is marked by having a square around it. After doing so let us
find whether there are other zeros in that respective row .We find that there is
one zero in row number three which we cross out.

(iii)We again proceed to look for a single zero in a row going row by row. We find
there is a single zero in row number two for assignment which we mark it by having
a square around it. Again we should not forget to cross out any other zeros in that
respective column. There are no zeros in that respective column which is row number
three.

Proceed to look for a single zero in a column by going column by column. We locate
it in the column number four for assignment. We mark it by having a square around
it and search for any other zeros in that respective row to be crossed out. There
is none to be crossed out in row number four.

We continue this row column exercise till all unique zeros is marked and others
crossed out. Step 8-Summary of the assignment is given in the table below:

Machine M₁ M₂ M3 M4 M5 Job 5 4 1 3 2 Total Cost in INR in "000" 4 3 3 4 9 23

Each of four workers A, B, C, D can do each of the four jobs I, II, III, IV. The
figures within the matrix given below show the time taken by each worker in minutes
to do each job. Assign the jobs to the four workers, only one to each so as to
minimize total time to do all the jobs.

Jobs | || ||| IV A 4 5 3 LO 5 B 3 4 1 6 Workers C 12 7 6 9 D 7 9 2 5

Solution:

Hungarian method is used to obtain optimal solution.

As the numbers of rows are equal to columns, we have a balanced assignment table
and move on to step number 2.

Step 2- Subtract the minimum element of each row of the matrix from all elements of
the respective row. This step is known as Row Minima.

Jobs I || ||| IV A 1 1 2 0 B 0 0 0 1 Workers C 9 3 5 4 D 4 5 1

Note-In the first row 3 is lowest element and we have subtracted this lowest
element from all the elements in that row. The same methodology is used for the
other rows.

Step 3- Subtract the minimum element of each column from all the elements in that
respective column. This step is known as Column Minima.

Jobs | || ||| IV A 1 1 2 0 B 0 0 0 1 Workers C 6 0 2 1 D 4 5 1 0

Step 4- Draw the least (minimum) number of horizontal and/or vertical lines to
cover all zeros in the table.

9
Jobs | || ||| IV A 1 1 2 0 B Workers C 6 0 2 1 D 4 5 1 0

Note- We see that only three lines are sufficient to cancel all zeros. We have
drawn minimum number of horizontal and vertical lines with each line striking off
maximum zeros. As the number of lines are less than the rows and columns, we move
on to step number 5 for modification.

Step 5- Select the smallest element not covered by the lines, subtract it from all
uncovered elements including itself, add it to the elements which are crossed by
two lines and reproduce other elements crossed by one line intact.

1 || ||| Jobs IV A 0 1 1 0 B 0 0 2 Workers C 5 0 1 1 D 3 5 0

Note 1 is the smallest non-crossed element we have subtracted from all non-crossed
elements including itself and added this smallest element 1 to the elements which
are crossed by two lines (for example element 1 in the last row was crossed by two
lines and hence 1 was added to the element 1 by which the new element in this row
instead is reading 2).All other elements which are crossed by one line remain
intact (for example digit 1 in the last row remains unchanged as it is crossed by
only one line).

Again we draw minimum number of horizontal or vertical lines crossing out all
zeros.

10

Jobs | || ||| IV A 0 1 1 o B 0 1 o 2 Workers C 10 D 3 5 o o

Note- We require four lines (minimum) to cross out all zeros. As the numbers of
lines drawn are equal to rows and columns optimum solution has been reached and we
proceed to Step 7 for assignment.

Jobs 1 || ||| IV A 0 1 1 B xa 1 0 2 Workers C 5 0 1 1 D 3 5 0

Note- (i) On examining, we find that since in row number two there is a single zero
for assignment which we mark it by having a square around it. After doing so we
check for any other zeros in that respective column for it to be crossed out. There
are no zeros to be crossed out.

(ii) After doing the row exercise, we try to find a single zero in the column
starting from column number one. We do not find a single zero in any of the columns

(iii)We again proceed to look for a single zero in a row going row by row. We find
there is a no single zero in any row.

This situation signifies that we have more than one solution to the problem .i.e.
Multiple Solutions

11

In such a case, we select the remaining zeros to be blocked of our choice,

remembering one think that while doing so,we ensure that there is only one zero in
each row for assignment. When we block the zero arbitrarily, any zeros in that
respective column as well as row get crossed out. For solution 1 this is done by
marking zero in the first row and first column by which zero in that column as well
as row gets crossed out. Now we see that zero in third row and second column is
free for assignment and zero in the fourth column in the same row gets crossed out.
We have only one zero left in row number four and column number four which we mark.
This completes the assignment and we get Solution-1

By doing this exercise, we get two optimum solutions whose assignment is different,
but the total minutes to do all the jobs by the workers remain the same.

Solution-1

Job || ||| IV Worker A C B D Total Time in minutes 4 7 1 5 17

Solution-2

Note-In the second solution we have marked zero in the first row second column and
crossed zeros in the first row and second column. We continue this exercise as
described above to get the solution which is given below:

Jobs 1 || IV A X 1 1 B 0 1 XQ 2 Workers 12 5 0 1 1 D 3 5 0 18

Job || ||| IV Worker B C D A Total Time in minutes 3 7 2 5 17

3. The government solicits five different proposals with the intent of giving one
job to each of the companies. The bid amounts in thousands of INR are given below
with X denoting no bid submitted as the company does not meet the technical
criteria for that job. Find the optimal assignment to companies such that the total
cost is minimum?

Solution:

This prohibited assignment problem and can be solved by Hungarian method as the
objective is to minimize total cost.

Company A B C D E 1 50 80 70 X Proposals (INR in "000") 85 2 85 85 80 90 80 3 100

95 85 95 90 4 75 X 75 70 80 5 80 90 80 85 90

As the numbers of rows are equal to columns, we have a balanced assignment table
and move on to step number 2.

Step 2- Subtract the minimum element of each row of the matrix from all elements of
the respective row. This step is known as Row Minima.

13

Proposals(INR in "000")

Company A B C D E 1 0 0 0 M 5 2 35 5 10 20 0 3 50 15 15 25 10 25 M 5 0 0 5 30 10 10
15 10

Note- M is so very high that even after subtracting small elements like 50 or 70, M
remains unchanged.

Step 3- Subtract the minimum element of each column from all the elements in that
respective column. This step is known as Column Minima.

Company A B C D E 1 0 0 0 M 5 2 35 5 10 Proposals(INR in "000") 20 0 3 40 5 5 15 0

4 25 M 5 0 5 20 0 0 5 0

Step 4- Draw the least (minimum) number of horizontal and/or vertical lines to
cover all zeros in the table.

14

Company A B C D E Proposals(INR in "000") 1 0 M 5 2 35 5 10 20 0 3 40 5 5 15 0 4 25

M 5 10 5 20 a 0

Note- As minimum number of horizontal and vertical lines are less than number of
rows or columns, we move on to Step 5 for modification.

Step 5- Select the smallest element not covered by the lines, subtract it from all
uncovered elements including itself, add it to the elements which are crossed by
two lines and reproduce other elements crossed by one line intact.

Company A B C D E 1 o O o M 2 30 0 Proposals(INR in "000") 5 15 0 3 35 o 0 10 0 4

25 M O 5 20 0 5

Note- As the number of lines drawn are equal to rows or columns, optimum solution
has been reached and we proceed to Step number 7 for assignment.

15

Proposals(INR in "000")

Company A B C D E 1 0 & XX M 10 2 30 0 5 15 0 3 35 0 0 10 0 25 M 5 0 5 5 20 0 0 LO
5 5

Note- (i) On examining, we find that since in row number two there is a single zero
for assignment which we mark it by having a square around it. After doing so we
check for any other zeros in that respective column for it to be crossed out. There
are two zeros which can be crossed out.

(ii) After doing the row exercise, we try to find a single zero in the column
starting from column number one. We do not find a single zero in any of the columns

(iii)We again proceed to look for a single zero in a row going row by row. We find
that there is one zero in fourth row which we mark .After marking we find that
there is no zero in that respective column which can be crossed out.

Now there are multiple zeros in row as well as column.

This situation signifies that we have more than one solution to the problem .i.e.
Multiple Solutions

In such a case, we select the remaining zeros to be blocked of our

choice,remembering one think that while doing so,we ensure that there is only one
zero in each row for assignment. When we block the zero arbitrarily, any zeros in
that respective column as well as row get crossed out.

By doing this exercise, we get two optimum solutions whose assignment is different,
but the total proposal cost in INR in "000" remains the same.

Solution -1

16
Company A B C D E Proposals 1 2 5 4 3 Total INR in "000" 50 85 80 70 90 375

In a similar way we do the arbitrarily allotment as mentioned above (Student if

need be can refer to illustration 2) to get Solution-2.

A B D E Proposals 1 Company 3 5 4 2 Total INR in "000" 50 95 80 70 80 375

4. Schedule the training seminars in five working days of the week so that the
number of students unable to attend is kept to the minimum. The details are as
follows:

17

Days Monday Tuesday Wednesday Thursday Friday Leasing (L) 50 40 60 30 10 Portfolio

Management (PM) 40 30 20 30 20 Private Mutual Fund (PMF) 60 40 30 20 10 Equity
Research (ER) 20 30 20 30 30

Solution:

As the number of columns is not equal to the number of rows, this is a case of
unbalanced assignment problem. Hence before proceeding ahead with the Hungarian
method, we need to ensure that numbers of rows are equal to number of columns and
this is done by introducing dummy column having all its elements as zero. The
balanced assignment table is given below:

Days Leasing (L) Monday Tuesday Wednesday 60 Thursday Friday 50 40 30 10 40 30 20

30 20 Portfolio Management (PM) 60 40 30 20 10 Private Mutual Fund (PMF) 20 30 20
30 30 Equity Research (ER) Dummy 0 0 0 0 0

As each row has a zero as minimum element, we straightaway proceed to Step3 (column
minima).

Step 3- Subtract the minimum element of each column from all the elements in that
respective column. This step is known as Column Minima.

18

Days Monday Tuesday Wednesday 50 Thursday Friday Leasing (L) 40 30 20 0 Portfolio

Management (PM) 20 10 0 10 0 Private Mutual Fund (PMF) 50 30 20 10 0 Equity
Research (ER) 0 10 0 10 10 Dummy 0 0 0 0 0

Step 4- Draw the least (minimum) number of horizontal and/or vertical lines to
cover all zeros in the table.

Days Monday Tuesday Wednesday Thursday Friday Leasing (L) 40 30 --50 20 0 Portfolio
Management (PM) 20 10 0 10 0 Private Mutual Fund (PMF) 50 30 20 10 Equity Research
(ER) 10 10 10 Dummy D 10

Note- We see that only four lines are sufficient to cancel all zeros. We have drawn
minimum number of horizontal and vertical lines with each line striking off maximum
zeros. As the number of lines are less than the rows and columns, we move on to
step number 5 for modification.

Step 5- Select the smallest element not covered by the lines, subtract it from all
uncovered elements including itself, add it to the elements which are crossed by
two lines and reproduce other elements crossed by one line intact.
19

Days Monday Tuesday Wednesday Thursday Friday Leasing (L) 30 20 50 10 Portfolio

Management (PM) 10 0 Private Mutual Fund (PMF) 40 20 20 Equity Research (ER) 0 10
10 10 20 Dummy 0 0 10 0 10

As the number of lines is equal to rows or columns optimum solution has been
reached and we move to step number 7 for assignment.

Step 7- Proceed to job assignments as follows:

Examine the rows one by one starting with the first row until a row with an exactly
one zero is found. Mark the zero by enclosing it in a square indicating assignment
of the task to the facility. After doing so, cross out all the zeros (if any) in
that column as they cannot be used to make other assignments. Examine next the
columns for any column having a single zero, starting from the first column. Mark
the zero as mentioned above, crossing out the remaining zeros (if any) in that row.

Repeat steps (i) and (ii) alternatively until all the zeros have been either
assigned or crossed.

Days Monday Tuesday Wednesday Thursday Friday Leasing (L) 30 20 50 10 0 Portfolio

Management (PM) 10 X 0 Private Mutual Fund (PMF) 40 20 20 0 X Equity Research (ER)
0 10 10 10 20 Dummy x 10 X 10

Step 8-Summary of the assignment is given in the table below:

20

Days Monday Tuesday Wednesday Thursday Friday Training Seminar ER PM PMF L

Absenteeism of students 20 20 20 10

Tuesday is the day off from the training program.

5. The Marketing Director of the multinational company faced with the problem
assigning five senior marketing managers to six zones. From past experience he
knows that the efficiency percentage by sales depends on marketing manager-zone
combination given in the following table:

Marketing Manager A B D E 1 71 79 73 91 88 2 83 83 70 94 89 3 85 67 81 84 77 4 80
74 82 89 87 5 76 72 76 81 67 6 78 83 89 80 74

Zones

As an advisor to the company, recommend which zone should be manned by junior

manager so as to maximize the overall efficiency of the company.

Solution:

We see two things which are different:

The objective function is maximization of the efficiency of the company.

The problem is an unbalanced transportation problem as the number of rows is not

equal to number of columns.

21
Note- Hungarian method can only be issued when the objective function is
minimization. There is a deviation here as the objective function is maximization.

In such a case we first convert the given assignment table (let the table be
balanced or unbalanced) to an opportunity loss table by subtracting each and every
element of the table from the highest element in the table which in this case is
94. By doing so the opportunity loss table is as following:

Marketing Manager A B D E 1 23 15 21 3 6 2 11 11 24 0 5 3 9 27 13 10 17 Zones 4 14

20 12 5 7 5 18 22 18 13 27 6 16 11 5 14 20

The above opportunity loss table is unbalanced as the number of rows is not equal
to number of columns .A dummy row is added with each element in that row being
zero. By doing so the balanced opportunity loss table is given as follows:

Marketing Manager A B C D E Dummy 1 71 79 73 91 88 0 2 83 83 70 94 89 0 3 85 67 81

84 77 0 Zones 4 80 74 82 89 87 0 LO 5 76 72 76 81 67 0 6 78 83 89 80 74 0

We now proceed to Step number 2 for row minima.

22

Step 2- Subtract the minimum element of each row of the matrix from all elements of
the respective row. This step is known as Row Minima.

Marketing Manager A B D E Dummy 1 14 4 16 3 1 0 2 2 0 19 0 0 0 3 0 16 8 10 12 0

Zones 4 5 9 7 5 2 0 5 9 11 13 13 22 0 6 7 0 0 14 15 0

As each column has a zero, column minima is not required and we move on to step
number 4

Step 4- Draw the least (minimum) number of horizontal and/or vertical lines to
cover all zeros in the table.

Marketing Manager A B D E Dummy 1 14 4 16 3 1 --0 2 0 19 0 3 0 16 8 10 12 0 Zones 4

9 7 5 2 0 5 9 11 13 13 22 0 6 14 15 0

Note- We see that only four lines are sufficient to cancel all zeros. We have drawn
minimum number of horizontal and vertical lines with each line striking off maximum
zeros. As the

23

number of lines are less than the rows and columns, we move on to step number 5 for
modification.

Step 5- Select the smallest element not covered by the lines, subtract it from all
uncovered elements including itself, add it to the elements which are crossed by
two lines and reproduce other elements crossed by one line intact.

Marketing Manager A B с D E Dummy 1 14 1 13 0 0 0 2 3 0 19 0 2 3 3 0 13 5 7 11 0

Zones 4 5 6 4 2 1 0 5 9 8 10 10 21 0 6 10 0 0 14 17 3

Note 1 is the smallest non-crossed element we have subtracted from all non-crossed
elements including itself and added this smallest element 1 to the elements which
are crossed by two lines (for example element 2 in the second column was crossed by
two lines and hence 1 was added to the element 2 by which the new element in this
column is reading 3) .All other elements which are crossed by one line remain
intact (for example digit 14 in the first row remains unchanged as it is crossed by
only one line).

We again draw minimum number of lines crossing out all zeros in the table as shown
below:

24

Marketing Manager 1 A B C D E Dummy 14 13 0 2 19 3 0 13 11 Zones 4 5 6 4 2 1 o 5 9

8 10 10 21 o 6 10 14

Note- We again see that only five lines are sufficient to cancel all zeros. We have
drawn minimum number of horizontal and vertical lines with each line striking off
maximum zeros. As the number of lines is less than the rows and columns, we again
use step number 5 for modification.

Marketing Manager A B D E Dummy 1 14 1 13 0 0 1 2 3 0 19 0 2 4 3 0 13 5 7 11 1

Zones 4 4 5 3 1 0 0 5 8 7 9 9 20 0 6 10 0 0 14 17 4

We again draw minimum number of lines crossing out all zeros in the table as shown
below

25

Marketing Manager 1 A B C D E Dummy 14 13 0 -0 1 2 3 0 19 0 2 4 3 1 Zones 4 4 5 3 1

O o 5 8 9 9 20 0 6 10 14 17 4

As the number of lines is equal to rows or columns optimum solution has been
reached and we move to step number 7 for assignment.

Step 7- Proceed to job assignments as follows:

Examine the rows one by one starting with the first row until a row with an exactly
one zero is found. Mark the zero by enclosing it in a square indicating assignment
of the task to the facility. After doing so, cross out all the zeros (if any) in
that column as they cannot be used to make other assignments. Examine next the
columns for any column having a single zero, starting from the first column. Mark
the zero as mentioned above, crossing out the remaining zeros (if any) in that row.

Repeat steps (i) and (ii) alternatively until all the zeros have been either
assigned or crossed.

Marketing Manager A B D E Dummy 1 14 1 13 0 XX 1 2 3 0 19 X 2 4 3 0 13 26 5 7 11 1

Zones 4 4 5 3 1 0 5 8 7 9 9 20 6 10 0 14 17 4

Step 8-Summary of the assignment is given in the table below

Marketing Manager A B с D E Zone 3 2 6 1 4 Efficiency 85 83 89 91 87

Zone 5 is left out, which can be manned by a junior manager to maximize overall
efficiency of the company.

6. An airline that operates seven days in a week has time table shown below. Crews
must have a minimum layover of five hours between flights. Obtain the pairing of
flights that minimize layover time away from home. For any given pair the crew will
be based at the city that results in smaller layover.

Flight No 101 102 103 104 Delhi-Jaipur Departure 7 A.M. 8 A.M. 1.30 P.M. 6.30 P.M.
Arrival 8 A.M. 9 A.M. 2.30 PM 7.30 PM

27

Jaipur-Delhi Flight No 201 202 203 204 Departure 8 A.M. 8.30 A.M. 12 Noon 5.30 P.M.
Arrival 9.15A.M. 9.45 AM 1.15PM 6.45 PM

For each pair also mention the place where the crew should be based.

Solution:

The illustration mentions about flight operating from Delhi-Jaipur and Jaipur-Delhi
on a daily basis. We need to locate the crew for pair of flights where layover time
(idle time) is the lowest.

Since the objective is to minimize layover time between flights, we can use the
Hungarian method.

However before doing so we need to calculate the layover time for each pair of
flights from Delhi to Jaipur and back with crew based at Delhi and similarly
calculate the layover time for each pair of flights from Jaipur to Delhi and back
with crew based at Jaipur.

After getting the respective tables containing layover time, we select the lowest
layover time out of the two tables for each pair of flights and by which get the
lowest layover time table on which we need to carry out the Hungarian method.

28

Table consisting of Layover time in minutes for crew based in Delhi

Delhi-Jaipur

Return Flight Delhi-Jaipur Flights 101 102 103 104 201 *1440 1380 1050 750 202 1470
1410 1080 780 Flight Number 203 1680 1620 1290 990 204 570 510 1620 1320

Note-*101 flight lands at Jaipur at 8 am. In case the crew flying on 101 wants to
come back to Delhi by 201 flight which takes off from Jaipur at 8 am, the layover
time between these two flights is 24 hours (8am takeoff next day from Jaipur-8am,
the time it lands at Jaipur.) equals 24 hours which is 1440 minutes.

Let us do one more calculation. Consider 104-202 combination.

Note-104 flight lands at Jaipur at 7.30 pm and 202 flight takes off from Jaipur at
8.30 am. Therefore the layover time between this pair of flight will be 8.30 am
next day and 7.30 pm earlier day, which is equal to 13 hours and in minutes 13×60=
780 minutes.

Note-We have to keep in mind that the minimum layover time has to be five hours.
Layover time between pair of flights is equal to the difference between takeoff of
the return flight and the landing of the earlier flight. Further we avoid fractions
in terms of hours we have taken minutes as the basis for the formation of the above
table.

Can you do the balance calculations? I am sure you will.

Let us do the same exercise of calculating layover time in minutes for crew based
in Jaipur for the Jaipur-Delhi sector.

29

Table consisting of Layover time in minutes for crew based in Jaipur

Delhi-Jaipur

Jaipur-Delhi → Return Flights 201 101 102 103 104 1305 1365 1695 555 202 **1275
1335 1665 525 Flight Number 203 1065 1125 1455 315 204 735 795 1125 1425

Note-** 202 flight lands at Delhi at 9.45 am and in case the crew on this flight
wants to come back by 101 flight which departs from Delhi at 7am,the difference
works out to 21 hours plus 15 minutes which is equal to 21×60+15 minutes=1275
minutes.

As said before we now get the lowest layover time table from the above two tables
for each pair of flights an which is as given below:

Flights 101 102 103 104 201 1305* 1365* 1050 555* 202 1275* 1335x 1080 525x Flight
Number 203 1065* 1125x 1290 315x 204 570 510 1125x 1320

* means crew is based at Jaipur and if there is no*means crew is based at Delhi.

As the above table is balanced and least cost table, we can use the Hungarian
method and proceed to Step number 2 for Row Minima.

Step 2- Subtract the minimum element of each row of the matrix from all elements of
the respective row. This step is known as Row Minima.

30

Flights 101 102 103 104 201 735 855 0 240 202 705 825 30 210 Flight Number 203 495
615 240 0 204 0 0 75 1005

Step 3- Subtract the minimum element of each column from all the elements in that
respective column. This step is known as Column Minima.

Flights 101 102 103 104 201 735 855 0 240 202 675 795 0 180 Flight Number 203 495
615 240 0 204 0 0 75 1005

Step4-Draw the least (minimum) number of horizontal and/or vertical lines to cover
all zeros in the table.

Flights 101 102 103 104 201 735 855 O -240 202 675 795 0 180 Flight Number 203 495
615 240 o 204 75 1005

31

As the number of lines are less than the rows and columns, we move on to step
number 5 for modification.
Step 5- Select the smallest element not covered by the lines, subtract it from all
uncovered elements including itself, add it to the elements which are crossed by
two lines and reproduce other elements crossed by one line intact.

Flight Number Flights 101 102 103 104 201 240 360 o 240 202 160 300 O 180 203 0 120
240 204 d 0 570 1500

Note- We again see that only four lines are sufficient to cancel all zeros. We have
drawn minimum number of horizontal and vertical lines with each line striking off
maximum zeros. As the number of lines is less than the rows and columns, we again
use step number 5 for modification

Flights 101 102 103 104 201 80 200 0 240 202 0 140 0 180 Flight Number 203 0 120
400 0 204 0 0 730 1500

We again draw minimum number of lines crossing out all zeros in the table as shown
below

32

Flights 101 102 103 104 201 80 200 Ө 240 202 o 140 0 180 Flight Number 203 o 120
400 o 204 0 730 1500

As the number of lines is equal to rows or columns optimum solution has been
reached and we move to step number 7 for assignment.

Flights 101 102 103 104 201 80 200 0 240 202 0 140 X 180 Flight Number 203 120 400
0 204 0 730 1500

Step 7- Proceed to job assignments as follows:

Examine the rows one by one starting with the first row until a row with an exactly
one zero is found. Mark the zero by enclosing it in a square indicating assignment
of the task to the facility. After doing so, cross out all the zeros (if any) in
that column as they cannot be used to make other assignments.

Examine next the columns for any column having a single zero, starting from the
first column. Mark the zero as mentioned above, crossing out the remaining zeros
(if any) in that row.

Repeat steps (i) and (ii) alternatively until all the zeros have been either
assigned or crossed.

33

Flights 101 102 103 104 201 240 360 0 240 202 160 300 0 180 Flight Number 203 0 120
240 0 204 0 0 570 1500

Step 8-Summary of the assignment is given in the table below

Pair of Flights 101-202 102-204 103-201 104-203 Crew based at Jaipur Delhi Delhi
Jaipur Total Layover Time in minutes 1275 510 1050 315 3150

Note-For pair of flight101-202 we see from the least layover time table, the crew
is based at Jaipur. Remember the *marking and similarly for the other pair of
flight we can know where the crew will be based.
7. A travelling salesman has to visit five cities. He wishes to start from a
particular city, visit each city once and then return to his starting point. The
travelling cost (Rs in 000) of each city from a particular city is given below:

34

From City A B C D E A M 6 8 12 1 B 2 M 7 4 3 C 5 3 M 6 2 To City D 7 8 4 M 8 E 1 2

7 5 M

What is the sequence of visit of the salesman to achieve the least cost route?

Solution:

The given assignment table is a balance assignment table and is regarding

travelling salesman. We will use Hungarian method with a difference to satisfy the
condition that, the salesman should visit each city before returning to the city
where he started from.

Note- A travelling salesman problem is typical assignment problem with two

additional constraints:

Salesmen should not visit the city twice until he has visited all the cities.

No assignment should be made along the diagonal line.

As the numbers of rows are equal to columns, we have a balanced assignment table
and move on to step number 2.

Step 2- Subtract the minimum element of each row of the matrix from all elements of
the respective row. This step is known as Row Minima.

35

From City A B C D E A M 4 4 8 0 B 1 M 3 0 2 C 4 1 M 2 1 To City D 6 0 M 7 E 0 0 3 1

M

Step 3- Subtract the minimum element of each column from all the elements in that
respective column. This step is known as Column Minima.

From City A B C D E A M 4 4 8 0 B 1 M 3 0 To City 2 C 3 0 M 1 0 D LO 6 0 M 7 E 0 0

3 1 M

Step 4- Draw the least (minimum) number of horizontal and/or vertical lines to
cover all zeros in the table.

36

From City A B C D E A M 8 B 1 M B To City C 3 M D M 7 E M

As the number of lines is equal to rows or columns optimum solution has been
reached and we move to step number 7 for assignment.

Step 7- Proceed to job assignments as follows:

Examine the rows one by one starting with the first row until a row with an exactly
one zero is found. Mark the zero by enclosing it in a square indicating assignment
of the task to the facility. After doing so, cross out all the zeros (if any) in
that column as they cannot be used to make other assignments.

Examine next the columns for any column having a single zero, starting from the
first column. Mark the zero as mentioned above, crossing out the remaining zeros
(if any) in that row.

Repeat steps (i) and (ii) alternatively until all the zeros have been either
assigned or crossed.

From City A B C D E A M 4 4 8 0 To City B 1 M 3 0 2 C 3 M 1 X 6 6 M 7 E 0 X 3 1 M

37

However the solution gives the sequence A-E-A .This does not satisfy the condition
that the salesman has to visit each city once before returning to the starting
point.

Hence we have to look at the next best solution which satisfies the above mentioned
condition. This can be obtained by the next (non-zero) minimum element i.e. 1 into
the solution. In the above table cost 1 occurs at three different places .Therefore
we consider all these three one's, one by one until the acceptable solution or next
best solution is found to meet the above condition.

Case1- We select 1 in the cell AB instead of zero assignment in the cell AE and
delete row A and column B. After this step we select exclusive zero in the row or
column .Except at one place i.e row number four we get exclusive zero in a row or a
column. After selecting lowest element 1 in this row, in cell DE we are able to
satisfy the condition. The assignment table on the above basis is as follows:

To City From City A B C D E A M 4 4 8 0 B M C 0 M 1 XX D 6 6 0 M 7 E o xá 3 1 M

We have not taken other two cases as we achieved the next best solution satisfying
the condition.

The table below gives us the total transportation cost:

38

From City A B C D E To City B с D E A Total Travelling Cost INR 2000 3000 4000 5000
1000 15000

Note-No feasible solution is obtained in case we had selected 1 in cell DC.

The notes given in the illustrations are for guidance only. The notes and steps
mentioned in this book as well as the CD-ROM should be used by the students to get
a good insight on the diversity of the illustrations solved. While solving
illustrations on their own, students are requested to mention the step in brief
before writing the table below the same.

CLOSING NOTES ON ASSIGNMENT

A variety of assignment problems have been taken to give you a flavour of this
topic.

Students are advised to make all attempts to solve these illustrations in the CD-
ROM on their own, an only when they are stuck up as a last measure refer to the
solutions therein.

Go step by step to achieve the optimum solution.

Notes are provided in the illustrations only for guidance.

You need not be a maths expert to solve the illustrations, just believe in your
ability and keep a positive approach.

39