Industrial Case Problem

Assignment Problem

10/26/2020 Operation research / Assignment Problem / T.Pravin / AP / MECH/ SNSCT 1

 Assignment Problem
• Fundamental combinatorial optimization problem
• It involves assignment of people to projects, jobs to
machines, workers to jobs and teachers to classes etc.,
While minimizing the total assignment costs
•One of the important characteristics of assignment
problem is that only one job (or worker) is assigned to
one machine (or project)
10/26/2020 Operation research / Assignment Problem / T.Pravin / AP / MECH/ SNSCT 2
 Assignment Problem
• Though assignment problem finds applicability in various
diverse business situations, we discuss some of its main
application areas:
•In assigning machines to factory orders.
•In assigning sales/marketing people to sales territories.
•In assigning contracts to bidders by systematic bid-evaluation.
•In assigning teachers to classes

10/26/2020 Operation research / Assignment Problem / T.Pravin / AP / MECH/ SNSCT 3

 I II III IV
A 45 38 30 22
B 35 29 20 14
C 35 29 20 14
D 27 20 15 10

I,ii,iiii, iv – city
A,B,C,D - Salesman

10/26/2020 Operation research / Assignment Problem / T.Pravin / AP / MECH/ SNSCT 4

 Covert Max to Min Sum
Row Wise Deductions
Select min value from each row

I II III IV
A 45 38 30 22
B 35 29 20 14
C 35 29 20 14
D 27 20 15 10

I II III IV
A 0 7 15 23
B 10 16 25 31
C 10 16 25 31
D 18 25 30 35
10/26/2020 Operation research / Assignment Problem / T.Pravin / AP / MECH/ SNSCT 5
 Row Wise Deductions

Select min value from each row

I II III IV
I II III IV
A 0 7 15 23
A 0 7 15 23
B 0 6 15 21
B 10 16 25 31
C 10 16 25 31 C 0 6 15 21
D 18 25 30 35 D 0 7 12 17

10/26/2020 Operation research / Assignment Problem / T.Pravin / AP / MECH/ SNSCT 6

 Column Wise Deductions

Select min value from each column

I II III IV
I II III IV
A 0 7 15 23 A 0 1 3 6
B 0 6 15 21 B 0 0 3 4
C 0 6 15 21 C 0 0 3 4
D 0 7 12 17 D 0 1 0 0

10/26/2020 Operation research / Assignment Problem / T.Pravin / AP / MECH/ SNSCT 7

 Phase 2

Optimization of the problem.

Draw vertical Line in single zero (row wise)

I II III IV

A 0 1 3 6
B 0 0 3 4
C 0 0 3 4
D 0 1 0 0

10/26/2020 Operation research / Assignment Problem / T.Pravin / AP / MECH/ SNSCT 8

 Phase 2

Identify Min Number in undeleted Cell

Add Min Number at intersection point
Sub Min Number at undeleted Cell
Remain same at deleted cell

I II III IV I II III IV

A 0 1 3 6 A 0 1 0 3
B 0 0 3 4 B 0 0 0 1
C 0 0 3 4 C 0 0 0 1
D 0 1 0 0 D 3 4 0 0

10/26/2020 Operation research / Assignment Problem / T.Pravin / AP / MECH/ SNSCT 9

 I II III IV

A 0 1 0 3
B 0 0 0 1
C 0 0 0 1
D 3 4 0 0

10/26/2020 Operation research / Assignment Problem / T.Pravin / AP / MECH/ SNSCT 10

 Phase 2
optimal Condition reached
I II III IV
A 45 38 30 22
I II III IV B 35 29 20 14
A 0 1 0 3 C 35 29 20 14
B 0 0 0 1 D 27 20 15 10
C 0 0 0 1 Sales Teri` Actual

D 3 4 0 0 I 45
A

B II 29
C III 20
D IV 10

Total PROFIT for the Batch = 104

10/26/2020 Operation research / Assignment Problem / T.Pravin / AP / MECH/ SNSCT 11
 Phase 2
optimal Condition reached

1 2 3 4 5 Operator Actual
S.No Skill No
No Time
1 9 11 14 11 7 1 1 5 7
2 6 15 13 13 10 2 2 1 6
3 12 13 6 8 8 3 3 3 6
4 11 9 10 12 9 4 4 2 9
5 7 12 14 10 14 5 5 4 10

Total Time for the Batch = 38 Mins

10/26/2020 Operation research / Assignment Problem / T.Pravin / AP / MECH/ SNSCT 12