increase UI In ume needed Tor completing tne joOS.

Thus (hcre is an
Some Typical Examples
Example 1: :The captain of a cricket team has to allot five middle batting
positionsto,five batsmen. The average runs scored by cach batsman at these positions
lollows:
areas
Batsman Batting positions
III IV

P 40 40 35 25 50
Q 42 30 16 25 27
R 50 48 40 60 50
S 20 19 20 18 25
T 58 60 59 55 53
) Find the assignment of batsmen to positions, which would give the maximum
number of runs. MGS, Univ, Bikaner M.Com., (F) 2018)
() If another batsman U' with the following average runs in batting positions
as given below:
Batting position : I II II IV
Average runs : 45 52 38 50 49
is added to the team. Should he be included to play in the team? If so, who
will be replaced by him? (M.D.U. Ajmer 2012)
Solution : (i)) The given problem is a maximization assignment problem. Let us
lirst convert it into a minimization assignment problem by subtracting all the elements
ol the given matrix from the largest element of the matrix i.e. 60. The matrix then
reduces to:
Batsman Batting Positions
II III IV
P
20 20 25 35 10
18 30 44 35 33
R 10 12 20 10
S 40 41 40 42 35
2 1 5 7

TOW Îrom OW carry out row operation for allrows by subtracting least entry of cach
all entries of to get the table given on next page
5.28
Assignment Problems
Batting Positions
Batsman III IV
II V
15 25
10 10 17
P 26 15
12
20 10
10 12
R 0
6
5 1
2 0
TNow
perform column operation for all columns by subtracting the minimum
column :
cach column from all elements of that
clement of Batting Positions
Batsman IV
II III V
10 14 25 0
10
P
12 25 17 15
12 19 10
R 10
6 4
S 5

and vertical lines to cover all zeros i

The minimum number of horizontal above table will not give h
(=5), the
which is less than the order of the matrix
minimum uncovered element (=4)
Fro
optimal solution. We subtract the
elements lying on the intersection
uncovered elements and add this element to the
as under :
of two lines. The new matrix is given
Batting Positions
Batsman
II III IV
>
P
10 25
12 25 21 19
10
R 15

11
The assignments will be P-V,Q-I, R-IV, S-II and T-II
Total runs = 50 + 42 + 60 + 20 + 60 = 232.
problem
(i) By taking U as the sixth batsman we can solve the new assignment
after balancing it. The final assignment is given in the following table :
Batsman Batting Positions
V Dummy
II III IV
P 2 4 27 0
23 0
0 14 27 27
R 4 11
25 0
22 25 23 34
16
T 0 13 13
U 13 10
Assggmeu Problens
5.29
Assignment willbe:
P C
Bastman R
Battingposition V S T
IV
Runs
50 42 60 Dummy III
59
I
52
Hence batsman Ushould be included in the team at position II and he will
S. Total runs will bc 263.
replace batsman
Example 2: Five lathes are to be allotted to five operators (one
followingtable gives weckly output igures (in pieces): for cach). The

Operator Weckly Output (in Lathes)

L Ly LA L
P
20 22 27 32 36
19 23 29 34 40
23 28 35 39 34
R
21 24 31 37 42
T 24 28 31 36 41

Profit per piece is ? 25. Find the maximum profi: per week.
(R.U. M.BA., 2003; MBA (Exec.) 2018)
Solution : The given assignment problem is a maXimization problem. Let us convert
it into an
opportunity loss matrix by subtracting all the elements of the given table from
42.
the highest element of the table that is
Opportunity Loss Table
L L Lg
Operators
20 15 10
P 22
2
23 19 13
7 3
R 19 14
18 11
S 21
11 6
18 14
Subtract the
assignment procedure is now applied to above problem.
Ihe elements of that row.
nimum element of each row from all the
Loss Table
First Reduced Opportunity
L4 L;
Lg
Operators L 4
P 16 14 0
11
21 17 0
4 0
16 11
11
S 21 18
10
T
17 13 Subtract the minimum
the columns ofthe table also.
Repeat the above step with elements of that column.
element of each column from all the
5.30

Total Opportunity Loss Table Assignment Problemy

Operators
P 3
5 6 6
R 0

T 1 2 6

Since the minimum number of lines to cover all zeros is 3 which is

(order of the square matrix), the above matrix will not give the less
than S
Hence we try to increase the number of zeros. Subtract the least optimal soluion.
uncovered element
which is 1 from all uncovered elements and add it to all the elements
intersection of two lines. We get the following revised loss matrix : lying on the
3 4
5 6 5

6 6 4
1
Again the minimum number of lines covering ll the zeros is 3, the optimal
assignment can not be made at this stage. Repcating the above steps, once again we
get the following revised total opportunity loss matrix :
2
4 5 4

3
3
The minimum number of covering lines (4) is less than five,
can not be made. The revised matrix is optimal assignment
given below :
2
2 3 2
-
3 3 1
3
We see that covering hnes is again 4.
columns (5), therefore optimal assignment canwhich
not isbe lessmade.
thanNext
number
revisedof rows
matrixis
given below :
0
3 2
2

3 10
2 2
2
-4
AssgmentProblerns 5.31
Sincefive lines are ncccssary to coOver all the zeros, optimal assignment can be
made.The optimal assignment is showm in the following table :
2 2
3 1 2 1
3 10
3 2 2
3 4 3 3
is :
The assignment
Operator Lathe Weekly Output
P L4 20

Ls 40
R 35
S LA 37
T 28
Total Weekly Output = 160
Maximum Profit per week = 160 x E25 =4.000.
Example 3:Afirm produces four products. There are four operators who are
capable of producing any of these four products. The processing time
varies from
operatorto
operator. The firm records 8 hours aday and allows 30 minutes for lunch.
The processing
time in minutes and profit for cach of the products are given below :
Operators Products
A B D

15 10 6
1
10 6 6
2
25 15 15
3
10 10
4 15
5
Profit (7) per unit
Find the optimal assignment of products to operators.
(IGNOU M.C.A. Dec., 2000)
day = 8X60- 30 = 450
Solution : Total time available for production each per day can be
by an operator
minutes. Now number of units of products producedrespective processing times. The
oblained by dividing the available time per day by
resultant matrix is given below:
Products
Operators
C D
A B
45 75
1 30 50
50 75
2 45 75
30 50
3 18 30
45 45
4 30 50
4
Profit (7) per unit 8
 nAsedsigbymmatenrtix Problenm
5.32
can be
Now respcctive profitsfor cach combination oobtaiprofit
number of units of cach product by its per
follows :
Operators
<
A
unit profit. The

B
Products
C
multipkingthe
240 300 225
1
360 450 250
2
3 144 180 150 300
4 240 300 225 200
180
Now in order to change it into minimization problem subtract allthe
maximum profit. The relative loss matrix will be as follows : entries from
210 150 225 150
90 0 200 150
306 270 300 250
210 150 225 270
Applying Hungarian method the different tables will be as given below ;
60 75 4 25
90 200 150 34 150 150
56 20 50 0
60 0 75 120 4 25 120
The optimal assignment will be;
4 4 25 4 4 25
30- -146 146 30 146 146
24 0 24 0
21 116 21 116

The maximum profit willbe 300 +450+ 150 +240=7 1140

Example 4 : Five wor kers are available to work with the machines and the
respective costs (in ) associated with each worker-machine assignment is gven
below. A sixth machine is available to replace one of the existing machines anu
associated costs are also given below in the table :
M, M, Ms M6
M3 M4
9
W] 12 3 6 5
3
W2 4 11 5
5
W3 8 2 10
10
WA 7 8 12

Ws 5 4 6
AjpmentProblems
5.33
(a) Dcterminc whether the new machinc can be accepted.
(b) Detcrmine optimal assignment and associated saving in costs.
Solution: (a) Add.one dummy row to convert the given problem into a balanced
onC.Thisproblemcan now bcsolved by Hungarian mcthod as given in the following
able
:

Optimal Assignment
Machine/ M M, M3 Må M_ M, Worker Machine Cost
Works ()
0 4
W
0
Wi Ms 5
0
W2
1 10 W2 M6 3
6 6 3 1
W3
4 0
W3 M2 2
1 0 5 3
W4
2
WA M 6
4 0 1
Ws
0 5
Ws M1 5
1
W% W6 M3
Total 21
AIf the sixth machine is not assigned to any of the 5 workers then the problem
becomes balanced one. This problem can also be solved by the Hungarian Method.
The optimal assignment is shown in the following table :
Assignments
M M M, M4 Ms Worker Machine Cost ()
W 9 1 0 WË M_
7 1
W W2 MË 4
67 3
W3 6 0
W3 M2 2

W4 1 0 0 4
WA M3 8
4
Ws 1 3 Ws M4 4

Total 23
From the above two optimal assignments, we observe that the total cost of
assignment in the case of six machines is less than the five machines. Hence we accept
sixth machine. The associated saving in cost is 2 (i.e. ? 23 - 21).
Example 5: To stimulate interest and provide an atmosphere for intellectual
discussion, a finance faculty in a management school decides to hold special seminars on
four contemporary topics leasing, portolio management, private mutual funds, swaps
and options. Such seminars should be held once per week in the afternoons. However,
SCheduling these seminars (one for each topic and not more than one seminar per
aternoon) has to be done carcfully so that the number of students unable to attend is
Aept to a minimum., A careful study indicates that the number of students who cannot
aiend a particular seminar on a specific day is as given in the table on next page :
S34
Lcasing
Portfolio
Managemcnt
Private
Mutual
As ignmeSnwt aps Praonbdle
Monday
50
30
40
Funds
60
40
Opiona
20
40
Tuesday 20 30 30
60
Wednesday 30 20
30 20
Thursday 20
10 10
Friday 30
Find an optimal schedule of the seminars. Also find out the
students who will be missing at least one seminar. tootal number of
Solution : (a) This is an unbalanced minimization
We first of allbalance it by adding a dummy topic : assignment problem.
Leasing Portfolio Private Mutual
Swaps and
50
Management
40
Funds
60
Options Dummy
Monday 20
0
Tuesday 40 30 40 30
Wednesday 60 20 30 20
Thursday 30 30 20 30 0
Friday 10 20 10 30
Subtracting the minimum element of each column from all elements of that
column, we get the following matrix :
Leasing Portfolio Private Mutual Swaps and Dummy
Management Funds Options
Monday 40 20 50 0
Tuesday 30 10 30 10
Wednesday 50 20
Thursday 20 10 10 10
Friday
The minimum number of lines
the order of the square matrix (i.e. required
to cover all zeros is 4 which is less than
5), the above matrix will not give the
solution. Subtract the minimum uncovered element (= 10) optimal
elements and add it to the elements lving on the from all uncovered
following matrix : intersection of two lines, we get tne

Leasing Portfolio Private Mutual Swaps and Dummy

Monday 30
Management Funds Options
20 -40
Tuesday 20 10 20 10
Wednesday 40 10
Thursday- 10 -10 -10
Friday 10 20 10
AsignmentProblems
5.35
Sincethe minimum number of lines to cover all the
order of the matrix, the
above zerOs is 5 which is equal
the
givenbelow; matrix will give the optimal solution
which is
Leasing Portfolio Private Swaps and Dummy
Managcmcnt Mutual Options
Funds
30 20
Monday 40
Tuesday 20 10 0
20 10
Wednesday 40 0 10
10
Thursday 10
0 10
Friday 10
20 10
and the optimal schedule is
No. of Students
Monday Missing
Swaps and options 20
Tuesday No seminar
Wedncsday Portfolio management 20
Thursday : Pvt. mutual funds 20
Friday Leasing 10
70
Thus. the total number of students who will be missing at least one seminar = 70.
Example 6:The processing time (in minute) taken by 5operators in 5different
products are given below. The effective working hours in a day are 6.
Products

Operators 1 2 3 4 5

A 10 12 18 15
B 12 10 20 18 10
15 10
D 9 8 24 12 12
E 10 15 18 12 10

Profit per product are T4,2,3, 3and 4for products : 1, 2,3,4 and 5respectively.
Find allocation of operators to products so as to maximize profit.
(R.IU. B. Tech Sem. VIl2010)
Solution : First we obtain the number of units of different products that an
operator can process in 6 hours (effective workinghours) by using the formula :
Available time i.e. 6 hours or 360 minutes
Processing timc of an operator for a product
5.36 Assignment Problems
It is given in the following tablc :
No. of Units of Products
3 4
2
Operators 24
360 = 36 20 40
30
A
10 20
36 18 36
B 30 24 36
40 45
C 45 30
45 15 30
D 40 30
24 20 36
36
Now from the above table we obtain the profit matrix by multiplying number
per unit profit.
of units of a product by its respective Profit Matrix

Profits
4
1 2
Operators
30x2= 60 20x3 = 60 24x3= 72 40x4 = 160
A 36X4 = 144
72 54 60 144
B 120
80 72 108 180
180
90 45 90 120
D 160
48 60 90 144
144
entry of the above table from
To obtain opportunity loss matrix subtract each
the maximum entry of the table :
Opportunity Loss Matrix
36 120 120 108 20
108 126 120 36
60
0 100 108 72 0
20 90 135 90 60
36 132 120 90 36

The final assignmen is given in the following table :

16 28 10 28

24 24

0 28 18 12

2 27 12 42

6 30 0 6
 Problems
S.37
Optimal Assignment
Operator Product Profit
A
160
B 3
54
1
180
D 2
90
4
90
Total Profit
7574
Example 7:. An airlinc
that operates sevcn days a
week has the time
shownbelow.
Crcws must have a
minimum layover of 5 hours between flights. table
the
pairing
of flights that minimizes layover time
crcw will be away from home. For anyObtain
based at the city that results in smaller given
Aaiingsthe
also mention
the town where crew should be based. layover. For each
pir
Flight No. Delhi Mumbai
Depart. Arrive
701 7a.m. 8 a.m.
702 8 a.m. a.m.
703 1p.m. 2 p.m.
704 6p.m. 7 p.m.
Flight No. Mumbai Delhi
Depart. Arrive
301 8 a.m. 9 a.m.
302 9 a.m. 10a.m.
303 12 noon 1p.m.
304 5 p.m. 6 p.m,
[R.U. M.C.A. Sem. IV 2005]
Solution : Tables of layover times away from home when different flights are
paired are as given below :

Crews based at Delhi

301 302 303 304
701 24 25 28
702 23 24 27
703 18 19 22 27
704 13 14 17 22
Based at Mumbai
301 302 303 304
701 22 21 18 13
702 23 22 19 14
703 28 27 24 19
704
9 8 5 24
5.38

As a next step we combinc these two tables.

lesser layover time for cach pairing. In the following
Delhi. table Choosientngrithates As ibasegnment Prdem
basc at Mumbai otherwise thc base is marked
301 302
303
701 22* 21* 18*
702 23* 22* 19*
18 19 22
703
704 8*
19
Now solving this as gencral assignment problem we get the
cost matrix as folows : finad
701
301 302
0
303
0
op otuni y
702 2 2
6
703
704 1 0
26
Optimal assignment will be as given below :
701-302 Based at Mumbai 21 hours 701-303 Mumbai 18
702-304 Based at Delhi 8 hours 702-304 Delhi
703-301 Based at Delhi 18 hours 703-301 Delhi 18
704-302 Mumbai
704-303 Based at Mumbai 5 hours
52 hours Total 52 hours
Total Layover Time =
four salesmen availahle
Example 8: A company has four zones and potentials. It is estimabi
sales
assignment. The zones are not equally rich in their bring in the following annual
zone would
that a typical salesman operating in each
sales :
Zone C 84,000; Zone D 63,000. The fou
Zone A 1,26,000; Zone B 1,05,000; ability. It is estimated that working under
salesmen are also considered to differ in be proportionately as follows:
would
the same conditions their yearly sales
4
Salesman P:7; Q:5; R:5 and S: assignmen.
criterion is maximum expected total sales, find the optimal
If the proportions : 7+5+5+4=21. Te
of
Solution:Note that total sum given in the following table :
zones willbe as
proportional sale of four D
C
B
A
x 63,00
X 105,000 x 84,000 21
P
21
x1,26,000 21
5 X 63,000
5 x84,000 21
X 1,26,000 5y
21
1,05,000 21 5 x 63,000
21
5 X 1,26,000 X 1,05,000 X84,000 21
R 21 21
4 X 63000
21 21
4
4 x 84,000
sx126,000 x1,05,000 21
21 21
Assigment Problems 5.39

In ordertable
to avoid fractions we divide
will be as follows :
all the entries of the above table by 1000,
the modified
42 35 28 21
30 25 20 15
30 25 20 15
24 20 16 12

Converting maximizing problem into minimizing by subtracting all entries from 42.
7 14 21
12 17 22 27
12 17 22 27
18 22 26 30

Applying Hungarian method the different tables will be as given below :

II
7 14 21 3 6 9

0 5 10 15 0 2 3
0 10 15 1 2 3
12
Final Table or
Alternatively
III IV
0 2 4 7 2 4 7
0 1 0 1

0 0 1 0 1
1 2 1 0

P’A, Q’B, R>C, S>D P’A, Q+C, R>B, S>D.

Example 9:A solicitor's firm employs typists on hourly piece-rate basis for
their daily work. There are five typists and their charges and speeds are different.
According to an earlier understanding only one job is given to one typist and is paid
Tor a full hour even if he works for a fraction of an hour. Find the least cost allocation
for the following data :
Typist Rate per Hour No. of Pages Job No. of Pages
(Rs.) Typed/Hour
A 12 P 199
B 6 14 175
3 R 145
D 4 10 S 298
4 11 T 178

(Delhi Univ. M.B.A., 1998)

 5.40

Solution : The cost of assigning job Pto typist Aiis

No. of Pagcs in job P 199 17 hours
Assignment Problem
obtaincd as :
Pages Typed per Hour 12
Total cost at the rate of 5 per hour= 17 x 5=t85.
different combinations of typists and jobs can be obtaincd,
Similarly
The cost tableother wicosl t for
follows : be
P R S T

85 75 65 125 75
A
B 90 78 66 132 78
75 66 57 114 69
C
80 72 60 120 72
D
64 56 112 68
E 76
Applying Hungarian method the different tables for optimal assignment willbe
as given below:

2 4
0 60 10
20 10 4 10
12 6
24 12 0 66
57 12
18 2 4 4 2
60 12
20 12 2
0 56 12
20
IV

1 3 0
2 4 1
2 8
1 1 1
1
2
2

Optimal Programme
Cost (in )
T
Typist Job
P R 75
A T
1 2 3 66
A 2 R
B
1 66
B 4 Q
C
2 80
2
C D P
1 112
0 1
D E
3 TotalCost 399
3
3 0
E
Assignment Problems 5.41

Example 10 : A small airline company, owning five

seven days of a weck. Flight bctwccn thrcc citics P, O and Rplanes operatcs on all the
according to the schcdule
is given bclow. The layover cost pcr stop is
layover time. roughly proportional to square of the
Flight No. From Departurc Timcs To Arrival Time
(in hrs.) (in hrs.)
1 A
09.00 B
2 A 12.00
3
10.00 B
A 13.00
4 15.00 B
A 18.00
5 20.00
6
A
22.00 C
midnight
B 02.00
7 04.00 A
B
11.00 07.00
B A
15.00 14.00
A
10 07.00 18.00
C A
15.00 11.00
A
Find how the planes 19.00
total layover cost. If you should be assigned to the
Solution : have made any flights so as to
Assumptions : assumptions, state clearly. minimize the
() Aplane can
() Aplane not make more than two trips (to
next schedule trip flying from a and
from the city.particular city must be back fro).
From the given data, it is with in 24 hours for
the problem the
(n) routes can be divided intoclear two
that there is no
route between B and
between
Cost Matrix for
A and B.
sub-problems
(a) routes C. Thus
Flight Number routes9 connecting cities A between and C
A
10 and C
5 130 226
The 146
plane el
taking e ment s of the 178
above are
of 5
hours at flight number 5 from table
obtained as
cost for 5-9 city C(2.00 to 7.00) and Ato C and 9 from Cfollows : For
be would be 5+ 11 = 11 hours at city A to A, would have route 5-9, a
obtFlight
ained. Number
The optimal 146 units. In (11.00 a
the same way 22.00). The layover
to
4
assignment10 for
sub-problem layover
(a) will other route costs
be as can
64
follows :
OptimCOst
Total al = 4-9,assignment
130 + 178 = 510.
308 units.
5.42

Similarly cost matrix for sub-problem (b)

will be as given in theAssignment Prohlemy
Flight Number
1
6
260 M
7 8

234
ol owing Tate
234 M
260
164 290
3 M
( ) can not be
Mhas been put where assumption
back within 24 hours
fulfilled i.e. when
flying from a particular city cannot return a
plan
The optimal assignment for sub-problem (b) will be as followe .
7
Flight Number 6

1 26 M
M 26
2
M
3
Units.
Cost = 234 +234 + 290 =759
A, B, Example
11 : (Travelling salesman problem) A salesman has to visit fve in the,
C, Dand E. The travel time (in hours) between these cities is gven cies
following table :
To A B C D
From
14 17 13 14
A
B 14 X 16 13 14
C 17 16 X 17 15
D 13 13 17 17
E 14 14 15 17 X

He wishes to start from a particular ity, visit each city once and then retun
to the starting point. What is the sequence of visit of the salesman, so that the cos
is minimum?
Solution : The given problem may be solved as an assignment problem with
two additional restrictions.
Restriction I: Noassignment can be made along the diagonal. This restriction
can be meet out by assigning infinitely large cost to the leading diagonal elements.
Restriction II : Having visited a particular city (say B, in this case, the salesman
does not wish to visit it again until he has visited all other cities. Different tables
related to the solution of the problem by using assignment technique are as tolowng
II

1 4 3
1
8H
+ 2
2 1 0
4
1
 5.43
Problems

2
1 1

0 3 5

Thesolutiongivcn by table IV is not a solution to the travelling salesman

all the cities. According to this solution he goes from
as it does not cover
roblem, BtoDand returns to city Awithout covering city C. Therefore
Ato B.
thenfrom B
civ
Hew~llfind anothe optimal solution. We examine the table for some of the next best
tothe problem andItry to find one that satisfies the second restriction.
non-zero element is 1. So we try the effect of bringing such an
Thesmallest
Here element (1) appears at four places. We have to try all
clementinthe solution.
these
alternatively unless we get the appropriate solution. We start by making an
aSsgnmentfrom Bto Cby using element 1and delete row second and column third.
emaining matrix we see that assignments can be made by using zeros. The set
of assignmentsis also afeasible solution to the travelling salesmen problem.
A B C D E

5
3
0 4

Therefore the optimal assignment is A-D-B-C-E-A. The minimum cost will

be : 13 + 13 + 16+ 15+ 14 = 71,