Assignment Problem

Profit / Quality ----- Maximization

Cost / Time ----- Minimization
Assignment --- One on one allocation
Hungarian Method --- Harold Kuhn 1955

BALANCED MINIMIZATION PROBLEM

Q1. In a plant 4 employees are to be assigned 4 jobs on one
on one basis. The cost is in Rs. Thousand for each employee
to do each job is given.
Find the optimal combination of employees and job to
minimize total cost.
Employees / Job P Q R S
A 60 50 40 45
B 40 45 55 30
C 55 70 60 50
D 45 45 40 45

Solution:
Step1:
No of Employees = 4
No of Jobs = 4
No of Employees = No of Jobs
Problem is balanced.

Step 2: Row Minimization:

Employees P Q R S
/ Job
A 20 10 0 5
B 10 15 25 0
C 5 20 10 0
D 5 5 0 5

Step 3: Column Minimization:

Employees P Q R S
/ Job
A 15 5 0 5
B 5 10 25 0
C 0 15 10 0
D 0 0 0 5

Size of Matrix = 4
No. of Lines = 4
Size of Matrix = No. of Lines
There is no degeneracy.
Solution is optimal.
Step 4: Assignment
Employees P Q R S
/ Job
A 0
B 0
C 0 0
D 0 0 0

Step 5. Assignment Schedule

Employees Jobs Cost (Rs. Thousand)
 A R 40
B S 30
C P 55
D Q 45
Total Cost Rs. 170000

Optimal Cost = Rs. 170000

Q2. Find optimal assignment of employees and jobs to

minimize total time.
Time (in minutes)
Employees A B C D E
/ Job
I 160 130 175 190 200
II 135 120 130 160 175
III 140 110 155 170 185
IV 50 50 80 80 110
V 55 35 70 80 105

Step 1:
No of Employees = 5
No of Jobs = 5
No of Employees = No of Jobs
Problem is balanced.

Step2: Row Minimization

 Employees A B C D E
/ Job
I 30 0 45 60 70
II 15 0 10 40 55
III 30 0 45 60 75
IV 0 0 30 30 60
V 20 0 35 45 70

Step3: Column Minimization

Employees A B C D E
/ Job
I 30 0 35 30 15
II 15 0 0 10 0
III 30 0 35 30 20
IV 0 0 20 0 5
V 20 0 25 15 15

Size of Matrix = 5
No of Lines = 3
Size of Matrix = No of Lines
There is degeneracy.
Solution is not optimal
Minimum Change = 15 (3 steps has to followed)
Employees A B C D E
/ Job
I 15 0 20 15 0
II 15 15 0 10 0
III 15 0 20 15 5
IV 0 15 20 0 5
V 5 0 10 0 0

Size of Matrix = 5
No of Lines = 5
Size of Matrix = No of Lines
There is no degeneracy.
Solution is optimal
Step 4: Assignment
Employees A B C D E
/ Job
I 0 0
II 0 0
III 0
IV 0 0
V 0 0 0

Step 5: Assignment Schedule:

Employees Job Time (in Minutes)
I E 200
II C 130
III B 110
IV A 50
V D 80
Total Time 570 minutes

Optimal Time: 570 minutes

Practice Question
Q3. Find optimal assignment of employees and jobs and find
optimal cost
Cost in (Rs. Hundred)
Worker / J1 J2 J3 J4 J5
Job
W1 28 22 26 20 27
W2 17 16 18 20 22
W3 11 13 14 16 17
W4 13 12 11 8 10
W5 11 10 6 8 9
Step1:
No. of Workers = 5
No of Jobs = 5
No of Workers = No of Jobs
Problem is balanced.
Step2: Row Minimization
Worker / J1 J2 J3 J4 J5
Job
W1 8 2 6 0 7
W2 1 0 2 4 6
W3 0 2 3 5 6
W4 5 4 3 0 2
W5 5 4 0 2 3

Step2: Column Minimization

Worker / J1 J2 J3 J4 J5
Job
W1 8 2 6 0 5
W2 1 0 2 4 4
W3 0 2 3 5 4
W4 5 4 3 0 0
W5 5 4 0 2 1
Size of Matrix = 5
No of Lines = 5
Size of Matrix = No of Lines
There is no degeneracy.
Solution is optimal
Step 3: Assignment
Worker / J1 J2 J3 J4 J5
Job
W1 0
W2 0
W3 0
W4 0 0
W5 0

Step 4: Assignment Schedule

Worker Jobs Cost(Rs. Hundred)
W1 J4 20
W2 J2 16
W3 J1 11
W4 J5 10
W5 J3 6
Total Cost Rs. 6300

Optimal Cost = Rs. 6300

 Unbalanced Minimization Problem
Q4. A company has 4 machines to do 3 jobs. Each job can be
assigned to only one machine. The cost of each job – machine
combination is given in the table below in Rupees.
Job / Machine I II III IV
A 9 12 14 18
B 4 6 8 9
C 5 7 9 11
Find an optimal assignment which will minimize the cost.
Solution:
Step 1:
No. of Machines = 4
No. of Jobs = 3
No. of Machines = No of Jobs.
Problem is Unbalanced.
Dummy Job should be added
Job / Machine I II III IV
A 9 12 14 18
B 4 6 8 9
C 5 7 9 11
D 0 0 0 0

Step 2: Row Minimization

Job / Machine I II III IV
A 0 3 5 9
B 0 2 4 5
C 0 2 4 6
D 0 0 0 0
Step 3: Column Minimization
 Job / Machine I II III IV
A 0 3 5 9
B 0 2 4 5
C 0 2 4 6
D 0 0 0 0
Size of Matrix = 4
No of Lines = 2
Size of Matrix = No of Lines
There is degeneracy.
Solution is not optimal
Minimum Change = 2
Job / Machine I II III IV
A 0 1 3 7
B 0 0 2 3
C 0 0 2 4
D 2 0 0 0
Size of Matrix = 4
No of Lines = 3
Size of Matrix = No of Lines
There is degeneracy.
Solution is not optimal
Minimum Change = 2
Job / Machine I II III IV
A 0 1 1 5
B 0 0 0 1
C 0 0 0 2
D 4 2 0 0

Size of Matrix = 4
No of Lines = 4
Size of Matrix = No of Lines
There is no degeneracy.
Solution is optimal.
Step 4: Assignment
Job / Machine I II III IV
A 0
B 0 0 0
C 0 0 0
D 0 0
There is an Alternate Solution.
Assignment 1 Assignment 2
J/M I II III IV J/M I II III IV
A 0 A 0
B 0 0 0 B 0 0 0
C 0 0 0 C 0 0 0
D 0 0 D 0 0
`
Step 5:
Assignment Schedule 1 Assignment Schedule 2
Jobs Machine Cost Jobs Machine Cost
A I 9 A I 9
B II 6 B III 8
C III 9 C II 7
D IV 0 D IV 0
Total Cost Rs. 24 Total Cost Rs. 24

Optimal Cost = Rs. 24

Q5. Time in Hrs
 Worker/Job J1 J2 J3 J4
W1 120 100 80 90
W2 80 90 110 70
W3 110 140 120 100
W4 90 90 80 90
Find the optimal total time
Is this a case of Alternate Solution? If yes, show Alternate
optimal Solution.
PROHIBITED MINIMIZATION PROBLEM
SOLUTION:
Step 1:
No. of Machines = 4
No. of vacant places = 5
No. of Machines = No. of vacant places
Problem is Unbalanced
Dummy Machine has to be added.
Machine / P Q R S T
VP
M1 9 11 15 10 11
M2 12 9 M 10 9
M3 M 11 14 11 7
M4 14 8 12 7 8
M5 0 0 0 0 0

Step2: Row Minimization

 Machine / A B C D E
VP
M1 0 2 6 1 2
M2 3 0 M 1 0
M3 M 4 7 4 0
M4 7 1 5 0 1
M5 0 0 0 0 0

Step 3: Column Minimization

Machine / A B C D E
VP
M1 0 2 6 1 2
M2 3 0 M 1 0
M3 M 4 7 4 0
M4 7 1 5 0 1
M5 0 0 0 0 0

Size of Matrix = 5
No of Lines = 5
Size of Matrix = No of Lines
There is no degeneracy.
Solution is optimal.
Step 4: Assignment
Machine / A B C D E
VP
M1 0
M2 0 0
M3 0
M4 0
M5 0 0 0 0 0

Step 5: Assignment Schedule:

 Machine Vacant Places Cost (in Hundreds)
M1 A 9
M2 B 9
M3 E 7
M4 D 7
M5 C 0
TOTAL COST 3200

OPTIMAL COST = RS. 3200

MAXIMIZATION BALANCED PROBLEM
Q6.
Step 1:
No of Salesman = 4
No. of Territories = 4
No of Salesman = No. of Territories
Problem is balanced.
SM / Ter T1 T2 T3 T4
S1 35 27 28 37
S2 28 34 29 40
S3 35 24 32 33
S4 24 32 25 28
Regret Matrix: Converting Maximization sum to
minimization sum OR Converting profit value to cost value
SM / Ter T1 T2 T3 T4
S1 5 13 12 3
S2 12 6 11 0
S3 5 16 8 7
S4 16 8 15 12
Step 2: Row Minimization
 SM / Ter T1 T2 T3 T4
S1 2 10 9 0
S2 12 6 11 0
S3 0 11 3 2
S4 8 0 7 4

Step 2: Column Minimization

SM / Ter T1 T2 T3 T4
S1 2 10 6 0
S2 12 6 8 0
S3 0 11 0 2
S4 8 0 4 4

Size of Matrix = 4
No of Lines = 3
Size of Matrix = No of Lines
There is degeneracy.
Solution is not optimal
Minimum Change = 2
SM / Ter T1 T2 T3 T4
S1 0 10 4 0
S2 10 6 6 0
S3 0 13 0 4
S4 6 0 2 4
Size of Matrix = 4
No of Lines = 4
Size of Matrix = No of Lines
There is no degeneracy.
Solution is optimal.
Step 4: Assignment
SM / Ter T1 T2 T3 T4
S1 0
S2 0
S3 0
S4 0

Step 5: Assignment Schedule

Salesman Territories Profit
S1 T1 35
S2 T4 40
S3 T3 32
S4 T2 32
Total Profit 139

Optimal Profit: Rs. 139

Q7. Maximize Profit: (in Rs. Lakhs)
SM / Ter T1 T2 T3 T4
S1 30 22 23 32
S2 23 29 24 35
S3 30 19 27 28
S4 19 27 20 23
Step 1:
No of Salesman = 4
No. of Territories = 4
No of Salesman = No. of Territories
Problem is balanced.

Regret Matrix:
 SM / Ter T1 T2 T3 T4
S1 5 13 12 3
S2 12 6 11 0
S3 5 16 8 7
S4 16 8 15 12

Step2: Row Minimization

SM / Ter T1 T2 T3 T4
S1 2 10 9 0
S2 12 6 11 0
S3 0 11 3 2
S4 8 0 7 4

Step3: Column Minimization

SM / Ter T1 T2 T3 T4
S1 2 10 6 0
S2 12 6 8 0
S3 0 11 0 2
S4 8 0 4 4
Size of Matrix = 4
No of Lines = 3
Size of Matrix = No of Lines
There is degeneracy.
Solution is not optimal
Minimum Change = 2

SM / Ter T1 T2 T3 T4
 S1 0 10 4 0
S2 10 6 6 0
S3 0 13 0 4
S4 6 0 2 2
Size of Matrix = 4
No of Lines = 4
Size of Matrix = No of Lines
There is no degeneracy.
Solution is optimal.
Step 4: Assignment
SM / Ter T1 T2 T3 T4
S1 0
S2 0
S3 0
S4 0

Step 5: Assignment Schedule

Salesman Territories Profit (in Rs. Lakhs)
S1 T1 30
S2 T4 35
S3 T3 27
S4 T2 27
Total Profit 119

Optimal Profit : Rs. 119 lakhs

MAXIMIZATION UNBALANCED PROBLEM

Q8.
Step 1:
No. of Executive = 4
No of Territory = 3
No. of Executive = No of Territory
Problem is unbalanced
Dummy Territory has to be added
EX / Ter T1 T2 T3 T4
S1 60 67 90 0
S2 80 83 95 0
S3 70 72 82 0
S4 85 95 110 0

Regret Matrix:
EX / Ter T1 T2 T3 T4
S1 50 43 20 110
S2 30 27 15 110
S3 40 38 28 110
S4 25 15 0 110

Step2: Row Minimization

EX / Ter T1 T2 T3 T4
S1 30 23 0 90
S2 15 12 0 95
S3 12 10 0 82
S4 25 15 0 110

Step3: Column Minimization

 EX / Ter T1 T2 T3 T4
S1 18 13 0 8
S2 3 2 0 13
S3 0 0 0 0
S4 13 5 0 28
Size of Matrix = 4
No of Lines = 2
Size of Matrix = No of Lines
There is degeneracy.
Solution is not optimal
Minimum Change = 2
EX / Ter T1 T2 T3 T4
S1 16 11 0 6
S2 1 0 0 11
S3 0 0 2 0
S4 11 3 0 26
Size of Matrix = 4
No of Lines = 3
Size of Matrix = No of Lines
There is degeneracy.
Solution is not optimal
Minimum Change = 1
EX / Ter T1 T2 T3 T4
S1 15 11 0 5
S2 0 0 0 10
S3 0 1 3 0
S4 10 3 0 25

Size of Matrix = 4
No of Lines = 3
Size of Matrix = No of Lines
There is degeneracy.
Solution is not optimal
Minimum Change = 3
EX / Ter T1 T2 T3 T4
S1 12 8 0 2
S2 0 0 3 10
S3 0 1 6 0
S4 7 0 0 22
Size of Matrix = 4
No of Lines = 4
Size of Matrix = No of Lines
There is no degeneracy.
Solution is optimal.
Step 4: Assignment
EX / Ter T1 T2 T3 T4
S1 0
S2 0
S3 0
S4 0
Step5. Assignment Schedule
Executive Territories Profit (in Rs. Thousand)
S1 T3 90
S2 T1 80
S3 T4 0
S4 T2 95
Total Profit 265

Optimal Profit = Rs. 265 Thousand

April 2019
Q9.
Step1:
No. of Jobs = 5
No. of person = 4
No of Jobs = No. of Person
Problem is unbalanced
Dummy person has to be added.
(In Rs. Thousand)
Person / Job J1 J2 J3 J4 J5
P1 27 18 M 20 21
P2 31 24 21 12 17
P3 20 17 20 M 16
P4 22 28 20 16 27
P5 0 0 0 0 0

Step 2. Row Minimization:

Person / Job J1 J2 J3 J4 J5
P1 9 0 M 2 3
P2 19 12 9 0 5
P3 4 1 4 M 0
P4 6 12 4 0 11
P5 0 0 0 0 0

Step 2. Column Minimization:

Person / Job J1 J2 J3 J4 J5
P1 9 0 M 2 3
P2 19 12 9 0 5
P3 4 1 4 M 0
P4 6 12 4 0 11
P5 0 0 0 0 0
Size of Matrix = 5
No of Lines = 4
Size of Matrix = No of Lines
There is degeneracy.
Solution is not optimal.
Minimum Change = 4
Person / Job J1 J2 J3 J4 J5
P1 5 0 M 2 3
P2 15 12 5 0 5
P3 0 1 0 M 0
P4 2 12 0 0 11
P5 0 4 0 4 4
Size of Matrix = 5
No of Lines = 5
Size of Matrix = No of Lines
There is no degeneracy.
Solution is optimal.
Step4: Assignment
Person / Job J1 J2 J3 J4 J5
P1 0
P2 0
P3 0 0 0
P4 0 0
P5 0 0
Step 5. Assignment Schedule
Person Jobs Cost (in Rs. Thousand)
P1 J2 18
P2 J4 12
P3 J5 16
P4 J3 20
P5 J1 0
Total Cost 66
Optimal Cost = Rs. 66000