I CHAPTER 7 I

ASSIGNMENT MODEL

7.1 INTRODUCTION:

. The simplex and transportation models used for solving linear programmmg
problems (LPP) usually involve tedious calculations and hence consume a lot of
time.

. In some special cases, the LPP can be solved using special techniques. One of such
special techniques is the assignment model.

. The assignment problem is a special type of allocation problem. That is, each
resource should be allocated (assigned) to only one job and each job requires only
on resource.

. Hence, the assignment problem is defined as follows..If there are n facilities and n
jobs with details related to the effectiveness of each facility for each job known,
the problem is to assign one facility to one and only one job so that the given
measure of effectiveness is optimised.

. Some applications of assignment model are listed:

Allocation of men to machines.

Allocation of managers to offices

Allocation of planes to commercial air line flights

Allocation of jobs to persons.

. Assignment method is also called as Hangarian method or flood technique.

 -

7.2 OPEARA nONS RESEARCH

7.2 REPRESENT ATION OF ASSIGNMENT MODELS:

. Let Ci; ~ cost of assigning ithjob to lh machine.

ai~ supply capacity of source (job)

ai =I for all values of i.

bi ~ Demand of the destination (machines)

b.J = I for all values of j.

. Condition to be satisfied in an assignment model.

"Number of rows (m) should be equal to number of columns (n)"

If m < n Add dummy rows accordingly so that m = n. The cell values are
take as zero.

If m > n ..... Add dummy columns accordingly so that m = n. The cell values are
take as zero.
. The assignment model is represented in a matrix form as follows:
MAcmNES
1 2 3 4 J n
1 CJI CJ2 CJ3 CI4
... Cln al=l
2 C21 C22 023 C24
.... C2n a2 =1
JOBS 3 C31 C32 C33 C34
.... C3n a3 =1

4 C41 C42 C43 C44

.... C4n a4 =1

.... .... .... .... .... .... aj=l

m CmJ Cm2 Cm3 Cm4
.... Cmn am =1

bJ =1 b2 =1 b3 =1 b4 =1 b.=l
J bn =1
ASSIGNMENT MODEL 7.3

7.3 COMPARISION OF ASSIGNMENT & TRANSPORTATION MODELS.

. An assignment model is a complete degenerate form of a transportation model.
ASSIGNMENT
MODEL
. The numberof rows shouldbe equalto
the number of columns, that is, the
matrixshouldbe a squarematrix
. The demandand availabilityare always
equal. That is, why they are not given
in an assignmentmodel.
. More than one allocation IS not
permitted in a row or column. That is,
one source supplies one destination.
TRANSPORTATION
MODEL
. Number of rows need not be
equalt? thenumberof columns.
. The demandand supplyneed not
be equal.
. More than one allocation IS
permitted in a row or column.
That is, one source can supply to
more than one destination.

7.4 PROCEDURE TO SOLVE AN ASSIGNMENT PROBLEM:

Note: All assignment problems in this book will be solved using the minimisation
procedure.

NOTE: If a maximisation problem is given, it is converted to a minimisation problem by

using the following procedure.
. Select the highest element in the maximisation table.
. Subtract every element from this highest element to get the minimisation table.

STEP 1: Check whether the number of rows are equal to the number of columns in the
problem. If the number of rows are not equal to the number of columns, add a row or
column with cell entries taken as zero.

STEP 2: Now, if the given problem is a maximisation problem, convert it to a

minimisation problem.
 7.4 OPEARA TIONS RESEARCH

STEP 3: Perform row wise reduction. That is, select the minimum element In
the first row. Subtract this minimum element from the elements of the first row. Do this

for each and every row.

STEP 4: Perform column wise reduction. iliat is, select the minimum element in the first
column. Suhtract this minimum element from the elements of the first column. Do this for
each and every column.
Note: At this stage, it will be seen that each row and column will contain atleast one zero.
STEP 5: See row wise and allocate if there are single zeros. (Allocating is nothing but
putting a block D around the smgle zero). If an allocation is made seeing row wise,
cancel the column containing the allocated zero. Do this for each and every row, one by
one. When it is further not possible to allocate row wise, go to the next step.
STEP 6: See column wise and allocate if there are single zeros. If an allocation is made
seeing column wise, cancel the row containing the allocated zero. Do this for each and
every column, one by one. When it is further not possible to allocate column wise, see
whether all the zeros in the table have been either allocated or cancelled. If there are
some zeros which are not either cancelled or allocated, keep on applying step 5 and step 6
until all the zeros are either allocate or cancelled.
At this stage, check whether each row and each column has one and only one
allocation. If this condition is satisfied, problem is over. If not, go to step 7.
STEP 7: TO GET MORE ZEROS:

.Elements through which no cancelling line

Un covered elements =
[ passes
J

Elements through which a

Covered elements =
[ cancelling line passes single J

Elements through which two lines pass, one

Elements at inter section =
( perpendicular to each other. J
ASSIGNMENT MODEL 7.5

To get more zeros, follow the below procedure.

. Find the least among the uncovered elements.
. Add this least uncovered element to elements which lie at intersections.

. Subtract this least uncovered element from uncovered elements.

..' Retain covered elements as they are.

STEP 8: After step 7, go on applying step 5, step 6 and step 7 until the problem is over,
'that is, until each row and each column contains one and only one allocation.

NOTE: COMPULSARY ALLOCATION: In certain situations, when we attempt to

allocate, there will be zeros in the table, but there will not be single zeros. In such
situations,-one of the zero is allocated compulsorily and the row and column contaming
that allocation is cancelled. Then the problem is dealt with as usual.

7. 5 PROBLEMS ON ASSIGNMENT MODEL

PROBLEM: There are 5 jobs and 5 machines. The associated cost of allocating a job
to the machines is given in the table.
MACHINES

Ml M2 M3 M4 M5

Jt 11 17 8 16 20

J2 9 7 12 6 15

JOBS J3 13 16 15 12 16

J4 21 24 17 28 26

J5 14 10 12 11 15

It is required to assign one job to each of the 5 machines. Determine the optimal
assignment of jobs so that the total cost to process all the jobs is minimised.
 7.6 OPEARA nONS RESEARCH

SOLUTION:

STEP 1: The number of rows and columns of the table should be equal. Since the number
of row and"columns are equal, we can proceed to step 2.

STEP 2: As the problem involves cost data, it is a minimisation problem and hence we
can proceed to step 3.

STEP 3: ROW WISE REDUCTION.

. Select the minimum element of the first row, which equals 8.

. Subtract this minimum element from each and every element of the first row we get
the row as (3,9,0,8, 12).
. Now select the minimum element of the second row, which equals 6.
. Subtract this minimum element from each and every element of the second row we
get the row as (3, 1,6,0, 9)
. Do this row wise reduction for each row, we get the table as shown.
MACHINES
Ml M2 M3 M4 M5
Jl 3 9 0 8 12
J2 I 3 1 6 0 9
JOBS J3 1 4 3 0 4
J4 4 7 0 11 9
J5 4 0 2 1 5

STEP 4.5.6: COLUMN WISE REDUCTION & ALLOCATING:

. Select the minimum element of the first column, which equals 1.
. Subtract this minimum element from each and every elements of the first column we
get the column as (2, 2, 0, 3, 3)
. Now select the minimum element of the second column, which equals o.
ASSIGNMENT MODEL 7.7

8
Subtract this minimum element fTomeach and every element of the second column
we get the column as (9, 1,4, 7, 0)
8
Do this column wise reduction for each column, we get the table as shown. Then
allocate (see procedure to solve assignment problems for steps 5 & 6).

M5

:11 8 I
Example of element at
inter section

J2 I 2 I I b 1m I 5 V Example of covered
JOBS I I I 1 I I I 1 -
.F
1 element
J
ILJ I I I I I I I I
Example of uncovered
J4 3 1 5 ...1 element

J5 3 1
LEAST

NOTE: ALLOCATING.

0ee row wise - Allocate if a single zero exi~ts - cancel the column containing the
allocated zero.

8? column wise - Allocate if a single zero exists - cancel the row containing the
allocated zero.

~en a compulsory allocation is made, cancel both the rowan? column containing
the allocatedzero. I

We see that in the (5 x 5) table, only 4 allocations are present (But there should be 5
allocations). Hence we have to adopt step 7 (the procedure to get more zeros).
 7.8 OPEARA nONS RESEARCH

STEP 7: GETTING MORE ZEROS:

. Least uncovered element in the previous table = I

. Add this element I to elements at intersections.

. Subtract this element I from uncovered elements.

. Retain covered elements as they are.

The following table is obtained and allocations (steps 5 & 6) are shown.

MACHINES
M1 M2 ~b M5
LEAST
J1 1 9 7

J2 I 1 1 4
JOBS

:4 l' 2 7 111 4

Again we see that in a (5 x 5) table, only 4 allocations are present (But there should be
5 - allocations). Hence we have to adopt step 7 (the procedure to get more zeros.
STEP 7 (APPLIED AGAIN): GETTING MORE ZEROS:
. Least uncovered element in the table = 1

. Add this element 1 to elements at intersections.

. Subtract this element from uncovered elements

. Retain covered elements as they are.

ASSIGNMENT MODEL 7.9

MACHINES
I
3

J1
rrl=;-rt-rt

J2
JOBS
J3
W--+--+---+--+-
J4 I 111
J

Now we see that in the (5 x 5) table, 5 allocations are present. That is, each row and each
column contains one and only one allocation. Hence the solution is optimal, that is, the
optimal assignment of assigning jobs to the machine has been obtained.

The optimal assignment and the corresponding minimum total cost is shown in table.

Assign To Cost
Job Machine (Rs)
J1 Ml 11
J2 M4 6
13 M5 16
J4 M3 17
J5 M2 10
Minimum total Cost Rs.60

PROBLEM: In a small machine shop, there are 4 operators avai~able to assign jobs
for the day. There are 5 jobs and the profit in rupees for each operator on each job is
represented in the table.
 -

7.10 OPEARA nONS RESEARCH

JOBS

Jl J2 J3 J4 J5
01 6.30 5.90 6.80
10.20 I 7.40
OPERATORS 02 8.00 10.10 9.00 8.50 7.30
03 8.70 8.80 9.10 7.60 6.50
04 7.30 8.30 6.40 7.70 8.00

. Detennine the optimal assignment.

. Which job is to be rejected?

SOLUTION:

STEP 1: The number of rows and columns in the table should be equal. In the given
problem, number of rows is 4 and number of columns is 5. Hence add one dummy row
(dummy operator - 05) with profit elements taken as zero. This has been shown in the
table. Also multiply each element by 10 to avoid working with decimal places.

JOBS

Jl J2 J3 J4 J5
01 63 59 68 102 74
HIGHEST
OPERATORS 02 80 101 90 85 73
03 87 88 91 76 65
04 73 83 64 77 80

Dummy -05 0 0 0 0 0

STEP 2: As the problem involves profit data, it is a maximisation problem.

To covert the given problem to a minimisation problem, subtract each and every
element of the table from the highest element (102) of the table. The following table is
I
obtained by doing so.
J
ASSIGNMENT MODEL 7.11

JOBS
Jl J2 J3 J4 J5
01 39 43 J4 e 28
OPERATORS 02 22 1 12 17 29
03 15 14 11 26 37
04 29 19 38 25 22
Dummy -05 102 102 102 102 102

STEP 3: Row wise reduction: After performing row wise reduction, the following
table is obtained.
JOBS
J1 J5
-
01 28

02 21 28
OPERATORS
03 26

04 10 3
LEAST

DUMMY-

STEP 4. 5 & 6: Column wise reduction and allocating: Since each column has a zero,
the result of column wise reduction will be the same table. Hence we can start allocating
which has been shown in the previous table itself.
After allocating we see that in the (5 x 5) table, only 4-allocations are present (but
there should be 5 allocations). Hence we have to adopt step 7 (the procedure to get more
zeros ).
STEP 7: Getting more zeros.
. Least uncovered element in the previous table =3
. Add this element 3 to elements at intersections.
 7. 12 OPEARA nONS RESEARCH

. Subtract this element 3 from uncovered elements

. Retain covered elements as they are.
The following table is obtained on which steps 5 & 6 are applied.

01
I

02
OPERATORS
03

04

DUMMY - 05

Now we see that in the (5 x 5) table, 5 allocations are present. That is each row and
each column contains one and only one allocation. Hence the solution is optimal.
The optimal assignment and the corresponding total profit is shown in table.
ASSIGN TO JOB PROFIT
OPERATOR (Rs)
01 J4 10.20
02 J2 10.10
03 13 9.10
04 . J5 8.00
DUMMY -05 JI 0.00
MAXIMUM TOTAL PROFIT Rs.37.4

Since job 1 is assigned to dummy operator 5, job 1 is to be rejected.

PROBLEM: An effectiveness matrix has been shown with zero elements in position.
Positive non-zero elements have been shown elsewhere. Show how to obtain maximal
assIgnment with procedure adopted?
ASSIGNMENT MODEL 7.13

KI 0 Kz K3
0 0 Ks K6 K7
0 Kg 0 K9 0
0 KIO 0 KII 0

K12 K13 0 0 0

SOLUTION: The entire procedure to solve an assignment problem has to be written

OPTIMAL ASSIGNMENT

KJ K4

* Compulsory
Ka K7 allocation

" -
8 9

10 K11
0*-

12 J

ALTERNATE OPTIMALASSIGNMENT

2 KJ

Compulsory
Ks * allocation

*
8 9

10 K11

12 J
 7.14 OPEARA TIONS RESEARCH

PROBLEM: A company has 4-plants W, X, Y & Z, each of which can produce

anyone of the four products P, Q, R & S. The production cost and sales revenue differ
from one plant to another. Determine the optimal combination of plant-product which will
maximise the profit of the company. Details of production cost and sales revenue have
been shown.

I
--
Sales revenue
in thousands of rupees
Production cost in
thousands of rupees
PRODUCT PRODUCT
P Q R S P Q R S
PLANTW 70 60 66 75 PLANTW 62 58 60 71
PLANT X 73 63 68 72 PLANTX 71 58 62 71
PLANT Y 55 58 60 62 PLANTY 50 51 53 59
PLANT Z 63 68 71 76 PLANTZ 61 66 65 70

SOLUTION:
The sales revenue and production cost have been given.
Hence, profit = (Sales revenue - Production cost).
For cell (WP), Profit = 70 - 62 = 8
For cell (WQ), Profit = 60 - 58 = 2 etc.,...
All profit values of cells are calculated and put in a table as shown.
PROFIT IN THOUSANDS OF RUPEES:
PRODUCT
P Q R S
w 8 2 6 4
HIGHEST
PLANT X 2 5 6 1
Y 5 7 7 3
z 2 2 6 6
ASSIGNMENT MODEL 7. 15

STEP 1: The number of row and columns in the table should be equal. Since the number
of rows and columns are equal, we can proceed to step 2.
STEP 2: As the problem involves profit data, it is a maximisation problem.
To covert the given problem to a minimisation problem, subtract each and every
element of the table from the highest element (8) of the table. The following table is
obtained by doing so.
PRODUCT
P Q R S
W 0 6 2 4
PLANT X 6 3 2 7
y 3 I I 5
Z 6 6 2 2

STEP 3: Row wise reduction: After performing row wise reduction, the following
table is obtained.

PRODUCT

PLANT x

STEP 4. 5 & 6: Column wise reduction and allocating: Since each column has a zero,
the result of column wise reduction will be the same table. Hence we can start allocating
which has been shown in the previous table itself.

We see that in the (4 x 4) table, 4 allocations are present. That is, each row and each
column contains one and only one allocation. Hence the solution is optimal.
 7.16 OPEARATIONS RESEARCH

The optimal assignment and the corresponding total profit is shown in table.

Plant - Product Profit (Rs.)

Combination
Plant Product
W P 8
X R 6
Y Q 7
Z S 6
Maximum total profit Rs.27
(in thousands)

PROPLEM: A company has built a new office building in order to centralise

administration functions. Six managers will be moved to the new office building. All the
offices of the managers are on the same floor. Other than exposure and view, all the
offices are alike in room area and facilities. As the company was interested in pleasing as
many managers as possible, the managers were asked to rank their preferences for offices
with 6 being the most desirable and 1 being the least desirable. The following ranking
were submitted by the managers. (

OFFICES

01 02 03 04 05 06
Ml 4 2 5 1 3 6
M2 2 3 5 1 4 6
Managers M3 3. 5 6 2 1 4
M4 2 4 6 1 3 5
M5 5 2. 6 4 1 3
M6 2 6 3 5 1 4

Determine the assignment that will provide optimal satisfaction.

SOLUTION:

STEP 1: The number of rows and columns in the table should be equal. As the number of
rows are equal to the number of columns, we can proceed to step 2.
 '--------

ASSIGNMENT MODEL 7.17

STEP 2: Since optimal satisfaction is to be provided, it is a maximisation problem. To

convert the given maximisation problem to a minimisation problem, subtract each and
every element of the table from the highest element (6) of the table. The following table is
obtained by doing so.
OFFICES

01 02 03 04 05 06
Ml 2 4 1 5 3 0
M2 4 3 1 5 2 0
Managers M3 3 1 0 4 5 2
M4 4 2 0 5 3 1
M5 1 4 0 2 5 3 Ii.
M6 4 0 3 I 5 2

STEP 3: RQwwise reduction: Since each row has a zero, the result of row wise reduction
will be the same table.

STEP 4. 5. 6 : Columnwisereductionand allocating:

OFFICES
1 02 C3 04 (5 6

M1 4 4
I
M2 3 4
[
M3 1
.--
MANAGERS 3
'--

M4 2 4

M5 4 1
,
'
..
L.:.J

After allocating we see that in the (6 x 6) table, only 5 -allocations are present (but
there should be 6 allocations). Hence we have to adopt step 7 (the procedure to get more
zeros.)'
 7. 18 OPEARA nONS RESEARCH

STEP 7: Getting more zeros:

. Least uncovered element in the previous table = 1

. Add this element 1 to elements at intersections.

. Subtract this element 1 from uncovered elements.

. Retain covered elements as they are.

The following table is obtained on which step 5 & 6 are applied.

OFFICES
1 0

M1
It

M2

MANAGERS M3

M4

M5

M6

Now we see that in the (6x6) table, 6 allocations are present. That is each row and each
column contains one and only one allocation. Hence the solution is optimal. The optimal
assignment has been shown.
 ASSIGNMENT MODEL 7. 19

THE ASSIGNMENT THAT WILL PROVIDE OPTIMAL SATISFACTION:

Manager MI is assigned to office 06

~ Manager M2 is assigned to office 05

Manager M3 is assigned to office 02

Manager M4 is assigned to office 03

Manager M5 is assigned to office 01

Manager M6 is assigned to office 04 -

PROBLEM: A marketing agency has taken up the marketing of four products. The
agency plans to enter them in four markets such that once it has entered one product in a
market, another product will not be entered in the same market. How should the agency
enter the products in the markets so that the total expected amount is as great as possible.
Use the flood technique to solve the problem. Data related tq the probability of making in
the market is given in table.

Probability of making in the market

Product Market 1 Market 2 Market 3 Market 4
/

PI 0.50 0.40 0.30 0.90

P2 0.30 0.30 0.25 0.40
P3 0.25 0.20 0.00 0.30
P4 0.20 0.00 0.00 0.30
Amount Rs.2500 Rs.3750 Rs.I2,500 Rs.20,000

SOLUTION: As the probability of making in the market and the amount has been
given, the profit can be determined.

Profit = (Probability) . (Amount).