Assignment Problems

The assignment problem is a particular case of the transportation problem

in which the objective is to assign a number of origins to the equal number
of destinations at a minimum cost ( or maximum profit).
The basic assumption for the solution is that the optimum solution remains
unaltered if a constant is added/ subtracted to/from any row or column of
the cost matrix.
In assignment problem the objective is to assign the given job (task) to most
appropriate machine (person). So as to optimize the objective function like
minimizing cost.
ASSUMPTIONS

The assignment problem is a special case of transportation problem under

the condition that 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:
1. Number of jobs is equal to number of machines or persons
2. Each of the machines is loaded with one and only one job
3. Each man or machine is independently capable of handling one of the
jobs being presented
4. Loading criteria must be clearly specified such as minimizing
operating time or maximizing profit or minimizing product cost
MATHEMATICAL FORMULATION OF THE PROBLEM

Consider that we have four jobs and four persons. We want to allot one job
to one person so that the total time taken will be minimum. We shall
formulate a mathematical model for the problem.
Let the decision variable Xij be the assignment of the ith job to the jth person
and Cij be the time taken for ith job by jth person.
The objective function is to minimize

Z
Subject

=
to

Row restrictions:

C ij X ij
restrictions

x11 + x12 + x13 + x14 = 1

x21 + x22 + x23 + x24 = 1
x31 + x32 + x33 + x34 = 1
x41 + x42 + x43 + x44 = 1
Column restrictions:
x11 + x21 + x31 +

x41 = 1

for
for
for
for

job
job
job
job

1
2
3
4

for person 1

x12 + x22 + x32 + x42 = 1

x13 + x23 + x33 + x43 = 1
x14 + x24 + x34 + x44 = 1

for person 2
for person 3
for person 4

And xij = 0 or 1
In general:
xi1 + xi2 + xi3 + ..........................+ xin = 1
for
i=1,2,3.............,n
x1j + x2j + x3j + ..........................+ xnj =1 for j=1,2,3.............,n
when compared with a transportation problem, we see that ai =1 and bj =1
for all rows and columns xij =0 or 1

Example 1
A works manager has to allocate 4 different jobs to 4 workmen, depending
on the efficiency and the capacity of the individual. The times taken by each
differ as shown in the following table. How should the tasks be assigned one
job to a worker so as to minimize the total man-hours?
Worker
Job

10

20

18

14

15

25

25

30

19

17

12

19

24

20

10

Solution:
The following steps are followed to find an optimal solution.
Step 1 : Row reduction
Consider each row and select the minimum element in each row.
Subtract this smallest element from all elements in that row. This
results in following table 1:
Table 1

Worker
Job

10

16

16

18

14

10

Step 2 : Column reduction

We subtract the minimum element in each column from all the
elements in its column. Thus we obtain following table 2:
Table 2
Worker
Job

16

18

10

Step 3 : Row Assignment

In this way we make sure that in the matrix each row and each
column has atleast one zero element. We assign starting from 1st row.
In the table above we have a zero in (1,A), hence we assign Job 1 to
the worker A. This assignment is indicated by a square mark. All the
other zeros in the column are crossed (x) to show that the other jobs
cannot be assigned to worker A as he has already been assigned. In
the above problem we do not have other zeros in the first column A.
Proceed to the second row. We have a zero in (2,C) hence we assign
the job 2 to worker C indicated by a square mark. Any other zero in
this column is crossed (x).
Proceed to the third row. We have two zeros corresponding (3,B) and
(3,D) since there is a tie for the Job 3, go to the next row deferring the
decision for the presProceeding to the 4th row, we have only one zero
in (4,D) . Hence we assign Job 4 to worker D. Now the column D has a
zero in the 3rd row. Hence cross (3,D). all the assignments made in this
way are shown in table 3:
Table 3

Worker
Job

18

0
5

10

16
0
0

Step 4 : Column Assignment

Now having assigned certain jobs to certain workers we proceed to
the column 1. since there is an assignment in this column, we proceed
to the second column. There is only one zero in the cell (3,B); we
assign the Job 3 to worker B. Thus all the four jobs have been
assigned to four workers. Thus we obtain the solution to the problem
as shown in table 4.
Table 4
Worker
Job

18

0
7

0
5
10

The assignments are:

Job
1
2
3
4

Example 2:

Worker
A
C
B
D

Time
10
9
19
10
---------The minimum total man-hours =
48
----------

16
0
0

Consider the following problem of assigning 5 jobs to 5 persons. The

assignment costs are given as follows:
Job
1

Persons
A

Solution :
Step 1 : Row reduction
Subtract the smallest element of each row from other elements of that
row.
Job
1

Persons

Step 2 : Column Reduction

Job
Persons

Step 3 : Making Assignments

Job
1

0
4

Persons

0
2
4
0
We get the optimum solution as the number of assignments are 5. The
optimum schedule is:
E

Person

Job

Cost

Total minimum cost is Rs.

Hungarian Assignment Method

There are three phases in Hungarian Assignment method
1. Develop effectiveness matrix
2. Obtain optimum values
3. Assign optimum values
Following are the steps involved
Step 1: Row Reduction
Reduce each row element by the lowest element of that row.
Step 2: Column Reduction
Repeat step 1 for each column.
Step 3: Check Optimality
Cover all zeros of Effectiveness problem with the minimum number of
horizontal and vertical lines. Compare the total number of lines (N) with
the total number of machines (n).

If N=n the solution is optimum. Go to Step 5. If N<n the solution is not

optimum; go for Step 4.
Step 4:
a) Locate the smallest uncovered (not covered by line) cost element at
the matrix
b) Subtract the above element from all the cost elements in uncovered
cells
c) Add the above element to all cost elements at the intersection cells
d) Re draw the new Effectiveness Matrix
e) Check optimality of the revised Effectiveness Matrix
f) If the revised Effectiveness Matrix is optimum go for step 5
g) If the revised Effectiveness Matrix is not optimum repeat (a), (b)
and (c) above till optimum condition is reached
Step 5:
a) Row assignment: Examine the rows of the current Effectiveness
Matrix successively until a row with only one unmarked (non
assigned ) zero is found. Mark this cell for assignment. Delete all
other zeros in the corresponding column. By this deletion you may
come across additional rows having single unmarked zero. If so
repeat the process once again in succession starting from the first
row to last.
b) Column Reduction: Examine the column successively of the
current Effectiveness Matrix until a column with only one
unmarked zero is found. Mark this cell for assignment. Delete all
other zeros appearing in the corresponding row. By this deletion you
may come across additional columns having single unmarked zero. If
so repeat the process once again in succession starting from the first
column to last.
c) Optimal Solution: Repeat processes (a) and (b) above till
assignment made to all rows and columns. When this is achieved
optimum solution is obtained.
d) Optimum Cost: Calculate the total cost or expenditure for optimum
solution

Example 3
Consider a factory having 4 machines. There are 4 jobs which are to be
loaded in all the 4 machines so that the operating cost is the minimum.
Operating cost matrix is given below in Rs.
M/C
Job

12

15

11

11

16

14

15

12

11

Solution:
Step 1: Row Reduction
M/C
Job

Step 2: column Reduction

M/C
Job

Step 3: Check Optimality

M/C
Job
1
2

A
0
4

By examination we find the following

Number of zeros = 6
Min. number of lines = 3 = N
Number of machines = 4 = n
We have N<n. Hence the solution is not optimum. Go to step 4
Step 4: Improving Solution
Smallest value of uncovered cell (3,2) is = 1 Subtract this number viz. 1
from all other uncovered cells. Add this number viz. 1 to intersection
elements at cells (1,4) and (2,4). The new values of these cells are 10 and
1 respectively
The revised matrix with the above correction is reproduced as follows.
M/C
Job
1

A
0

10

This is the revised effectiveness matrix. Subject the same optimality test
by drawing lines as shown above. Here also we find number of lines N=3
and N<n hence the smallest value of uncovered cell (3,3) =1 is added to
uncovered cells and subtracted from covered cells.
Step 5 Row and Column Assignment
M/C
Job
1

A
0

11

0
0

0
2

Machine

Cost

The optimum assignments are:

Job

0
0

15

Minimum Total Cost

35

Example 4:
A car hire company has 1 car at each of the 5 depots. A customer in each
of the 5 towns requires a car. The distance between the depots and the
towns where the customers are, is given the following distance matrix.
Depots
Towns
A

160

130

175

190

200

135

120

130

160

175

140

110

155

170

185

50

50

80

80

110

55

35

70

80

105

How should the cars be assigned to the customers, so as to minimize the

distance traveled?
Solution:
Step 1: Row Reduction
Depots
Towns

30

45

60

70

15

10

40

55

30

45

60

75

30

30

60

20

35

45

70

Step 2: Column Reduction

Depot
s
Towns

30

35

30

15

15

10

30

35

30

20

20

20

25

15

15

Step 3: Check Optimality

Depots
Towns

30

35

30

15

15

10

30

35

30

20

20

20

25

15

15

N<n
N=no. of lines = 4
n = no. of depots = 5
Hence assignment is not optimum
Modify the above table by subtracting minimum element 15 from all
uncovered elements and adding to the elements lying at the intersection
of the lines.
Step 4:
Depo
ts
Towns

15

20

15

15

15

10

15

20

15

15

20

10

Here N=n
Hence assignment is optimum
Step 5: Row and Column Assignment
Depot
s
Towns

15

20

15

15

15

10

15

0
20

0
0

15

20

0
5

0
15
0

10

The optimum distance is as follows:

Town

Depot

Distance (miles)

200

130

110

50

80

Total Distance

570

Maximisation Assignment Problem.

Maximisation assignment problems should be converted into minimization
problem by identifying largest cell value in the table and subtracting each
cell element by that largest cell element.
Example 5:
A company has 4 territories & 4 salesmen available for assignment. The
territories are not equally rich in their sales potential. It is estimated that
a typical salesman operating in each territory would bring the following
weekly sales:
Territory
I
II
III
IV
Annual
Sales (Rs 000)
252
210
168
126

The 4 salesmen area also considered to differ in ability. It is estimated

that working under the same conditions their yearly sale would be
proportioned as follows:
Salesman
A
B
C
D
Proportion
7
5
5
4
Determine the territory assigned to each salesman for maximisation of
the total sales.
Solution:
The sales for each salesman, to be assigned to each territory, is given in
the matrix.
Territory
I

II

III

IV

7 x 252
21

7 x 210
21

7 x 168
21

7 x 126
21

5 x 252
21

5 x 210
21

5 x 168
21

5 x 126
21

5 x 252
21

5 x 210
21

5 x 168
21

5 x 126
21

4 x 252
21

4 x 210
21

4 x 168
21

4 x 126
21

Salesman

Problem can be rewritten as follows:

Sales Matrix ( in 000)
Territory
I

II

III

IV

84

70

56

42

Salesman
A

60

50

40

30

60

50

40

30

48

40

32

24

Converting into Minimisation Problem:

Selecting the largest element 84 and deducting three from sll other
elements the problem is converted into minimization problem as follows.
Territory
I

II

III

IV

14

28

42

24

34

44

54

24

34

44

54

36

44

52

60

II

III

IV

14

28

42

10

20

30

10

20

30

16

24

II

III

IV

12

18

Salesman

Row Reduction:
Territory
Salesman

Column Reduction
Territory
Salesman

II

III

IV

10

16

II

III

IV

14

Here N<n
Hence assignment is not optimum
Territory
Salesman

Here N<n
Hence assignment is not optimum
Territory
Salesman

Here N=n. Hence optimum solution is now reached.

Assignment
Territory
I

II

III

IV

14

Salesman

0
0

The optimum assignment:

Salesman
A
B
C
D

Territory

Sales
84000
50000
40000
24000

I
II
III
IV
Total Sales =

198000

Unbalanced Transportation Problem

Example
A fast food chain wants to build 4 stores. In the past the chain has used 6
different contractors. It has been satisfied with each and has invited each
to bid on each job. The final bids(in 000 rupees) were as shown in the
following table:
Contra
ctor
Store
1

85.3

90

87.5

82.4

89.1

91.3

78.9

84.5

99.4

80.4

89.3

88.4

82

31.3

28.5

66.5

80.4

109.7

84.3

34.6

86.2

83.3

85

85.5

Since the fast food chain wants to have each of the new stores ready as
quickly as possible, it has decided to award at most one job to a
construction company. What assignment results in the minimum cost to
the fast food chain?
Solution:
Since the above matrix is a 4x6, thus we add two dummy rows and
multiply the matrix by 10 to remove the decimals. The resultant matrix is
shown below.

Contracto
r
Store
1

853

900

875

824

891

913

789

845

994

804

893

884

820

313

285

665

804

1097

843

346

862

833

850

855

Step 1: Row & Column Reduction

Contr
actor
Store

29

76

51

67

89

56

205

15

104

95

535

28

380

519

812

497

516

487

504

509

Since there are sufficient zeros we can go for Row and Column
assignments.
Step 2: Assignments
Contr
actor
Store
1
2

29

76

51

67

89

56

205

0
15

104

95

28

0
516

380

519

812

487

504

509

0
535

497

0
0

The least cost assignment is:

Store
Contractor

Cost

1
2
3
4

4
1
3
2

82.4
78.9
28.5
34.6
-----------Total Cost ( in Rs. 000 )=
224.40

Impossible Asignments
Sometimes in an assignment model we are not able to assign some loads
to some persons or machines. For example, if machines are to be
allocated to locations and if a machine cannot be accommodated in a
particular location, then it is an impossible assignment. To solve
problems in such situations we attach highly prohibited (say infinite) cost
to the cell in the matrix so that there is absolutely no chance to get the
assignmets with the infinite cost in the optimum solution.

Example:
The processing time in hrs for the jobs when allocated to the different
machines are indicated below. When a job is not possible to be made in a
particular manner, it is indicated as -
M/C
I
II
III
IV
V
Job
3
8
8
A
4
7
15
18
8
B
8
12
12
C
5
5
8
3
6
D
10
12
15
10
E
Allocate the machines for the jobs so that the total processing time is
minimum
Solution:
We have the impossible assignments marked as - We introduce
deliberately a high prohibitive time (say infinite) in those places and
proceed with the usual steps of solution procedure for assignment
problem.
Step 1: Row Reduction
M/C
Job

II

III

IV

15

18

12

12

10

12

15

10

M/C
Job

II

III

IV

11

14

Step 2: Column Reduction

M/C
Job

II

III

IV

11

14

M/C
Job

II

III

IV

14

Now optimum assignment has not been reached. Now subtract the least
element from the uncovered elements and add it to the intersection
elements. In this case element is 1.
Continue doing this till optimal matrix is reached. The final assignment
matrix is shown below:

M/C
Job

II

III

IV

13

The jobs assigned for minimum processing time:

Job
A
B
C
D
E

M/C
III
I
V
II
IV

Time (hrs)
8
4
12
5
10
--------Total processing time =
39
---------