ASSIGNMENT PROBLEM

Dr. K.R.Suresh Click to edit Master subtitle style Department of Civil Engineering BMS College of Engineering Bangalore-19
5/23/12

Definition of the Assignment Problem:

It concerns as to what happens to the effectiveness function when we associate each of a number of Origins with each of the same number of Destinations. Each resource or facility (origin) is to be associated with one and only job (destinations and associations are to be made in such a way so as to 5/23/12 maximise (or minimise) the total

It may be defined as follows:

Given n facilities and n jobs and given the effectiveness of each facility for each job, the problem is to assign each facility to one and only job so as to optimize the given measure of effectiveness.
5/23/12

Example: Jobs Facilities Mason Helper Bar Bender Concrete Concrete Bar Laying mix Bending Electrical Conduit Laying C14 C24 C34

Supply ai 1 1 1 1

C11 C21 C31

C12 C22 C32

C13 C23 C33

Electricia C41 n

C42

C43

C44

Demand 1 bj
5/23/12

Table represents the assignment of n facilities to n jobs. Cij is the cost of assigning ith facility to the jth job and xij represents the assignment of the ith facility to the jth job. If the ith facility can be assignerd to jth job, xij =1 otherwise ZERO. The objective is to make assignments that minimise the total assignment cost or maximise the total associated gain. Assignment problem can be represented by n X n matrix which constitutes n! possible ways of making assignments. 5/23/12

Tableau
Jobs

Fa cil iti es

COSTS
Demand

Su pp ly

5/23/12

Model

F a c i l I t I e s

Jobs
1 1 c11 2 c21 2 c12 c22 m
Supply

. c1m c2m cm m

1 1 1

m cm1 cm2 Demand 1 1

5/23/12

Solution

Destinations
O ri g i n s
Factories

1 1 x11

2 x12

mavailable x1n a1 a2 am

2 x21 x22 m xm1 xm2 Reqd b1 b2

x2n xmn

5/23/12

bn

Objective Function

Mathematically the assignment problem can be expressed as follows: 0, if the ith facility is not assigned to jth Let x ij = Job 1, if the ith facility is assigned to jth Job Min Z = Subjected to

Cij xij
i= 1 j= 1
ij

x
j =1

ij

= 0or1

xij = 0or1

x
i= 1

=1, i =1,2,3,..... n

x
j =1

One job is assigned to the ith facility One facility is assigned to the jth job

ij

= 1, j = 1,2,3,.....n

xij = 0or 1
5/23/12

xij 0

Transportation Problem

Example:
The cost of any action consists of opportunities that area sacrificed in taking that action.

Machines
J o b s
Demand
5/23/12

X A B C 25 31 35 1

Y 15 20 24 1

Z Supply 22 19 17 1 1 1 1

Suppose it is decide to process job A on Machine X. From the cost matrix, the cost of this process is Rs.25 Where as for the same job if one opts Machine Y, it costs only Rs.15. Similarly if one opts Machine Z for job A, it costs Rs. 22. Therefore assigning the job to Machine X and Z is not a good decision. If the job A is assigned to Machine X, it is done by sacrificing the opportunity to save Rs.10 (Rs.25-Rs.15). The sacrifice is referred to as an opportunity cost. 5/23/12

Machines
J o b s

X A B C 10 4 6

Y 0 4 7

Z 7 6 7

5/23/12

The decision to process job A to machine X precludes the assignment of this job to Machine Y, given the constraint that one and only one job can be assigned to a Machine. Thus the opportunity cost of assignment of job A to Machine X is Rs. 10 with respect to the lowest assignment for job A. Similarly, a decision to assign a job A to Machine Z would involve an opportunity cost of Rs. 7 (Rs.22-Rs.15). These costs are precisely called Machine opportunity costs with regard to job A. Repeat this procedure for jobs B and C and the reduced matrix is given below.

5/23/12

In addition to these Machine opportunity costs, there are Job- opportunity costs also. Job A, B or C, for instance, could be assigned to Machine X. The assignment of Job B to Machine X involves a cost of Rs. 31, while the assignment of job A to Machine X costs only Rs.25. Therefore, the opportunity cost of assigning job B to Machine X is Rs. 6(Rs. 31- Rs.25). Similarly, the opportunity cost of assigning job C to Machine X is RS. 10 (Rs.35-Rs.25). A Zero Opportunity cost is involved in the assignment of job A to machine X, since this is the best assignment cost for Machine X. Hence job-opportunity costs are obtained by subtracting the lowest cost entry in each column from all the cost entries in that column.

5/23/12

If the lowest cost entry in each column of the reduced matrix is subtracted from all the cost entries of that column, the resulting table is called Total Opportunity cost table.

5/23/12

Machines
X
J o b s

Z 7-0=7 0-0=0 0-0=0

A 10-10=0 0-0=0 B 12-10=2 1-0=1 C 18-10=8 7-0=7

Total Opportunity Cost Table

5/23/12

The objective is to assign the jobs to the machines so as to minimise total costs. With the total opportunity cost table this objective will be achieved if the jobs are assigned to the machines in such a way as to obtain a total opportunity cost of zero. The total opportunity cost table contains four cells with zeros, each indicating a zero opportunity cost for that cell (assignment). Hence job A could be assigned to machine X or Y and Job B to Machine Z, all assignments having Zero opportunity costs. This way job C, could not be assigned to any machine with a with a zero opportunity cost since assignment of job B to machine Z precludes the assignment of job C to this Machine. Clearly, to make an optimal assignment of the three jobs to the three machines, there must be three zero cells in the table such that a complete assignment to 5/23/12 these cells can be made with a total opportunity cost of

Method of determining an optimal assignment:

1. 2.

3.

This method consists of drawing minimum number of lines covering all zero cells in the total opportunity cost table. If the minimum number of lines = number of rows (or columns in the table), an optimal assignment can be made and the problem is solved. If the number of lines is less than the number of rows or columns

5/23/12

Cont !
Destinations Ori gin s

P A B Demand C 5

Q 7

R 8

Supply 70

Row Difference (2) (0) (1)

30
4 6 4 7 6 7 43 (1)

0
30 50

12
65 42 (3) Larges t (1)

Column Difference
5/23/12

Cont !
Destinations Ori gin s

P A B Demand C 6 65 5

Q 7 7 12

R 8 7 43

Supply 70 30 50

Row Difference (2) (1)

Column Difference
5/23/12

(1)

(0)

(1)

Cont !
Destinations Ori gin s

Supply

65
A C 5 6 7 7 12 (0) 8 7 43 (1)

5
70 50 150

Row Difference (2)

(1)

Demand

0
65 (1)

Column Difference
5/23/12

Cont !
Destinations Ori gin s

Supply

Row Difference (1)

5
A B Demand C 7 7 43 (1) 7 8

0
5 50

(0)

7
65 12 (0)

Column Difference
5/23/12

Cont !
Destinations Ori gin s

Supply

Row Difference

B Demand C 65 Column Difference

5/23/12

7 7

7 43

50

(0)

Cont !
Destinations Ori gin s

Supply

Row Difference

7
Demand C 65 Column Difference
5/23/12

43
7 7 7 43 50

(0)

Solution

Destinations
O 65 ri A g B i C n s Demand
5/23/12

P 5 30 7 65

Supply 70 30

43 42 43

50 150

5/23/12