Scribd
Upload
41 views

Assignment Problem: Presented by Apurva Kumar Saurav Sharma Sashanka Kumar Sahu

The document summarizes different types of assignment problems: 1. Cost minimization problem - The goal is to assign jobs to workers to minimize total cost. The document shows an example problem being solved through row-wise and column-wise reduction to find the optimal assignment. 2. Maximization problem - The goal is to assign jobs to workers to maximize total profit or value. Again, an example is provided and solved using the same reduction approach. 3. Unbalanced and constrained problem - This type of problem has an unequal number of jobs and workers. It is solved by adding a dummy row or column and applying the reduction method to find the optimal assignment covering the most zeros.

Uploaded by

saurav axle
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
41 views

Assignment Problem: Presented by Apurva Kumar Saurav Sharma Sashanka Kumar Sahu

The document summarizes different types of assignment problems: 1. Cost minimization problem - The goal is to assign jobs to workers to minimize total cost. The document shows an example problem being solved through row-wise and column-wise reduction to find the optimal assignment. 2. Maximization problem - The goal is to assign jobs to workers to maximize total profit or value. Again, an example is provided and solved using the same reduction approach. 3. Unbalanced and constrained problem - This type of problem has an unequal number of jobs and workers. It is solved by adding a dummy row or column and applying the reduction method to find the optimal assignment covering the most zeros.

Uploaded by

saurav axle
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 19

Assignment Problem

Presented by
Apurva Kumar
Saurav Sharma
Sashanka Kumar Sahu
1. Cost Minimization problem
Question :-
Jobs

A B C D
1 22 27 16 0
2 10 25 4 12
Workers
3 18 15 19 3
4 26 22 7 22
Solution :-
First row wise reduction,
Jobs

A B C D

1 22 27 16 0

Workers 2 6 21 0 8

3 15 12 16 0

4 19 15 0 15
Then Column wise reduction,
Jobs

A B C D

1 16 15 16 0

Workers 2 0 9 0 8

3 9 0 16 0

4 13 3 0 15
Now draw the lines,
Jobs

A B C D

1 16 15 16 0

Workers 2 0 9 0 8

3 9 0 16 0

4 13 3 0 15
Now, total no.of lines = No.of rows or columns
Therefore, the solution is optimal.

For finding the total cost we take the original


values.

Total cost = 0+10+15+7 = 32


2. Maximisation problem
Question :-

J1 J2 J3 J4

A 45 40 51 67

B 57 42 63 55

C 49 52 48 64

D 41 45 60 45
Solution :-

Reduction of all the values by the highest no. which is 67.

J1 J2 J3 J4

A 22 27 16 0

B 10 25 4 12

C 18 15 19 3

D 26 22 7 22
Now we do row wise reduction,

J1 J2 J3 J4

A 22 27 16 0

B 6 21 0 8

C 15 12 16 0

D 19 15 0 15
Column wise Reduction,

J1 J2 J3 J4

A 16 15 16 0

B 0 9 0 8

C 9 0 16 0

D 13 3 0 15
Now we draw the lines,

J1 J2 J3 J4

A 16 15 16 0

B 0 9 0 8

C 9 0 16 0

D 13 3 0 15
As the no.of lines = the no.of rows or columns,
The solution is optimal.
Now we take the original values to calculate the
maximum profit.

Total = 67+57+52+60 = 236


Therefore, maximised profit = 236
3. Unbalanced as well as constrained
problem
Question :-

J1 J2 J3 J4 J5

P1 27 18 X 21 20

P2 31 24 21 12 17

P3 20 17 20 X 16

P4 22 28 20 16 27
Solution :-

Here we have 5 columns and 4 rows. There is 1 row less so we


have to add 1 dummy row P5.

J1 J2 J3 J4 J5
P1 27 18 X 21 20
P2 31 24 21 12 17
P3 20 17 20 X 16
P4 22 28 20 16 27
P5 0 0 0 0 0
Dummy Row
Now, we do row wise reduction

J1 J2 J3 J4 J5

P1 9 0 X 3 2

P2 19 12 9 0 5

P3 4 1 4 X 0

P4 6 12 4 0 11

P5 0 0 0 0 0
Column wise reduction

J1 J2 J3 J4 J5

P1 9 0 X 3 2

P2 19 12 9 0 5

P3 4 1 4 X 0

P4 6 12 4 0 11

P5 0 0 0 0 0
Now, we draw the lines covering the maximum no.of
0’s.

J1 J2 J3 J4 J5

P1 9 0 X 3 2

P2 19 12 9 0 5

P3 4 1 4 X 0

P4 6 12 4 0 11

P5 0 0 0 0 0

Minimum Value
Here the no.of columns or rows are 5 but the lines
are only 4 so, we have to again draw the line.

J1 J2 J3 J4 J5

P1 9 0 X 7 2

P2 15 8 5 0 1

P3 4 1 4 X 0

P4 2 8 0 0 7

P5 0 0 0 4 0
Now, as the no.of columns or rows = no.of lines
The solution is optimal.
We consider the original values corresponding to the 0’s marked in red.

Total Cost = 0+18+20+12+16 = 66

You might also like