Unit.3 Assignment Problem (By Dr. K.srinivas)

OPERATIONS RESEARCH UNIT-III STUDY MATERIAL
Department of Statistics
Andhra Loyola College (Autonomous)
Vijayawada-520008
Title of the Paper : OPERATIONS RESEARCH (OR)

Paper Code : STA356OR
Syllabus for Unit-III : ASSIGNMENT PROBLEM
Assignment Problem – introduction, LP formulation of assignment problem, Hungarian
method to solving assignment problem, unbalanced, maximization, restricted assignment
problem.
Prepared by : Dr. Srinivas Karimujja, Lecturer, Department of Statistics,
Andhra Loyola College, Vijayadada-520008.
drgvasu.k@gmail.com
Object:
By the end of this unit student will be able to:
• Formulate the special linear programming using Assignment model.
• Solve Assignment problems with Hungarian method.
• Solve Unbalanced, Maximized and Restricted Assignment problems.
ASSIGNMENT PROBLEM
Introduction:
The objective of Assignment Problem is to minimize the cost or time of completion of

a number of jobs by a number of persons. In other words, when the problem involves the
allocation of ‘n’ different facilities to ‘n’ different tasks, it is often termed as Assignment
Problem. The assignment problem deals in allocating the various origins (jobs) to equal number
of destinations (persons) on a one to one basis in such a way that the resultant effectiveness is
optimized (minimum cost or maximum profit). This is useful in solving problems such as
assigning men to different operations in a milk plant, milk tankers to delivery routes, machine
operators to machines, jobs to persons in a dairy plant etc.
1
Dr. Srinivas Karimujja, Dept. of statistics, ALC, Vij-08
History:
Hungarian method of assignment which provides us an efficient method of finding the
optimal solution without having to make a direct comparison of every solution. It works on the
principle of reducing the given cost matrix to a matrix of opportunity costs. Opportunity costs
show the relative penalties associated with assigning resource to an activity as opposed to
making the best or least cost assignment. If we can reduce the cost matrix to the extent of
having at least one zero in each row and column, it will be possible to make optimal
assignments (opportunity costs are all zero). The Hungarian method is a combinatorial
optimization algorithm which solves the assignment problem in polynomial time and which
anticipated later primal-dual methods. Kuhn (1955) further developed the assignment problem
which has been as "Hungarian method" because the algorithm was largely based on the earlier
works of two Hungarian mathematicians: Dénes Kınig and Jenı Egerváry.
Definition of Assignment Problem:
Assignment problem is special class of the transportation problem in which the supply
in each row represents the availability of a resource such as man, vehicle, product and demand
in each column represents different activities to be performed, such as jobs, routes, milk plants
respectively is required. The name Assignment Problem originates from the classical problem
where the objective is to assign a number of origins (jobs) to equal number of destinations
(persons) at a minimum cost (or Maximum profit). Suppose there are ‘n’ jobs to be performed
and ‘n’ persons are available for doing these jobs. Assume that each person can do each job at
a time, though with varying degree of efficiency. Let Cij be the cost if i th person is assigned
the j th job, the problem is to find an assignment so that the total cost for performing all jobs is
minimum. One of the important characteristics of assignment problem is that only one job (or
worker) is assigned to one machine (or project). Hence, the number of sources is equal to the
number of destinations and each requirement and capacity value is exactly one unit.
2
The assignment problem can be stated in the form n  n cost matrix Cij  of real number
as given below
Sources Jobs
J1 J2 … Jj … Jn
P1 C11 C12 … C1 j … C1n
P2 C21 C 22 … C2 j … C 2n
… … … … … …
Persons
..
Pi Ci1 Ci 2 … Cij … Cin
… … … … … … …
Pn Cn1 Cn 2 … Cnj … C nn
Mathematical Formulation of Assignment Problem:
Using the notations described above, the assignment problem consists of finding the
values of X ij in order to minimize the total cost
n n
Minimize Z =  Cij X ij ; i = 1, 2,3,..., n, j = 1, 2,3,..., n
i =1 j =1
Subject to conditions
1 if the i th person is assigned to j th job
X ij = 
0 otherwise
n
X
j =1
ij = 1 (only one job is done by the i th person)
X
i =1
ij = 1 (only one person should be assigned to the j th job)
where X ij denotes the j th job to be assigned to the i th person. An assignment problem
could thus be solved by Simplex Method.
3
Mathematical Model of Assignment problem:
Let us consider the case of a milk plant which has three jobs to be done on the three
available machines. Each machine is capable of doing any of the three jobs. For each job the
cost depends on the machine to which it is assigned. Costs incurred by doing various jobs on
different machines are given below
Machine
Job I II III
A 7 8 6
B 5 4 9
C 2 5 6
Write the mathematical model for the given assignment problem.
Solution:
Object function
Minimize the total cost
MinimumZ = 7 x11 + 8 x12 + 6 x13

+ 5x21 + 4 x22 + 9 x23
+ 2 x31 + 5x32 + 6 x33
Conditions
Conditions on machines
Receive one machine one job only
x11 + x12 + x13 = 1

x21 + x22 + x23 = 1
x31 + x32 + x33 = 1
Condition on jobs
Assign only one to one machine
x11 + x21 + x31 = 1

x12 + x22 + x32 = 1
x13 + x23 + x33 = 1
4
And
1, if the i th person is assigned to jth job

xij = 
0, if the i th person is not assigned to jth job
xij  0  i and j
Simple explanation:
Let us consider the case of a milk plant which has three jobs to be done on the three
available machines. Each machine is capable of doing any of the three jobs. For each job the
cost depends on the machine to which it is assigned. Costs incurred by doing various jobs on
different machines are given below
Machine
Job I II III
A 7 8 6
B 5 4 9
C 2 5 6
The problem of assigning jobs to machines, one to each, so as to minimize total cost of
doing all the jobs, is an assignment problem. Each job machine combination which associates
all jobs to machines on one-to-one basis is called an assignment. In the above example let us
write all the possible assignments
Number Assignment Total Cost

1 Job A-Machine I, Job B-Machine II, Job C-Machine III 7+8+6=21
2 Job A-Machine I, Job B-Machine III, Job C-Machine II 7+9+5=21
3 Job A-Machine II, Job B-Machine III, Job C-Machine I 8+9+2=19
4 Job A-Machine II, Job B-Machine I, Job C-Machine III 8+5+6=19
5 Job A-Machine III, Job B-Machine I, Job C-Machine II 6+5+2=13
6 Job A-Machine III, Job B-Machine II, Job C-Machine I 6+4+2=12
As per the above assignment, the assignment number 6 having total cost 12 is minimum
therefore needs to be selected. But selecting assignment in this manner is quite time consuming.
We state below, the following theorems which have potential applications in finding
out of the optimal solution for assignment problems:
5
Theorem1: Reduction Theorem
It states that in an assignment problem, if we add or subtract a constant to every element

of any line (row or column) of the cost matrix Cij  , then an assignment that minimizes the
total cost on one matrix also minimizes the total cost on the other matrix.
Theorem 2:
In an assignment problem with cost Cij , if all Cij  0 then a feasible solution X ij which
n n
satisfies  Cij X ij is optimal for the problem
i =1 j =1
Remarks
There are situations when a particular assignment may not be permissible. In such
situations assign a very high cost (say M) for such an assignment and proceed as usual.
1. Maximization method: If the assignment problem involves maximization, convert the

effective matrix to an opportunities loss matrix by subtracting each element from the
highest element of the matrix. Minimization of the resulting matrix is the same as the
maximization of the original matrix.
2. Unbalanced Method: In a given assignment problem the number of rows and number
of columns are not equal, then the problem is considered as Unbalanced Assignment
problem. In this, we introduced dummy row, in case number of rows less than number
of columns, or dummy column, in case number of columns less than number of rows,
with “0” cost elements ( Cij = 0 ) and solve the problem using assignment procedure.
3. Restricted Method: In the given assignment problem any restriction is mention for ith
job with jth person. We take the cost of that cell as infinity ( Cij =  ).
Similarity of Assignment Problem to Transportation Problem
The assignment problem is a particular case of transportation problem in which a

number of operations are to be assigned to an equal number of operators, where each operator
performs only one operation. The objective is to maximize overall profit or minimize overall
cost for a given assignment schedule.
6
The Assignment Problem is a special case of the transportation problem in which m = n
All ai and b j are unity i.e., The availability and requirement at i th origin and j th destination
are unity, and each X ij is limited to one of the two values 0 and 1. Under these circumstances,
exactly n of X ij can be non-zero (i.e., unity), one in each row of the table and one in each
column.
An assignment problem is a completely degenerate form of a transportation problem.

The units available at each origin and units demanded at each destination are all equal to one.
This means exactly one occupied cell in each row and each column of the transportation table.
i.e., only n occupied cells in place of the required n + n −1 = 2n −1
ASSIGNMENT PROBLEM
Introduction
Although assignment problem can be solved either by using the techniques of Linear
Programming or by the transportation method yet the assignment method developed by
D. Konig, a Hungarian mathematician known as the Hungarian method of assignment problem
is much faster and efficient. In order to use this method, one needs to know only the cost of
making all the possible assignments. Each assignment problem has a matrix (table) associated
with it. Normally, the objects (or people) one wishes to assign are expressed in rows, whereas
the columns represent the tasks (or things) assigned to them. The number in the table would
then be the costs associated with each particular assignment. It may be noted that the
assignment problem is a variation of transportation problem with two characteristics firstly the
cost matrix is a square matrix and secondly the optimum solution for the problem would be
such that there would be only one assignment in a row or column of the cost matrix.
Solution of Assignment Problem
The assignment problem can be solved by the following four methods:
a) Complete enumeration method
b) Simplex Method
c) Transportation method
d) Hungarian method
7
Complete enumeration method
In this method, a list of all possible assignments among the given resources and
activities is prepared. Then an assignment involving the minimum cost, time or distance or
maximum profits is selected. If two or more assignments have the same minimum cost, time
or distance, the problem has multiple optimal solutions. This method can be used only if the
number of assignments is less. It becomes unsuitable for manual calculations if number of
assignments is large
Simplex method
This can be solved as a linear programming problem as discussed in

Mathematical Formulation of Assignment Problem and such can be solved by the simplex
algorithm.
Transportation method
As assignment is a special case of transportation problem, it can also be solved using

transportation model. The solution obtained by applying this method would be degenerate. This
is because the optimality test in the transportation method requires that there must be
m + n −1 = 2n −1 basic variables. For an assignment problem of order n  n there would be
only n basic variables in the solution because here n assignments are required to be made. This
degeneracy problem of solution makes the transportation method computationally inefficient
for solving the assignment problem.
Hungarian assignment method
The Hungarian method of assignment provides us with an efficient means of finding

the optimal solution. The Hungarian method is based upon the following principles:
I. If a constant is added to every element of a row and/or column of the cost matrix of an
assignment problem the resulting assignment problem has the same optimum solution
as the original problem or vice versa.
II. The solution having zero total cost is considered as optimum solution.
Hungarian Procedure:
Hungarian method of assignment problem (minimization case) can be summarized in the
following steps:
8
I. First check the number of rows and columns are equal or not for the given cost matrix
of the problem (given matrix should be square only). If not, (make it square matrix)
balance the given cost matrix by introducing required number of dummy rows or
dummy columns with zero valued elements.
II. Subtract the minimum cost of each row of the cost (effectiveness) matrix from all the
elements of the respective row so as to get first reduced matrix called “row minimized
matrix”.
III. Similarly subtract the minimum cost of each column of the cost matrix from all the
elements of the respective column of the row minimized matrix. This is called “column
minimized matrix”.
IV. Starting assignment with first row of the column minimized matrix. If only one zero
valued element is present in that row assign assignment to that zero valued element and
strike off the corresponding column of the assigned element in that row, otherwise skip
that row. Examine the rows one by one until all row containing exactly single zero
element is found.
V. After completion of assignment to the rows, starts with columns. If only one zero valued
element is present in that column assign assignment to that zero valued element and
strike off the corresponding row of the assigned element in that row, otherwise skip that
column. Examine the columns one by one until all columns containing exactly single
zero element is found.
VI. Continue these successive operations on rows and columns until all zero valued
elements have been either assigned, strike off or crossed out and there is exactly one
assignment in each row and in each column. (In some cases there are more than one
zero valued element is presented in row or column, it’s difficult to continue the
procedure, in such cases we assign assignment to one zero valued element by randomly
and crossed the remaining zero valued elements in that corresponding row, in row
assignment, or column, in column assignment). Then, we get “assignment matrix”.
VII. Then, Check the number assignment are equal to number of rows or columns (order of
cost matrix) in the assignment matrix.
Case I: If equal, in such case optimal assignment for the given problem is obtained.
Then, stop the solving problem and write the optimum solution.
9
Case II: If not-equal, in such case optimal assignment for the given problem is not
obtained and we solve the problem using Hungarian Method as follow
VIII. In this step, we
i) Select the smallest element from the assignment matrix, say X, among all the not
covered by any of the lines or cross.
ii) Subtract this value X from all of the elements in the matrix not covered by lines and
add X to all those elements that lie at the intersection of the horizontal and vertical
lines, write remaining crossed and strike offed element as it is. Now, we get
“modified cost matrix”.
IX. Repeat Steps IV, V and VI until we get the number of assignment equal to the order of
given cost matrix, till an optimum solution is attained.
Example 1 (Simple Assignment method)
A plant manager has four subordinates, and four tasks to be performed. The
subordinates differ in efficiency and the tasks differ in their intrinsic difficulty. This estimate
of the times each man would take to perform each task is given in the effectiveness matrix
below. I II III IV
A 8 26 17 11
B 13 28 4 26
C 38 19 18 15
D 19 26 24 10
How should the tasks be allocated, one to a man, so as to minimize the total man hours?
Solution
I From the given cost matrix, check the number of rows and columns are equal or not.
II Subtracting the smallest element in each row from every element in that row, we get the
row modified matrix.
0 18 9 3
9 24 0 22
23 4 3 0
9 16 14 0
10
III Next, we subtract the smallest element in each column from every element in that column
in row modified matrix; we get column modified matrix.
0 14 9 3
9 20 0 22
23 0 3 0
9 12 14 0
IV Starting assignment with first row of the column minimized matrix. If only one zero valued
element is present in that row assign assignment to the zero valued element and strike off
the corresponding column of the assigned element in that row, otherwise skip that row.
Examine the rows one by one until all row containing exactly single zero element is found.
0 14 9 3
9 20 0 22
23 0 3 0
9 12 14 0
Now, we strike off the first column
0 14 9 3
9 20 0 22
23 0 3 0
9 12 14 0
Now, we go to next row.

0 14 9 3
9 20 0 22
23 0 3 0
9 12 14 0
In third row we have two zero valued elements. So, we skip that row and move next row.
11
0 14 9 3
9 20 0 22
23 0 3 0
9 12 14 0
In the fourth row

0 14 9 3
9 20 0 22
23 0 3 0
9 12 14 0
With this all rows are completed but we have one zero valued element is presented
without assigning or strike off in the above matrix. So, we need apply column assignment
procedure.
V If only one zero valued element is present in that column assign assignment to that zero
valued element and strike off the corresponding row of the assigned element in that row,
otherwise skip that column. Examine the columns one by one until all columns containing
exactly single zero element is found.
Starts with first column.
0 14 9 3
9 20 0 22
23 0 3 0
9 12 14 0
In the first column an assignment is given and all elements strike off. So, move to next
column.
12
0 14 9 3
9 20 0 22
23 0 3 0
9 12 14 0
In this column we have only zero valued element. So, assign assignment to that element.
0 14 9 3
9 20 0 22
23 0 3 0
9 12 14 0
Now, strike off the corresponding
0 14 9 3
9 20 0 22
23 0 3 0
9 12 14 0
The remaining columns have assignments and no zero valued elements are left in the
matrix.
VI Now we check the optimality condition

Number of assignments = 4
Order of matrix = 4
The number of assignments is equal to order of solution matrix
Therefore, we get optimal solution for the given problem.
Optimum assignments are A-I, B-III, C -II and D-IV
The minimum total man hours are computed as (man hours are taken from given problem)
13
Optimal assignment Man hours
A-I 8
B-III 4
C-II 19
D-IV 10
Total 41 Man hours
Conclusion:
Optimum assignments are A-I, B-III, C -II and D-IV

The minimum (optimum) total man hours are 41Hr.
Example 2 (Hungarian Method)
A dairy plant has five milk tankers I, II, III, IV & V. These milk tankers are to be used
on five delivery routes A, B, C, D, and E. The distances (in kms) between dairy plant and the
delivery routes are given in the following distance matrix
I II III IV V
A 160 130 175 190 200
B 135 120 130 160 175
C 140 110 155 170 185
D 50 50 80 80 110
E 55 35 70 80 105
How the milk tankers should be assigned to the chilling centres so as to minimize the distance
travelled?
Solution
I From the given cost matrix, the number of rows and columns are equal.
II Subtracting the smallest element in each row from every element in that row, we get the
row modified matrix.
14
30 0 45 60 70
15 0 10 40 55
30 0 45 60 75
0 0 30 30 60
20 0 35 45 70
III Next, we subtract the smallest element in each column from every element in that column
in row modified matrix; we get column modified matrix.
30 0 35 30 15
15 0 0 10 0
30 0 35 30 20
0 0 20 0 5
20 0 25 15 15
IV Starting assignment with first row of the column minimized matrix. If only one zero valued
element is present in that row assign assignment to the zero valued element and strike off
the corresponding column of the assigned element in that row, otherwise skip that row.
Examine the rows one by one until all row containing exactly single zero element is found.
30 0 35 30 15
15 0 0 10 0
30 0 35 30 20
0 0 20 0 5
20 0 25 15 15
In second and fourth rows containing two zero valued elements and in remaining row no
zero valued elements without strike off. So, we move to column allocation.
V If only one zero valued element is present in that column assign assignment to that zero
valued element and strike off the corresponding row of the assigned element in that row,
otherwise skip that column. Examine the columns one by one until all columns containing
exactly single zero element is found.
15
30 0 35 30 15
15 0 0 10 0
30 0 35 30 20
0 0 20 0 5
20 0 25 15 15
VI No zero valued elements are left in the matrix. Now, we check Optimality condition as
Number of assignments = 3 and Order of matrix = 5
The number of assignments is not equal to order of solution matrix
Therefore, we not get optimal solution for the given problem. To get optimality solution
we apply the Hungarian procedure as follow.
Select the smallest element from the assignment matrix is 15, among all the not covered
by any of the lines or cross.
30 0 35 30 15
15 0 0 10 0
30 0 35 30 20
0 0 20 0 5
20 0 25 15 15
Subtract this value 15 from all of the elements in the matrix not covered by lines and
add to the intercepted elements (element at intercept of horizontal and vertical lines) and
write remaining crossed, cancelled and strike offed element as it is.
30-15 0 35-15 30-15 15-15
15 0+15 0 10 0
30-15 0 35-15 30-15 20-15
0 0+15 20 0 5
20-15 0 25-15 15-15 15-15
VII Now, we get “modified cost matrix”.

16
15 0 20 15 0
15 15 0 10 0
15 0 20 15 5
0 15 20 0 5
5 0 10 0 0
VIII Repeat Steps IV, V and VI until we get the number of assignment equal to the order of
given cost matrix, till an optimum solution is attained.
15 0 20 15 0
15 15 0 10 0
15 0 20 15 5
0 15 20 0 5
5 0 10 0 0
No zero valued elements are left in the matrix.
IX Now we check the optimality condition
Order of matrix = 5
Optimum assignments are A-V, B-III, C -II, D-I and E-IV
The minimum total man hours are computed as
Optimal assignment Rout (km)
A-V 200
B-III 130
C-II 110
D-I 50
E-IV 80
Total 570 km
Conclusion:
Optimum assignments are A-V, B-III, C -II, D-I and E-IV

The minimum (optimum) total rout distance is 570 km.
17
Example 3 (Maximization method)
Five salesmen are to be assignment to five territories. Based on the past performance, the
following table shows the annual sales (in rupees lakhs) that can be generated by each salesman
in each territory. Assign the five salesmen so as to maximize the total expected sales.
Territory
P Q R S T
Salesman A 26 14 10 12 9
B 31 27 30 14 16
C 15 18 16 25 30
D 17 12 21 30 25
E 20 19 25 16 10
Solution:
I Given problem is maximization type, so we convert the given effectiveness
matrix maximization type as
Find maximum element value from the given effectiveness matrix and
subtract each and every elements of the given effectiveness matrix from that
maximum element. Then, we get modified matrix called maximized matrix. (In
the given problem 31 is the maximum value, so subtract each and every element
from 31)
Territory
P Q R S T
A 31-26 31-14 31-10 31-12 31-9
Salesman
B 31-31 31-27 31-30 31-14 31-16

C 31-15 31-18 31-16 31-25 31-30
D 31-17 31-12 31-21 31-30 31-25
E 31-20 31-19 31-25 31-16 31-10
Then, we get new modified matrix called Maximized matrix as
18
Territory
P Q R S T
A 5 17 21 19 22
Salesman
B 0 4 1 17 15
C 16 13 15 6 1
D 14 19 10 1 6
E 11 12 6 14 21
II From the given cost matrix, the number of rows and columns are equal.
III Subtracting the smallest element in each row from every element in that row,
we get the row modified matrix.
Territory
P Q R S T
A 0 12 16 14 17
Salesman
B 0 4 1 17 15
C 15 12 14 5 0
D 13 18 9 0 5
E 5 6 0 8 15
IV Next, we subtract the smallest element in each column from every element in
that column in row modified matrix; we get column modified matrix.
Territory
P Q R S T
A 0 8 16 14 17
Salesman
B 0 0 1 17 15
C 15 8 14 5 0
D 13 14 9 0 5
E 5 2 0 8 15
V Starting assignment with first row of the column minimized matrix. If only one
zero valued element is present in that row assign assignment to the zero valued
element and strike off the corresponding column of the assigned element in that
19
row, otherwise skip that row. Examine the rows one by one until all row
containing exactly single zero element is found.
Territory
P Q R S T
A 0 8 16 14 17
Salesman
B 0 0 1 17 15
C 15 8 14 5 0
D 13 14 9 0 5
E 5 2 0 8 15
VI Now we check the optimality condition
Order of matrix = 5
Optimum assignments are A-P, B-Q, C -T, D-S and E-R
Optimal assignment Annual sales (in rupees lakhs)
A-P 26
B-Q 27
C-T 30
D-S 30
E-R 25
Total 138 Lakhs rupees
Conclusion:
Optimum assignments are A-P, B-Q, C -T, D-S and E-R

The maximum (optimum) sales are 138 lakhs rupees.
20
Example 4 (Unbalanced method)
Find the optimal assignments for different jobs are performed on different machines
with following time (in hours) matrix.
Jobs
A B C D E
1 18 20 32 40 16
Machines 2 15 16 36 33 22
3 20 11 30 24 17
4 10 18 28 20 19
I From the given cost matrix, the number of rows is not equal to number of
columns. This type of problem is called unbalance assignment problem. To
solve this type of problems first balancing the given problem as introduced the
required number of dummy rows, if number of rows less than number of
columns, or dummy columns, if number of columns less than number of rows,
with zero valued effectiveness elements in corresponding rows or columns.
(In the given problem we have four rows and five columns. So, introduced a
dummy row with zero valued elements as)
Jobs
A B C D E
1 18 20 32 40 16
Machines
2 15 16 36 33 22
3 20 11 30 24 17
4 10 18 28 20 19
5 0 0 0 0 0
Then, we get a modified matrix called balanced effectiveness matrix.
II Subtracting the smallest element in each row from every element in that row,
21
Jobs
A B C D E
1 2 4 16 24 0
Machines
2 0 1 21 18 7
3 9 0 19 13 6
4 0 0 18 10 9
5 0 0 0 0 0
III Next, we subtract the smallest element in each column from every element in
Jobs
A B C D E
1 2 4 16 24 0
Machines
2 0 1 21 18 7
3 9 0 19 13 6
4 0 0 18 10 9
5 0 0 0 0 0
IV Starting assignment with first row of the column minimized matrix. If only one
Jobs
A B C D E
1 2 4 16 24 0
Machines
2 0 1 21 18 7
3 9 0 19 13 6
4 0 0 18 10 9
5 0 0 0 0 0
22
V No zero valued elements are left in the matrix. Now, we check Optimality
condition as
Number of assignments = 4 and Order of matrix = 5
The number of assignments is not equal to order of solution matrix
Therefore, we not get optimal solution for the given problem. To get optimality
solution we apply the Hungarian procedure as follow.
Select the smallest element from the assignment matrix is 10, among all
the not covered by any of the lines or cross.
Jobs
A B C D E
1 2 4 16 24 0
Machines
2 0 1 21 18 7
3 9 0 19 13 6
4 0 0 18 10 9
5 0 0 0 0 0
VI Subtract this value 15 from all of the elements in the matrix not covered by lines
and add to the intercepted elements (element at intercept of horizontal and
vertical lines) and write remaining crossed, cancelled and strike offed element
as it is.
Jobs
A B C D E
1 2 4 16-10 24-10 0
2 0 1 21-10 18-10 7
Machines
3 9 0 19-10 13-10 6
4 0 0 18-10 10-10 9
0+ 0+ 0+
5 0 0
10 10 10
VII Now, we get “modified cost matrix”.
23
Jobs
A B C D E
1 2 4 6 14 0
Machines
2 0 1 11 8 7
3 9 0 9 3 6
4 0 0 8 0 9
5 10 10 0 0 10
VII Now we check the optimality condition
Order of matrix = 5
Optimum assignments are 1-E, 2-A, 3-B, 4-D and 5-C
Optimal assignment Time (in hours)

1-E 16
2-A 15
3-B 11
4-D 20
5-C 0
Total 62 Hours
Conclusion:
Optimum assignments are 1-E, 2-A, 3-B, 4-D and 5-C

The minimum (optimum) time is 62 hours.
24
Example 5 (Restricted Assignment)
Four new machines A, B, C and D are to be installed in a factory. There are five
locations I, II, III, IV and V available in the factory to install any of these machines. However,
due to space constraint, the machine B cannot be installed at the location I. The cost of
installation of the machine ith machine at the jth location is given in the following matrix. Find
the optimum allocation of locations to the machines.
Locations
I II III IV V
A 9 11 15 10 11
Machines
B - 11 7 10 9
C 13 11 16 14 15
D 14 8 19 7 13
Solution:
In the given problem one restriction is mentioned that as due to space constraint, the
machine B cannot be installed at the location I. So, we take the installation cost of machine B
at location I is infinity (  ) that means undefined, then the cost matrix is
Locations
I II III IV V
A 9 11 15 10 11
Machines
B  11 7 10 9
C 13 11 16 14 15
D 14 8 19 7 13
I From the given cost matrix, the number of rows is not equal to number of
columns. This type of problem is called unbalance assignment problem. To
solve this type of problems first balancing the given problem as introduced the
required number of dummy rows, if number of rows less than number of
columns, or dummy columns, if number of columns less than number of rows,
with zero valued effectiveness elements in corresponding rows or columns.
25
(In the given problem we have four rows and five columns. So, introduced a
dummy row with zero valued elements as)
Locations
I II III IV V
A 9 11 15 10 11
B  11 7 10 9
Machines
C 13 11 16 14 15
D 14 8 19 7 13
E 0 0 0 0 0
II Subtracting the smallest element in each row from every element in that row,
Locations
I II III IV V
A 0 2 6 1 2
B  4 0 3 2
Machines
C 2 0 5 3 4
D 7 1 12 0 6
E 0 0 0 0 0
III Next, we subtract the smallest element in each column from every element in
Locations
I II III IV V
A 0 2 6 1 2
B  4 0 3 2
Machines
C 2 0 5 3 4
D 7 1 12 0 6
E 0 0 0 0 0
26
IV Starting assignment with first row of the column minimized matrix. If only one
Locations
I II III IV V
A 0 2 6 1 2
B  4 0 3 2
Machines
C 2 0 5 3 4
D 7 1 12 0 6
E 0 0 0 0 0
VIII Now we check the optimality condition
Order of matrix = 5
Optimum assignments are A-I, B-III, C-II, D-IV and E-V
Optimal assignment Installation cost ₹
A-I 9
B-III 10
C-II 11
D-IV 7
E-V 0
Total 34 ₹
Conclusion:
Optimum assignments are A-I, B-III, C-II, D-IV and E-V

The minimum (optimum) ACOST is 34 ₹.
27
Exercise problems
1. Solve the following assignment problem.
I II III IV V VI
A 9 22 58 11 19 27
B 43 78 72 50 63 48
C 41 28 91 37 45 33
D 74 42 27 49 39 32
E 36 11 57 22 25 18
F 3 56 53 31 17 28
2. Find the maximum profit for the following assignment problem.
I II III IV
A 32 41 57 18
B 48 54 62 34
C 20 31 81 57
D 71 43 41 47
E 52 29 51 50
3. Write the mathematical form of assignment problem
Subordinate
A B C D
1 8 26 17 11
Tasks
2 13 28 4 26
3 38 19 18 15
4 19 26 24 10
28
4. A private firm employs typists on hourly piece rate basis for their daily work. Five
typists are working in that firm and their charges and speeds are different. On the basis
of some earlier understanding, only one job is given to one typist and typist is paid for
full hour even when he/she works for a fraction of an hour. Find the least cost allocation
for the following data.
Typist Rate per Hour (₹) No. of pages per Hour Job No. of Pages
A 5 12 P 199
B 6 14 Q 175
C 3 08 R 145
D 4 10 S 298
E 4 11 T 178
5. A City corporation has decided to carry out road repairs on four arteries of the city. The
government has agreed to make a special grant of ₹ 50 lakhs towards the cost with a
condition that the repairs must be done at the lowest cost and quickest time. If
conditions warrant, then a supplementary token grant will also be considered
favourably. The corporation has floated tenders and 5 contractors have sent in their
bids. In order to expedite work, one road will be awarded to only contractor
Cost per repair road (₹ lakhs)
A B C D
1 9 14 19 15
Contractors
2 7 17 20 19
3 9 18 21 18
4 10 12 18 19
5 10 15 21 16
i) Find the best way of assigning the repair work to the contractors and the cost.
ii) If it is necessary to seek supplementary grants, then what should be amount sought?
iii) Which of the five contractors will be unsuccessful in his bid?
29
6. A company has 5 jobs to be done. The following matrix shows the return in rupees on
assigning ith (i=1,2,3,4,5) machine to the jth job (j=A, B, C, D, E). Assign the five jobs
to the five machines so as to maximize the total expected profit.
Jobs
A B C D E
1 5 11 10 12 4
Machines 2 2 4 6 3 5
3 3 12 5 14 6
4 6 14 4 11 7
5 7 9 8 12 5
7. A taxi rental service has one surplus car in each of the cities A, B, C, D, E, and F. It has
a deb of one car in each of the cities I, II, III, IV, V, and VI. The distances (in km)
between the cities with a surplus car and the cities with a deficit car are given in the
following matrix. Detenu how the cars should be dispatched to meet the deficit in order
to minimize the total distal travelled.
To
I II III IV V VI
A 41 72 39 52 25 51
B 22 29 49 65 81 50
From
C 27 39 60 51 32 32
D 45 50 48 52 37 43
E 29 40 39 26 30 33
F 82 40 40 60 51 30
8. A marketing manager has 5 salesmen A, B, C, D, and E, and 5 sales districts.

Considering the capabilities of the salesmen, and the nature of the districts, the manager
has estimated that the sales per month (in thousands of Rupees) for each salesman in
each sales district would be as given in the following matrix. Find the optimal
assignment of the salesman to the sales districts.
30
Districts
I II III IV V
A 32 40 41 22 29
B 38 24 27 38 33
Salesman
C 40 28 33 41 40
D 28 21 30 36 35
E 40 36 37 36 39
9. There are 5 machines in a workshop. They have 4 jobs on hand, to be processed one on
each machine. The processing times of the jobs on the different machines (in minutes),
given in the following matrix. Determine the optimal assignment schedule.
Machines
I II III IV V
A 62 78 50 120 82
B 71 84 61 73 59
Jobs
C 87 92 100 71 81
D 48 64 87 77 80
10. A taxi rental service has one surplus car in each of the cities A, B, C, D, E, and F. It has
a deficit of one car in each of the cities I, II, III, IV, V, and VI. The distances (in km)
between the cites with a surplus car and the cities with a deficit car are given in the
following matrix. Determine how the cars should be dispatched to meet the deficit in
order to minimize the total distance travelled.
31
To
I II III IV V VI
A 41 72 39 52 25 51
B 22 29 49 65 81 50
From
C 27 39 60 51 32 32
D 45 50 48 52 37 43
E 29 40 39 26 30 33
F 82 40 40 60 51 30
11. An automobile declares put four repairmen for four different jobs. The repair has
somewhat different kinds of skills and they exhibit different levels of efficiency from
one job to another. The dealer has estimated the number of man-hours that would be
required for each job man, which is given is the Matrix shown below
Jobs
A B C D
1 5 3 2 8
Men 2 7 9 2 6
3 4 6 5 7
4 5 7 7 8
Find the optimal Assignments that will result in minimum hours needed.
12. In a textile sales emporium 4 salesmen are available to 4 counters. Each salesman can
handle any counter. The service (in hours) of each counter which managed by each
salesman is given below.
Salesman
A B C D
W 41 72 39 52
Counter X 22 29 49 65
Y 27 39 60 51
Z 45 50 48 52
How should the salesman be allocated to appropriate counters so as to minimize the

service time. Each salesman must handle only one counter. Also indicate the total
service time.
32
13. Five jobs 1,2,3,4 and 5 are to be assigned to five person A, B, C,D and E. The time
taken in minutes by each person is given in the following matrix.
1 2 3 4 5
A 16 13 17 19 20
B 14 12 13 16 17
C 14 11 12 17 18
D 5 5 8 8 11
E 5 3 8 8 10
Determine optimal schedule with time.
14. A computer centre has got 4 expert programmers. The centre needs 4 programmers to
be developed. The head of the computer centre after carefully studying the programs
estimated the time in minutes required by respective experts’ programmer as follows:
PROGRAMMERS
A B C D
1 120 100 80 90
EXPERTS
2 80 90 110 70
3 110 140 120 100
4 90 90 80 90
The manager wants to use assignment technique to solve the problem.
15. Four operators O1, O2, O3, O4 are available to a manger who has to get jobs J1,J2,J3,J4
done by assigning one job to each operator. Given the times needed by different
operator for different jobs in the matrix below:
J1 J2 J3 J4
O1 12 10 10 8
O2 14 12 15 11
O3 6 10 16 4
O4 8 10 9 7
How should the manger assign the jobs so that the total time needed for all the four jobs
is minimum. If the job J2 not to be assigned to operator O2, what should be assignment
and how much additional and how much additional time will be required.
16. The quotations (Rs. in lakhs) received for 4 projects from four contractors are as
follows:
33
A B C D
I 7 5 9 10
II 3 7 5 8
III 7 4 8 9
IV 8 7 5 2
If only one project is to be awarded to one contractor, find out the assignment of project
to Contractors in order to minimize the total cost. If due to certain reasons, it has been
decided to award project B to contractor I. How will you assign the remaining projects
to each of the remaining 3 contractors so that the total cost is minimum?
17. A manufacturer of complex electronics equipment has just received a sizeable contract
and plants to sub contract part of the Job. He has solicited bids for 6 sub contracts from
4 firms. Each Job is sufficiently large that any one firm can take only 1 Job. The cost
estimates for the bids and the cost estimates (In Rs. 10000’s) for doing the Jobs
Internally have been given below. Note that not more than 2 Jobs can be performed
internally.
JOBS
FIRM 1 2 3 4 5 6
1 48 72 36 52 50 65
2 44 67 41 53 48 64
3 46 69 40 45 45 68
4 43 73 37 51 44 62
Internal 50 65 35 50 46 63
Complete this table and solve the problem by the Hungarian method, minimizing total
cost.
18. A transportation corporation operates everyday four routes with four trucks and the
relevant data are given below.
ROUTS
TRUCKS A B C D
I 5.2 5.5 5 5.6
II 4.9 5.1 5.2 5.4
III 4.8 5.2 4.9 5.3
IV 5 5 5.2 5.4
Distance to be covered 220 320 360 250
The table contains the Kms run per litre of diesel consumption by each of the trucks
when run is given in the four routes. Find out the assignment of trucks to routes in
order to reduce the consumption of diesel per day. If truck 4 is under repair, which of
the three routes should be operated for fuel economy.
34
I. Fill up the Blanks
1. In the assignment model problems, the number of jobs and the number of resources
should be….(Equal)
2. In the assignment model problems, one job can be assigned to….. (One person)
3. In the assignment model problems, one resource can be assigned to …. (One job)
4. In the assignment model problems, one of the assumptions is that each resource can do
any job, but with…. (Varying degree of efficiency)
5. In the assignment model problems, the optimal allocation of the resources to the jobs
should be done in such a way that the total effectiveness resulting from the allocation
is… (Minimum)
6. In an assignment problem, if the given effectiveness matrix is modified by adding (or
subtracting) a constant to (from) even element of a row (or column) of the matrix Cij 
then as assignment which minimizes the total effectiveness for the modified matrix,
also minimizes the total effectiveness for the original matrix. This is called the …
(Reduction theorem)
7. In an assignment problem, if the given effectiveness matrix is modified by ………….
a constant to (from) every element of a row (or column) of the matrix Cij  then an
assignment which minimizes the total effectiveness for the modified matrix also
minimize. the total effectiveness for the other matrix. (adding or subtracting)
8. In an assignment problem, if there is a single zero in a row. we make the assignment in
that zero position, and cancel any other zeroes…. (In the corresponding Column)
9. In an assignment problem, if there is a single zero in a column, we make the assignment
in that zero position, and cancel any other zeroes … (In the corresponding Row)
10. In an assignment problem, if all the zeroes in the matrix are either assigned or cancelled,
but there are some rows (or columns) left without an\ assignment, it means that the …
is not complete. (zero assignment)
11. In an assignment problem, if the zero assignment is not complete, then to improve the
solution we should cover all the zeroes by drawing the….. of horizontal or vertical lines
(Minimum number)
12. In an assignment problem, if the zero assignment is not complete, we identify the least
35
value element from among all the elements which are not covered by any line, and …
this element from all the uncovered elements. (subtract)
13. In an assignment problem, if the zero assignment is not complete, we identify the least
element from among all the elements which are not covered by any line, subtract this
element from all the uncovered elements, and add the same element to the …. (Element
at the intersection of lines)
14. In an assignment problem, if the number of jobs is not equal to the number of resources,
it means that the problem is…. (Unbalanced)
15. If an assignment problem has m number of jobs and n number of resources (m > n),
then we should add (m - n) number of resources with the corresponding elements in the
effectiveness matrix equal to…. (Zero)
16. In a travelling salesman problem, the optimal solution should satisfy the … route
condition. (Cyclic)
17. In a travelling salesman problem, the optimal solution is determined by using the …
algorithm. (Assignment)
18. In a travelling salesman problem, where the salesman has to visit five cities, if the
solution obtained as per the zero assignment reads as 1—>4; 2—>5; 4—>3; 3—>1;
5—>2, this solution cannot be taken as the optimal solution because it is… (Not
Cyclic).
19. The problem of determining the optimal sequence of jobs on a certain number of
machines, based on the time involved in changing the set-up of the machine to suit the
job to be processed on it, is solved similar to the…. (Travelling salesman problem)
20. In a travelling salesman problem, where the salesman has to visit five cities A, B, C, D,
and E, a feasible solution which reads as B-->C; E-->A; C-->E; D-->B;A-->D can be
treated as a the optimal solution? Yes/No. (Yes)
36
Multiple Choice Questions
1. In an assignment problem, if a row contains 3 zeroes, then

(a). We may assign in any one of those 3 zeroes and cancel the other two
(b). We should assign in the 1st zero position and cancel the other two
(c). We should assign in the last zero position and cancel the other two
(d). We should not assign in any of the 3 zero positions.
2. In the row operation in an assignment problem, if the least element in that row is, say
k, then
(a). We add k to all the elements in that row
(b). We subtract k from all the elements in that row
(c). We multiply by k all the elements in that row
(d). We divide by k all the elements in that row
3. In the column operation in an assignment problem, we subtract an element k from all
the elements of the column, where k is the
(a). Least element in the that column (b). Largest element in the that column
(c). Average of the element of that column (d). Negative element in that column
4. In a travelling sales man problem the optimal solution should be
(a). Strictly as per zero assignment (b). Of minimum total distance
(c). Feasible and cyclic (d). All the above
5. The problem of determining the optimum sequence of job on a certain number of
machines based on the time involved in changing the set-up of the suit the job to be
processed on it, is solved to
(a). Assignment problem (b). Sequencing Problem
(c). Travelling Salesman problem (d). Linear programming problem
6. In, an assignment problem, if all the zeroes are either assigned or cancelled, yet some
rows/ columns do not have any assignment, then to improve the solution, we should
(a). Make assignment in one of the appropriate zero positions in such rows/columns
which do not have assignment
(b). Draw minimum number of horizontal/vertical lines to cover all the cancelled zeroes
(c). Draw minimum number of horizontal/vertical lines to cover all the assigned zeroes
(d). None of the above
37
7. In the assignment model problems, the number of jobs and the number of resources
should be
(a). Always equal (b). Always not equal
(c). May be equal or not (d). Proportional
8. In the assignment model problems, one job should be assigned to
(a). One resource only
(b). More than one resource
(c). A maximum of two resources
(d). Any number of resources, but as per zero assignment only
9. In the assignment model problems, one resource should be assigned to
(a). Two jobs only (b). One job only
(c). Any number of jobs, but as per zero assignment only (d). More than one job
10. One of the assumptions in the assignment model problems is that any resource can do
any job
(a). With the same degree of efficiency (b). With similar efficiency
(c). And the efficiency does not matter (d). With varying degrees of efficiency
11. In the assignment model problems, the optimal allocation of the resources to the jobs
should be done in such a way that the total effectiveness resulting from the allocation
is
(a). Zero (b). Maximum (c). Minimum (d). Optimum
12. In an assignment problem, if the given effectiveness matrix is modified by adding (or
subtracting) a constant to (from) every element of a row (or column) of the matrix Cij 
, then an assignment which minimizes the total effectiveness for the modified matrix,
also minimizes the total effectiveness for the original matrix. This is called the
(a). Effectiveness theorem (b). Minimization theorem
(c). Optimization theorem (d). Reduction theorem
13. In an assignment problem, if there is a single zero in a row, we
(a). Should make assignment in that position, and cancel all other zeroes, if any, in
the corresponding column
(b). Should make assignment in that position, but should not cancel the other zeroes in
the corresponding column
38
(c). Should make assignment in that position, but should cancel only anyone zero in the
corresponding column
(d). Should not make assignment in that position
14. In an assignment problem, if there are more than one zero in a column,
(a). Assignment may be made in any of the zero positions
(b). Assignment should be made in the 1st zero position
(c). Assignment should be made in the last zero position
(d). Assignment should not be made in any of the zero positions
15. In an assignment problem, if all the zeroes in the matrix are either assigned or cancelled
b there are some rows (and/or columns) left without any assignment, it means that the
(a). Zero assignment is complete (b). Zero assignment is not complete
(c). Zero assignment is partially complete (d). Zero assignment is not possible
16. In an assignment problem, if the zero assignment is not complete, but there are some
zeroes left in the matrix without either assignment or cancellation, it indicates that
(a). The optimal solution exists, but it should be obtained by trial and error means
(b). A feasible solution is available, but it may not be optimal
(c). There is no feasible solution available
(d). There is no optimal solution available
17. In an assignment problem, if the zero assignment is not complete, we cover all the
zeroes with minimum number of horizontal/vertical lines, then identify the least value
element from among all the elements which are not covered by any line, and
(a). Add this element to all the uncovered elements
(b). Add this element to all the elements which are covered by any line
(c). Subtract this element from all the uncovered elements
(d). Subtract this element from all the elements which are covered by any line
18. In an assignment problem, if the zero assignment is not complete, we cover all the
zeroes with minimum number of horizontal/vertical lines, then identify the least value
element from among all the elements which are not covered by any line, and
(a). Add this element to all the uncovered elements
(b). Subtract this element from all the elements which are covered by any line
(c). Subtract this element from the elements at the intersection of the lines
(d). Add this element to the elements at the intersection of the lines
39
19. In an assignment problem, if the number of jobs is not equal to the number of resources,
it means that the problem is
(a). Not optimal (b). Not balanced (c). Not feasible (d). Not ideal
20. If an assignment problem has m number of resources and n number of jobs (n > m),
then we should add (n-m) number of jobs with the corresponding elements in the
effectiveness matrix equal to
(a). Infinity (b). The corresponding averages of the elements for the n jobs
(c). Zero (d). None of the above
21. In a travelling salesman problem, the optimal solution is determined by using the
(a). Johnson’s algorithm (b). Simplex algorithm
(c). Transportation algorithm (d). Assignment algorithm
22. In a travelling salesman problem, where the salesman has to visit five cities, if the
solution obtained as per the zero assignment reads as 1-->4; 2-->5; 4-->3; 3-->1; 5-->2,
this solution is
(a). Feasible, but not optimal (b). Not feasible, but optimal
(c). Not feasible, and not optimal (d). Not feasible, hence not optimal
23. The problem of determining the optimal sequence of jobs on a certain number of
machines, based on the time involved in changing the set-up of the machine to suit the
job to be processed on it, is solved similar to
(a). Travelling salesman problem (b). Replacement problem
(c). Sequencing problem (d). Product mix problem
24. In a travelling salesman problem, where the salesman has to visit four cities A, B, C,
and D, a solution which is obtained strictly as per zero assignment, and which reads as
B-->D; C-->A; D-->C; A-->D is considered as
(a). Feasible and optimal (b). Feasible, and may be optimal
(c). Feasible, but not optimal (d). Not feasible, hence not optimal
25. In a travelling salesman problem, the condition for the feasibility of the solution is that
(a). The salesman should visit all the cities at least once
(b). The salesman should move from one city to another without any break
(c). The salesman should not return to the starting city without visiting all the
other cities at least once
(d). The salesman should visit the cities according to the priority given to the cities
40
Reference:
1. Operations Research by S.D. Sharma, Kedar Nath and Ram Nath & Co publishers,
Meerut, India, 2003.
2. Operations Research by Thata, Parsons publishers, India, 2003.
3. Principles of operations Research, 2nd ed., Harvey M. Wagner, Prentice-hall of India
Private Limited, New Delhi-110001, India, 1978.
4. Operations Research by P. Rama Murthy, New age international (P) limited, India,
2007.
5. Introduction to Operations Research by Juraj Stacho, Columbia University, New
York, UAS, 2014
6. https://en.wikipedia.org/wiki/Operations_research
7. http://ecoursesonline.iasri.res.in/
8. https://examupdates.in/operation-research-notes/
9. Introductions to Operations Research: Theory and applications by Halidi Lyeme and
Mohamed Seleman, Lambert academic Publishing, Germany, 2012.
10. Unpublished book “Quantitative Techniques for Managers”
11. https://en.wikipedia.org/wiki/Operations_research
12. https://www.pitt.edu/~jrclass/or/or-intro.html
13. https://www.britannica.com/topic/operations-research/History
14. Operations Research by Dr.A.S.C. Kumar, Yes Dee Publishing Pvt Ltd, 2015
15. https://study.com/academy/practice/quiz-worksheet-the-hungarian-algorithm-for-
assignment-problems.html
41

Unit.3 Assignment Problem (By Dr. K.srinivas)

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Unit.3 Assignment Problem (By Dr. K.srinivas)

Uploaded by

Copyright:

Available Formats

OPERATIONS RESEARCH UNIT-III STUDY MATERIAL

Title of the Paper : OPERATIONS RESEARCH (OR)

The objective of Assignment Problem is to minimize the cost or time of completion of

Definition of Assignment Problem:

P1 C11 C12 … C1 j … C1n

Mathematical Formulation of Assignment Problem:

where X ij denotes the j th job to be assigned to the i th person. An assignment problem

could thus be solved by Simplex Method.

MinimumZ = 7 x11 + 8 x12 + 6 x13

x11 + x12 + x13 = 1

x11 + x21 + x31 = 1

1, if the i th person is assigned to jth job

Number Assignment Total Cost

It states that in an assignment problem, if we add or subtract a constant to every element

1. Maximization method: If the assignment problem involves maximization, convert the

Similarity of Assignment Problem to Transportation Problem

The assignment problem is a particular case of transportation problem in which a

An assignment problem is a completely degenerate form of a transportation problem.

Solution of Assignment Problem

The assignment problem can be solved by the following four methods:

a) Complete enumeration method

This can be solved as a linear programming problem as discussed in

As assignment is a special case of transportation problem, it can also be solved using

Hungarian assignment method

The Hungarian method of assignment provides us with an efficient means of finding

Example 1 (Simple Assignment method)

Now, we go to next row.

In the fourth row

Starts with first column.

Now, strike off the corresponding

VI Now we check the optimality condition

Optimum assignments are A-I, B-III, C -II and D-IV

Example 2 (Hungarian Method)

VII Now, we get “modified cost matrix”.

Optimum assignments are A-V, B-III, C -II, D-I and E-IV

B 31-31 31-27 31-30 31-14 31-16

Then, we get new modified matrix called Maximized matrix as

Optimum assignments are A-P, B-Q, C -T, D-S and E-R

Then, we get a modified matrix called balanced effectiveness matrix.

Optimal assignment Time (in hours)

Optimum assignments are 1-E, 2-A, 3-B, 4-D and 5-C

Optimum assignments are A-I, B-III, C-II, D-IV and E-V

1. Solve the following assignment problem.

2. Find the maximum profit for the following assignment problem.

3. Write the mathematical form of assignment problem

8. A marketing manager has 5 salesmen A, B, C, D, and E, and 5 sales districts.

How should the salesman be allocated to appropriate counters so as to minimize the

Determine optimal schedule with time.

The manager wants to use assignment technique to solve the problem.

1. In an assignment problem, if a row contains 3 zeroes, then

You might also like