ASSIGNMENT PROBLEM

Zemen Post graduate College

MBA Program: REGULAR
MAY,2022

1
 ASSIGNMENT PROBLEM
he Assignment Problem (AP) refers to the class of LPPs that involves dete
most efficient assignment of people to projects, salespeople to ter
tracts to bidders, jobs to machines, and so on.

The objective is to assign a number of resources to an equal number of ac

as to minimize total costs or total time or maximize total profit of allocatio

 The problem of assignment arises because available resources such as m

machines, etc have varying degrees of efficiency for performing different
activities such as job. Therefore, cost, profit, or time of performing the diff
activities is different.
2
 ASSUMPTIONS
The number of origins is equal to the number of destinations. Viz. m = n.
Hence assignment is made on the basis of 1:1.
Following are the assumptions:
 Number of jobs is equal to the number of machines or persons.
 Each man or machine is loaded with one and only one job.
 Each man or machine is independently capable of handling any of the job being presen
ading criteria must be clearly specified such as “minimizing operating time” or “maxim
fit”, or “minimizing production cost” or “minimizing throughout (production cyc

Remark:
The AP is considered as a special form of TP in which the supply at each source
emand at each destination are always one unit.
 Since the supply and demand are always equal to one unit in each row and co
there is no need to write them in the assignment table.
3
 Example 1
Service Costs of Different Team Assignment ($ in Thousand

Supply
Z1 Z2 Z3 Z1 Z2 Z3

S1 S1 20 15 31 1
20 15 31
S2 17 16 33 1
S2 S3 1
17 16 33 18 19 27
Demand
S3 1 1 1
18 19 27
4
The above problem can be presented as a LPP as follo

Min Z = 20x11 + 15x12 + 31x13 + 17x21 + 16x22 + 33x23 + 18x31 + 19x32 + 27

Subject to the constraints

A. Supply constraints:

x11 + x12 + x13 =1 S1 constraint

x21 + x22 + x23 =1 S2 constraint

x31 + x32 + x33 = 1 S3 supply constraint

5
 B. Demand constraints
x11 + x21 + x31 = 1 Z1 constraint
x12 + x22 + x32 = 1 Z2 constraint
x13 + x23 + x33 = 1 Z3 constraint
xij either 0 or 1 for all i , j

Since all xij can be either 0 or 1, there will be one assignment in each sup
constraint and one assignment in each demand constraint.
Assignment problems can be balanced or not.
In a balanced case, the number of objects to be assigned equals the numb
objects to which they are assigned.
Unbalanced problem can be balanced by adding a dummy (dummies) with
cost coefficients.
6
 Methods of Solving Assignment Problems

An assignment problem can be solved by the following meth

1. Enumeration method

2. Simplex method

3. Transportation method

4. Hungarian method
7
 HUNGARIAN METHOD /FOOD’S TECHNIQUE
he Hungarian Method (developed by Hungarian mathematician D. Konig) of ass
vides us with efficient method of finding the optimal solution without having to m
ect comparison of every solution.
works on the principle of reducing the given cost matrix (the principle of
uction) to a matrix of opportunity costs, which means that by subtracting an
ropriate numbers in the cost table or matrix ,we can reduce the problem to a ma
opportunity costs.
Opportunity costs show the relative penalties associated with assigning resourc
ctivity 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 eac
nd column, then it will be possible to make optimal assignments.

8
 Steps in Solving Assignment Problems:
Step 1: Develop the cost table from the given problem
If the number of rows does not equal the number of columns and vice versa, th
ummy row or dummy column must be added. The assignment costs for dummy c
ways zero.
Step 2: Find the opportunity cost table
e transformation of the cost matrix to what is termed as a total-opportunity cost
nvolves two operations:
A. Perform row operation
cate the smallest element in each row of the given cost table and then subtract
given cost table and then subtract that from each element of that row
B. Perform column operation
he reduced matrix obtained from 2(A), locate the smallest element in each colum
n subtract that from each element of that column. Notice that each row and colu
have at least one zero value. 9
tep 3: Test for an Optimal Assignm
est the table resulting from step 2 to see whether an optimal assignme
be made. The procedure is:
A. Draw the minimum number of Horizontal and /or Vertical lines necess
over all zeros costs.
Draw the lines by trial and error but always try to cover two or more z
with one line.
B. Count the number of the lines
If the number of lines equals either the number of rows or columns in
table, an optimal assignment can be made. If the number of lines is less
the number of rows or columns, an improvement is possible (we procee
step 4). 10
 Step 4: Improve the present opportunity cost table (matrix)
This is done by the following operations:
A. Find the smallest entry in the uncovered cells (cells with no lines through them) and subt
from all entries in the uncovered cells.
B. Add the same smallest entry to those cells in which the lines intersect (cells with two lines
C. Cells with one line through them are transferred (i.e. unchanged to the improved tabl
n those problems where the first improvement does not yield an optimal solution, we k
mproving the solution by repeating step 4 until an optimal solution is achieved.
Step 5: Make an optimal assignment
An optimal assignment should be made to cells with a zero entry, maintaining the one-to
requirement.
If more than one optimal solution exists, a trial-and-error approach can be used to find
possible combination assignments in the zero cells.
Note that multiple optimal solutions are possible.
11
 Example 2
Assign the programmers to the programs in such a way that the total computer t
minimum.
Programs
(Estimated time in minute)
A B C

1 120 100 80

2 80 90 110

3 110 140 120

12
 SOLUTION:
Perform row reduction
The minimum time element in row 1, 2, and 3 is 80, 80, and 110 respectively. Su
hose elements from all elements in their respective row. The reduced time matr
Table: After row reduction

A B C

-80 1 40 20 0

-80 2 0 10 30

-110 3 0 30 10
13
 Column reduction
Since column B has no one ‘0’, perform also column reduction. The minimum time elem
in columns A, B, and C is 0, 10, and 0 respectively. Subtract these elements from all
elements in their respective column to get the reduced time matrix.
Table: After column reduction

A B C

1 40 10 0

2 0 0 30

3 0 20 10

14
 Test for an optimal assignment
the minimum number of horizontal and /or vertical lines nec
all zero times (costs).
Table: Test of optimal assignment

A B C

1 40 10 0

2 0 0 30

3 0 20 10
15
ount the number of lines: If the number of lines is equal to the number of rows/co
e optimal solution is obtained. Thus, proceed directly to the next step.
ake an optimal assignment: An optimal assignment should be made to cells with
ntry, maintaining the one-to-one requirement.
Table: optimal assignment

A B C

1 40 10 0

2 0 0 30

3 0 20 10

16
 Note:
assignment, start with row/column having one zero and cancel the alte
pattern of assignment among programmers and programs with their respective
minute) is given below:

Programmer Program Time (in minutes)

1 C 80

2 B 90

3 A 110

Total time = 280 minutes

17
 Example 3
Machineco has four machines and four jobs to be completed. Each machine mu
ssigned to complete one job. The time required to set up each machine for com
each job is shown in Table below. Machineco wants to minimize the total setup
needed to complete the four jobs. Use linear programming to solve this proble

18
We illustrate the Hungarian method by solving the Machineco pro

19
Step 3 The smallest uncovered element equals 1, so we now subtract 1 from each
uncovered element in the reduced cost matrix and add 1 to each twice-covered
element.

20
Machine Job Time (Hour)

1 2 5

2 4 5

3 3 3

4 1 2

Total time 15 Hours

21
cise 1: How should the jobs be allocated, one per emp
minimize the total person-hours?
Employees
I II III IV V

A 10 5 13 15 16
B 3 9 18 13 6
C 10 7 2 2 2

D 7 11 9 7 12

7 9 10 4 12
E
22
SPECIAL CASES IN THE ASSIGNMENT PROBL
A. Multiple Optimal Solutions
le making an assignment in the reduced assignment matrix, it is possib
e two or more ways to strike off a number of zeros. Such situation indic
tiple optimal solutions with the same optimal value of objective fu
In such cases the more suitable solution may be considered by the
decision-
maker.
multiple optimal solutions, no unique 0 will exist at some point, res

re than one choice for assignment solution.

and hence, more than one optimal
It should be noted that all optimal solutions will yield the same value o
objective function.
23
Example 4: Given this final assignment table, ide
two optimal solutions.

Machine
(Estimated time in minute)
1 2 3

4 0 0
A

Job B 0 3 2

1 0 0
C
24
 on: The first assignment must be b-1, because b-1 is the only 0 that a
row or column. Having made that assignment, there are two choices for
ning two rows, and two choices for the remaining two columns. This resu
e solutions, as shown below:

1 2 3 1 2 3

A 4 A 4
0 0 0 0

B 3 2 B 3 2
0 0

C 1 0 0 C 1
0 0

25
 Exercise 2:
A. Determine the minimum-cost assignment for problem below.
B. What is the total cost for the optimal assignment?
here an alternative optimal assignment? What is it? Calculate the total c
ate optimal assignment.
Machine
(Estimated cost in $)
A B C D
1 70 80 75 64

2 55 52 58 54

3 58 56 64 68

4 62 60 67 70
26
 Maximization Case in Assignment Problem
here may arise situations when the assignment problem calls for maximiza
profit, revenue, etc as the objective function.

Such problem may be solved by converting the given max. problem into a
problem by the following procedure:

I. Find the largest profit coefficient in the entire.

Subtract each entry in the original table from the largest profit coe
transformed assignment problem so obtained can be solved by using the
garian method.
27
 5: A company has four territories open, and four salesperson available for an as
are not equally rich in their sales potential. Based on the past performance, the
ws the annual sales (in $) that can be generated by each salesperson in each ter
ssignment and the maximum expected total sales.

I II III IV

A 42 35 28 21

B 30 25 20 15

C 30 25 20 15

D 24 20 16 12
28
Solution: Convert maximization problem into minimization problem
subtracting all elements from the highest element (i.e., 42).

Thus, the equivalent cost table is: After row and column operations:

I II III IV I II III IV

0 A
7 14 21 A 0 3 6 9

B B 0 1 2 3
12 17 22 27

C C 0 1 2 3
12 17 22 27

D D 0 0 0 0
18 22 26 30
29
after improvement of the table, the optimal assig

I II III IV

A 0 2 4 7

B 0 0 0 1

C 0 0 0 1

D 2 1 0 0

30
e pattern of two alternative optimal assignments a
ories and salesperson with respective sale is give

Assignment set I Assignment set II

__________________________________ _________________________________
_
Salesman Territory Sales($) Salesman Territory Sales($)
A I 42 A I 42
B III 20 B II 25
C II 25 C III 20
D IV 12 D IV 12
Total = $99 Total = $99 31
cise 4: Five salespersons are to be assigned to five territories. Based o
rmance, the following table shows the annual salesperson in each territ
Find the optional assignment.
T1 T2 T3 T4 T5

S1 26 14 10 12 9
S2 31 27 30 14 16
S3 15 18 16 25 30
S4 17 12 21 30 25
S5 20 19 25 16 10
32
. UNBALANCED ASSIGNMENT PROB
The Hungarian method of assignment requires that the number of
columns
and rows in the assignment matrix must be equal.
However, when the given cost matrix is not a square matrix, the
assignment
problem
In such is called
cases an unbalanced
a dummy row(s) or problem
column(s). are added in the matrix
(with
zeros as the cost elements ) to make it a square matrix.
After making the given cost matrix a square matrix, the Hungarian
method
may be used to solve the problem.
33
 Example6
Printing Press, a publisher headquartered in Addis Ababa, wants to assign three recently hired
uates, Marta, Bakcha and Hirut to regional sales districts in Axum, Bahir Dar, and Dire Daw
is also opening in Gambela and would send one of the three, if it were more economical than a
m, Bahir Dar and Dire Dawa. It will cost Br. 1,000 to relocate Marta to Gambela, Br. 800 to r
lcha there, and Br. 1,500 to move Hirut. What is the optimal assignment of personnel to offices

Office
Hire Axum Bahir Dare Dire Dawa Gambela

Marta Br.800 Br 1,100 Br 1,200 Br 1,000

Bekcha 500 Br 1,600 Br 1,300 Br 800

Hirut 500 Br 1,000 Br 2,300 Br 1,500

34
 Solution:
To balance the problem, we add a
dummy row (person) with a zero Optimal (final) Assignmen
relocation cost to each city.

C1 C2 C3 C4 C1 C2 C3 C4
(Gam
bela) P1 100 0 100 0
800 P1
1,100 1,200 1,000
P2 0 700 400 0
P2 500 1,600 1,300 800
P3 0 100 1400 700
P3 500 1,000 2,300 1,500
Dummy400 0 0 100
Dummy 0 0 0 0
35
Thus, an optimal assignment can be made at zero cells (squa
Cost = br. (0 + 500 + 800 + 1,100) = Br. 2,400
Therefore, sending an individual to Dire Dawa is not economi

Person City

Dummy (No person) Dire Dawa

Hirut Axum
Bekcha Gambela

Marta Bahir Dar

36
 D. RESTRICTIONS ON ASSIGNMENTS
In certain instances, it may happen that a particular match or pairing may be e
undesirable or otherwise unacceptable.
or example, an employee may not have the skills necessary to perform a particu
r a machine may not be equipped to handle a particular operation. In such cases
ost of performing that particular activity by a particular resource is considered to
ery large (written as M or  ) so as to prohibit the entry of this pair of employee
nto the final solution.
When such a restriction is present, a letter (M) is often placed in the table in the p
hat would represent a paring. Analysis is performed as usual except the M is igno
hroughout the analysis.
hat is, M is not used in any reductions, nor is any value added to it or subtracted
uring the course of the analysis.
37
 EXERCISE 5
n the modification of a plant layout of a factory four new machines M1, M2, M3 a
re to be installed in a machine shop. There are five vacant places A, B, C, D an
vailable.
Because of limited space, machine M2 can not be placed at C and M3 cannot be
at A. the cost of placing of machine at place i (in $) is shown below.

A B C D E
M1 9 11 15 10 11
Machine M2 12 9 - 10 9
M3 - 11 14 11 7
M4 14 8 12 7 8
Find an optimal assignment schedule
38