Operations Research

George, Andwilile A (Ph.D.)

College of Business Education (CBE)

Email address: [Link]@[Link]
or andwilile@[Link]
Office No: F43

December 6, 2024

George, Andwilile A (Ph.D.) (CBE) Lecturer (Maths) December 6, 2024 1 / 10

Topic Four: Assignment Model
In earlier discussion in chapter 1 and 2, we have dealt with two types of
linear programming problems, i.e. general linear programming and
Transportation model. We have seen that though we can use simplex
method for solving transportation model, we go for transportation
algorithm for simplicity.
We have also discussed that how a general linear programming model
differ from transportation model and similarities between them. Now we
have another model comes under the class of linear programming model,
which looks alike with transportation model with an objective function of
minimizing the time or cost of manufacturing the products by allocating
one job to one machine or one machine to one job or one destination to
one origin or one origin to one destination only. This type of problem is
given the name ASSIGNMENT MODEL. Basically assignment model is a
minimization model. If we want to maximize the objective function, then
there are two methods. One is to subtract all the elements of the matrix
from the highest element in the matrix or to multiply the entire matrix by
−1 and continue with the procedure.
George, Andwilile A (Ph.D.) (CBE) Lecturer (Maths) December 6, 2024 2 / 10
For solving the assignment problem we use Assignment technique or
Hungarian method or Flood’s technique. All are one and the same. Above,
it is mentioned that one origin is to be assigned to one destination. This
feature implies the existence of two specific characteristics in linear
programming problems, which when present, give rise to an assignment
problem. The first one being the pay of matrix for a given problem is a
square matrix and the second is the optimum solution (or any solution
with given constraints) for the problem is such that there can be one and
only one assignment in a given row or column of the given payoff matrix.
The transportation model is a special case of linear programming model
(Resource allocation model) and assignment problem is a special case of
transportation model, therefore it is also a special case of linear
programming model.
Now let us see what are the similarities and differences between
Transportation problem and Assignment Problem.
Similarities
1. Both are special types of linear programming problems.
2. Both have objective function, structural constraints, and non-negativity
constraints.
George, Andwilile A (Ph.D.) (CBE) Lecturer (Maths) December 6, 2024 3 / 10
And the relationship between variables and constraints are linear.
3. The coefficients of variables in the solution will be either 1 or zero in
both cases.
4. Both are basically minimization problems. For converting them into
maximization problem same procedure is used.
Differences
1. Transportation problem may have rectangular matrix or square matrix.
Assignment problem the matrix of the problem must be a square matrix.
2. In transportation the rows and columns may have any number of
allocations depending on the rim conditions. In Assignment the rows and
columns must have one to one allocation. Because of this property, the
matrix must be a square matrix
3. In transportation the basic feasible solution is obtained by northwest
corner method or matrix minimum method or VAM. In Assignment the
basic feasible solution is obtained by Hungarian method or Flood’s
technique or by Assignment algorithm.
4. In transportation the optimality test is given by stepping stone method
or by MODI method. In Assignment the Optimality test is given by
drawing minimum number of horizontal and vertical lines to cover all
George, Andwilile A (Ph.D.) (CBE) Lecturer (Maths) December 6, 2024 4 / 10
the zeros in the matrix.
Solving Assignment model by Hungarian Method
1. Deduct the smallest element in each row from the other elements of the
row. The matrix thus got is known as Row opportunity cost matrix
(ROCM).
2. Deduct the smallest element in each column from other elements of the
column. The matrix thus got is known as Column opportunity cost matrix
(COCM).
3. Once we get the total opportunity cost matrix, cover all the zeros by
MINIMUM NUMBER OF HORIZONTAL AND VERTICAL LINES. (First
cover row or column, which is having maximum number of zeros and then
next row or column having next highest number of zeros and so on until
all zeros are covered. Remember, only horizontal and vertical lines are to
be drawn.
4. If the lines thus drawn are equal to the number of rows or columns
(because of square matrix), we can make assignment. If lines drawn are
not equal to the number of rows or columns go to step 5.
5. To make assignment: Search for a single zero either row wise or column
wise. If you start row wise, proceed row by row in search of single zero.
George, Andwilile A (Ph.D.) (CBE) Lecturer (Maths) December 6, 2024 5 / 10
Once you find a single zero; assign that cell by enclosing the element of
the cell by a [Link] all the rows are over, then start column wise and
once you find single zero assign that cell and enclose the element of the
one cell in a square. Once the assignment is made, then all the zeros in
the row and column corresponding to the assigned cell should be
cancelled. Continue this procedure until all assignments are made. Some
times we may not find single zero and find more than one zero in a row or
column. It indicates, that the problem has an alternate solution. We can
write alternate solutions. (The situation is known as a TIE in assignment
problem).
6. If the lines drawn are less than the number of rows or columns, then we
cannot make assignment. Hence the following procedure is to be followed:
The cells covered by the lines are known as Covered cells. The cells, which
are not covered by lines, are known as uncovered cells. The cells at the
intersection of horizontal line and vertical lines are known as Crossed cells.

George, Andwilile A (Ph.D.) (CBE) Lecturer (Maths) December 6, 2024 6 / 10

Example 1
There are 3 jobs A, B, and C and three machines X , Y , and Z . All the
jobs can be processed on all machines. The time required for processing
job on a machine is given below in the form of matrix. Make allocation to
minimize the total processing time.

Machines
Jobs X Y Z
A 11 16 21
B 20 13 17
C 13 15 12

Example 2
There are 5 jobs namely, A, B, C , D, and E . These are to be assigned to 5
machines P, Q, R, S and T to minimize the cost of production. The cost
matrix is given below. Assign the jobs to machine on one to one basis.

George, Andwilile A (Ph.D.) (CBE) Lecturer (Maths) December 6, 2024 7 / 10

 Jobs
Machines A B C D E
P 8 7 4 11 6
Q 10 5 5 13 7
R 6 9 8 7 12
S 6 7 2 3 2
T 7 8 8 10 5

Example 3
Four different jobs are to be done on four machines, one job on each
machine, as set up costs and times are too high to permit a job being
worked on more than one machine. The matrix given below gives the
times of producing jobs on different machines. Assign the jobs to machine
so that total time of production is minimized.

George, Andwilile A (Ph.D.) (CBE) Lecturer (Maths) December 6, 2024 8 / 10

 Jobs
Machines A B C D
P 10 14 22 12
Q 16 10 18 12
R 8 14 20 14
S 20 8 16 6
Example 4
A company has five jobs V , W , X , Y and Z and five machines A, B, C , D
and E . The given matrix shows the return in Rs. of assigning a job to a
machine. Assign the jobs to machines so as to maximize the total returns.
Jobs
Machines A B C D E
V 5 11 10 12 4
W 2 4 6 3 5
X 3 12 5 14 6
Y 6 14 4 11 7
Z 7 9 8 12 5
George, Andwilile A (Ph.D.) (CBE) Lecturer (Maths) December 6, 2024 9 / 10
Solution
As the objective function is to maximize the returns, we have to convert
the given problem into minimization problem.
Method 1. Here highest element in the matrix is 14, hence subtract all the
element from 14 and write therelative costs. (Transformed matrix).
Example 5
A manager has 4 jobs on hand to be assigned to 3 of his clerical staff.
Clerical staff differs in efficiency. The efficiency is a measure of time taken
by them to do various jobs. The manager wants to assign the duty to his
staff, so that the total time taken by the staff should be minimum. The
matrix given below shows the time taken by each person to do a particular
job. Help the manager in assigning the jobs to the personnel.
Clerical staff
Jobs X Y Z
A 10 27 16
B 14 28 7
C 36 21 16
D 19 31 21
George, Andwilile A (Ph.D.) (CBE) Lecturer (Maths) December 6, 2024 10 / 10