ASSIGNMENT PROBLEM

WHAT IS ASSIGNMENT PROBLEM?

 Assignment Problem is a special type of linear programming

problem where the objective is to minimize the cost or time of
completing a number of jobs by a number of persons.
 The assignment problem in the general form can be stated as
follows:
 “Given n facilities, n jobs and the effectiveness of each facility for
each job, the problem is to assign each facility to one and only one
job in such a way that the measure of effectiveness is optimized
(Maximised or Minimised).”
 EXAMPLES
 Example I:
 A manager has four persons (i.e. facilities) available for four separate jobs (i.e.
jobs) and the cost of assigning (i.e. effectiveness) each job to each person is
given. His objective is to assign each person to one and only one job in such a
way that the total cost of assignment is minimized.
 Example II:
 A manager has four operators for four separate jobs and the time of completion
of each job by each operator is given. His objective is to assign each operator
to one and only one job in such a way that the total time of completion is
minimized.
ASSIGNMENT PROBLEM

 Assignment Problem:
 Assigning Jobs to people such that the total cost is minimized
 Subject to condition that each job goes to exactly one person and each person gets exactly one job.
 The assignment matrix is always a square matrix (i.e. Equal number of jobs that have to be given to
equal number of people).
 Example problem : Four Jobs, Four People (4*4) matrix

P1 P2 P3 P4
J1 5 9 3 6
J2 8 7 8 2
J3 6 10 12 7
J4 3 10 8 6
ASSIGNMENT PROBLEM (CONT.)
 Step 1 : Select a minimum value in the row and subtract it with all values of that row

P1 P2 P3 P4
J1 5 9 3 6
J2 8 7 8 2
J3 6 10 12 7
J4 3 10 8 6

P1 P2
J1 (5-3)=2 (9-3 )=6 (3-3)=0 (6-3)= 3
J2 (8-2)=6 (7-2)=5 (8-2)=6 (2-2)=0
J3 (6-6)=0 (10-6)=4 (12-6)=6 (7-6)=1
J4 (3-3)=0 (10-3)=7 (8-3)=5 (6-3)=3
ASSIGNMENT PROBLEM (CONT.)
 Step 2 : Select a minimum value in the column of reduced matrix and subtract it with all
values in that column.
P1 P2 P3 P4
J1 (5-3)=2 (9-3 )=6 (3-3)=0 (6-3)= 3
J2 (8-2)=6 (7-2)=5 (8-2)=6 (2-2)=0
J3 (6-6)=0 (10-6)=4 (12-6)=6 (7-6)=1
J4 (3-3)=0 (10-3)=7 (8-3)=5 (6-3)=3

P1 P2 P3 P4
J1 (2-0)=2 (6-4 )=2 (0-0)=0 (3-0)= 3
J2 (6-0)=6 (5-4)=1 (6-0)=6 (0-0)=0
J3 (0-0)=0 (4-4)=0 (6-0)=6 (1-0)=1
J4 (0-0)=0 (7-4)=3 (5-0)=5 (3-0)=3
ASSIGNMENT PROBLEM (CONT.)
 Step 3 : If any row and column has exactly one zero then we can assignment.
P1 P2 P3 P4
J1 2 2 0 3
J2 6 1 6 0
J3 0 0 6 1
J4 0 3 5 3

 When a row/or column has more than one zero then leave that column/row as it is for
temporarily.
 If a column or row has more than one zero in that case the assignment can be done to only one
zero. And the other zero will be eliminated.
P1 P2 P3 P4
J1 2 2 0 3
J2 6 1 6 0
J3 x0 0 6 1
J4 0 3 5 3
 Hence we got feasible solution by having minimum values in each rows and columns.
P1 P2 P3 P4
J1 2 2 0 3
J2 6 1 0 0
J3 x0 0 6 1
J4 0 3 5 3
ASSIGNMENT PROBLEM
 Assignment Problem2:
 Assigning Jobs to people such that the total cost is minimized
 Subject to condition that each job goes to exactly one person and each person gets exactly one job.
 The assignment matrix is always a square matrix (i.e.Equal number of jobs that have to be given to
equal number of people).
 Example problem : Five Jobs, Five People (5*5) matrix

P1 P2 P3 P4 P5
J1 11 7 10 17 10
J2 13 21 7 11 13
J3 13 13 15 13 14
J4 18 10 13 16 14
J5 12 8 16 19 10
ASSIGNMENT PROBLEM 2 (CONT.)
 Step 1 : Select a minimum value in the row 1 and subtract it with all

P1 P2 P3 P4 P5
J1 11 7 10 17 10
J2 13 21 7 11 13
J3 13 13 15 13 14
J4 18 10 13 16 14
J5 12 8 16 19 10
P1 P2 P3 P4 P5
J1 (11-7)=4 (7-7 )=0 (10-7)=3 (17-7)= 10 (10-7)= 3
J2 (13-7)=6 (21-7)=14 (7-7)=0 (11-7)=4 (13-7)= 6
J3 (13-13)=0 (13-13)=0 (15-13)=2 (13-13)=0 (14-13)= 1
J4 (18-10)=8 (10-10)=0 (13-10)=3 (16-10)=6 (14-10)= 4
J5 (12-8)= 4 (8-8)= 0 (16-8)= 8 (19-8)= 11 (10-8)= 2
ASSIGNMENT PROBLEM 2 (CONT.)
 Step 2 : Select a minimum value in the columns and subtract it with all
P1 P2 P3 P4 P5
J1 (11-7)=4 (7-7 )=0 (10-7)=3 (17-7)= 10 (10-7)= 3
J2 (13-7)=6 (21-7)=14 (7-7)=0 (11-7)=4 (13-7)= 6
J3 (13-13)=0 (13-13)=0 (15-13)=2 (13-13)=0v (14-13)= 1v
J4 (18-10)=8 (10-10)=0 (13-10)=3 (16-10)=6 (14-10)= 4
J5 (12-8)= 4 (8-8)= 0v (16-8)= 8 (19-8)= 11 (10-8)= 2
 Step 3: Check whether all rows or columns has zero

P1 P2 P3 P4 P5
J1 (4-0)=4 (0-0 )=0 (3-0)=3 (10-0)= 10 (3-1)= 2
J2 (6-0)=6 (14-0)=14 (0-0)=0 (11-0)=4 (6-1)= 5
J3 (0-0)=0 (0-0)=0 (2-0)=2 (0-0)=0 (1-1)= 0
J4 (8-0)=8 (0-0)=0 (3-0)=3 (6-0)=6 (4-1)= 3
J5 (4-0)= 4 (0-0)= 0 (8-0)= 8 (11-0)= 11 (2-1)= 1
ASSIGNMENT PROBLEM 2 (CONT.)
 Step 5 : Check for basic feasible solution by checking each row which has zero. If the row has
zero then assign it by drawing box and strike out other zero’s in that column.
P1 P2 P3 P4 P5
J1 4 0 3 10 2 √
J2 6 14 0 4 5
J3 0 0
X 2 0 0
X
X
J4 8 0
X 3 6 3 √
J5 4 0
X 8 11 1 √
√

 From the above table it can be observed that we cannot assign more job because there is no
feasible zero’s exist. We have got only three assignments but the actual matrix is 5*5.
 Step 6: when we have non feasible matrix like above table we need to follow following steps such
as
 Step 6a: Tick the unassigned row
 Step6b: If ticked row has a zero then tick the corresponding column
 Step6c: If the ticked column has an assignment, then tick the corresponding row
 Repeat step 6b,6c till no more ticking is possible
ASSIGNMENT PROBLEM 2 (CONT.)
 Step 6: when we have non feasible matrix like above table we need to follow following steps
such as

 Step 6a: Tick the unassigned row

 Step6b: If ticked row has a zero then tick the corresponding column
 Step6c: If the ticked column has an assignment, then tick the corresponding row
 Repeat step 6b,6c till no more ticking is possible
 Step6d: Draw lines through unticked rows and ticked columns

 Step 7: When no more ticking is possible then draw lines throw unticked rows and ticked columns
P1 P2 P3 P4 P5
J1 4 0 3 10 2 √
J2 6 14 0 4 5
J3 0 0
X 2 0 0
X
X
J4 8 0
X 3 6 3 √
J5 4 0
X 8 11 1 √
√
ASSIGNMENT PROBLEM 2 (CONT.)
 Step 8 : Find the smallest number in the line striked out matrix which does not have lines
passing through it. The smallest values to which no lines passes through is referred as ϴ. So
ϴ=1.
P1 P2 P3 P4 P5
J1 4 0 3 10 2 √
J2 6 14 0 4 5
J3 0 0
X 2 0 0
X
X
J4 8 0
X 3 6 3 √
J5 4 0
X 8 11 1 √
√
 Step 8A: Add ϴ value if two lines passes through it
 Step 8b:Substarct ϴ value If no lines passes through it

3 0 2 9 1
6 15 0 4 5
0 1 2 0X 0X
7 0X 2 5 2
3 0X 7 10 0
ASSIGNMENT PROBLEM 2 (CONT.)
 Step 9 : Follow step 6 for feasible solution

3 0 2 9 1 √
6 15 0 4 5
0 1 2 0
X 0
X

7 0
X 2 5 2 √
3 0
X 7 10 0
√
 Step 6a: Tick the unassigned row
 Step6b: If ticked row has a zero then tick the corresponding column
 Step6c: If the ticked column has an assignment, then tick the corresponding row
 Repeat step 6b,6c till no more ticking is possible
 Step6d: Draw lines through unticked rows and ticked columns
ASSIGNMENT PROBLEM 2 (CONT.)
 Step 10 : Repeat step 8

3 0 2 9 1 √
6 15 0 4 5
0 1 2 0
X 0
X

7 0
X 2 5 2 √
3 0
X 7 10 0
√
 Find the smallest number in the line striked out matrix which does not have lines passing through it.
The smallest values to which no lines passes through is referred as ϴ. So ϴ=1.
 Step 8A: Add ϴ value if two lines passes through it
 Step 8b:Substarct ϴ value If no lines passes through it

2 0
X 1 8 0
X

6 16 0 4 5
0 2 2 X0 0
X
6 0 1 4 1
3 1 7 10 0
ASSIGNMENT PROBLEM 2 (CONT.)
 Step 10 : Repeat step 8
2 0
X 1 8 0
X √
6 16 0 4 5
0 2 2 X0 0
X

6 0 1 4 1 √
3 1 7 10 0 √
√ √
 Step 6a: Tick the unassigned row
 Step6b: If ticked row has a zero then tick the corresponding column
 Step6c: If the ticked column has an assignment, then tick the corresponding row
 Repeat step 6b,6c till no more ticking is possible
 Step6d: Draw lines through unticked rows and ticked columns
 Find the smallest number in the line striked out matrix which does not have lines passing through it.
The smallest values to which no lines passes through is referred as ϴ. So ϴ=1.
 Step 8A: Add ϴ value if two lines passes through it
 Step 8b:Substarct ϴ value If no lines passes through it
ASSIGNMENT PROBLEM 2 (CONT.)
 Step 10 : Repeat step 8

1 X0 0
X 7 X0 √
6 17 0 4 5 √
0 3 2 0
X 0X
5 0 0
X 3 1 √
2 1 6 9 0 √
√ √ √
 Find the smallest number in the line striked out matrix which does not have lines passing through it.
The smallest values to which no lines passes through is referred as ϴ. So ϴ=1.
 Step 8A: Add ϴ value if two lines passes through it
 Step 8b:Substarct ϴ value If no lines passes through it

 Step 6a: Tick the unassigned row

 Step6b: If ticked row has a zero then tick the corresponding column
 Step6c: If the ticked column has an assignment, then tick the corresponding row
 Repeat step 6b,6c till no more ticking is possible
 Step6d: Draw lines through unticked rows and ticked columns
ASSIGNMENT PROBLEM 2 (CONT.)
 Step 10 : Repeat step 8

0 0
X 0
X 6 0X
5 17 0 3 5
0X 4 3 0 0X
4 0 0X 2 1
1 1 6 8 0

 Find the smallest number in the line striked out matrix which does not have lines passing through it.
The smallest values to which no lines passes through is referred as ϴ. So ϴ=1.
 Step 8A: Add ϴ value if two lines passes through it
 Step 8b:Substarct ϴ value If no lines passes through it
 Finally 11+7+13+10+10+=51

11 7 10 17 10
13 21 7 11 13
13 13 15 13 14
18 10 13 16 14
12 8 16 19 10
ASSIGNMENT PROBLEM
 Assignment Problem:
 Assigning Jobs to people such that the total cost is minimized
 Subject to condition that each job goes to exactly one person and each person gets exactly one job.
 The assignment matrix is always a square matrix (i.e. Equal number of jobs that have to be given to
equal number of people).
 Example problem : Five Jobs, Five People (5*5) matrix

P1 P2 P3 P4 P5
J1 9 11 14 11 7
J2 6 15 13 13 10
J3 12 13 6 8 8
J4 11 9 10 12 9
J5 7 12 14 10 14
ASSIGNMENT PROBLEM (CONT.)
 Step 1 : Select a minimum value in the row and subtract it with all values of that row

P1 P2 P3 P4 P5 Row minimum
J1 9 11 14 11 7 7
J2 6 15 13 13 10 6
J3 12 13 6 8 8 6
J4 11 9 10 12 9 9
J5 7 12 14 10 14 7

P1 P2 P3 P4 P5
J1 2 4 7 4 0
J2 0 9 7 7 4
J3 6 7 0 2 2
J4 2 0 1 3 0
J5 0 5 7 3 7
 ASSIGNMENT PROBLEM (CONT.)
 Step 2 : Select a minimum value in the column of reduced matrix and subtract it with all
values in that column.
P1 P2 P3 P4 P5
J1 2 4 7 4 0
J2 0 9 7 7 4
J3 6 7 0 2 2
J4 2 0 1 3 0
J5 0 5 7 3 7
Col minimum 0 0 0 2 0

P1 P2 P3 P4 P5
J1 2 4 7 2 0
J2 0 9 7 5 4
J3 6 7 0 0 2
J4 2 0 1 1 0
J5 0 5 7 1 7
 ASSIGNMENT PROBLEM (CONT.)
 Step 3 : row scanning

P1 P2 P3 P4 P5
J1 2 4 7 2 0
J2 0 9 7 5 4
J3 6 7 0 0 2
J4 2 0 1 1 0
J5 0 5 7 1 7

 Step 4 : Column scanning

P1 P2 P3 P4 P5
J1 2 4 7 2 0
J2 0 9 7 5 4
J3 6 7 0 0 2
J4 2 0 1 1 0
J5 0 5 7 1 7
 ASSIGNMENT PROBLEM (CONT.)
 Step 5 : Check for basic feasible solution by checking each row which has zero. If the row has zero
then assign it by drawing box and strike out other zero’s in that column.
P1 √ P2 P3 P4 P5
J1 2 4 7 2 0
J2 0 9 7 5 4 √
J3 6 7 0 0 2
J4 2 0 1 1 0
J5 0 5 7 1 7 √

 From the above table it can be observed that we cannot assign more job because there is no feasible
zero’s exist. We have got only three assignments but the actual matrix is 5*5.
 Step 6: when we have non feasible matrix like above table we need to follow following steps such as
 Step 6a: Tick the unassigned row
 Step6b: If ticked row has a zero then tick the corresponding column
 Step6c: If the ticked column has an assignment, then tick the corresponding row
 Repeat step 6b,6c till no more ticking is possible
 Step6d: Draw lines through unticked rows and ticked columns
ASSIGNMENT PROBLEM (CONT.)
 Step 8 : Find the smallest number in the line striked out matrix which does not have lines
passing through it. The smallest values to which no lines passes through is referred as ϴ. So
ϴ=1. P1 P2 P3 P4 P5
√
J1 2 4 7 2 0
J2 0 9 7 5 4 √
J3 6 7 0 0 2
J4 2 0 1 1 0
J5 0 5 7 1 7 √
 Step 8A: Add ϴ value if two lines passes through it
 Step 8b:Substarct ϴ value If no lines passes through it

P1 √ P2 P3 P4 P5
J1 3 5 7 2 1
J2 0 8 6 4 4
J3 7 8 0 0 3
J4 3 1 1 1 11
J5 0 5 6 0 7 √
ASSIGNMENT PROBLEM (CONT.)
 Step 1 column minimum and assignment

P1 P2 P3 P4 P5
J1 2 4 6 1 0
J2 0 8 6 4 4
J3 7 8 0 0 3
J4 2 0 0 0 10
J5 0 5 6 0 7
ASSIGNMENT PROBLEM (CONT.)
 Step 1 row minimum

P1 P2 P3 P4 P5
J1 3 5 7 2 1 1
J2 0 8 6 4 4 0
J3 7 8 0 0 3 0
J4 3 1 1 1 11 1
J5 0 5 6 0 7 0

P1 P2 P3 P4 P5
J1 2 4 6 1 0
J2 0 8 6 4 4
J3 7 8 0 0 3
J4 2 0 0 0 10
J5 0 5 6 0 7