Scribd
Upload
59 views33 pages

Or - Assignment

The document discusses assignment problems in operations research which aim to assign jobs to machines in a way that minimizes total cost by using techniques like the Hungarian method; it provides examples of solving balanced and unbalanced assignment problems using row and column operations and addresses special cases like restrictive and profit maximizing assignment problems.

Uploaded by

Manas Jain
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
59 views33 pages

Or - Assignment

The document discusses assignment problems in operations research which aim to assign jobs to machines in a way that minimizes total cost by using techniques like the Hungarian method; it provides examples of solving balanced and unbalanced assignment problems using row and column operations and addresses special cases like restrictive and profit maximizing assignment problems.

Uploaded by

Manas Jain
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 33

Assignment Problems

• Assignment problems in Operations Research are used to find out the


best pair of assignment of jobs to the machines so as to minimise
the total cost of assignment.
• Name of the technique used here is Hungarian Technique
• We need to have a balanced assignment problem means the given
matrix should be a square matrix ( number of rows must be equal to
number of columns)
• The assignment of jobs to machines is to done on one to one basis.
(that is one job should be assigned to only one machine or one
machine gets only one job)
Nature of assignment problem.

  I II III IV

A C11 C12 C13 C14

B C21 C22 C23 C24

C C31 C32 C33 C34

D C41 C42 C43 C44


Procedure of Assignment technique
• Check the given problem is balanced or not (If number of are equal to number of
columns, then the given problem is said to be a balanced assignment problem)
• Do row operations (Subtract the minimum value in each row from all the other
values of the same row and repeat the same for all the other rows)
• Do column operations (Subtract the minimum value in each column from all the
other values of the same column and repeat the same for all the other columns)
• Do the assignments by observing zeros, row by row and column by column
• You are permitted to do an assignment only when one zero is present and strike of
the column if assignment is done while observing the row and strike of the row if
assignment is done while observing the column
• After all rows and columns are observed, check for the assignments obtained
• If obtained number of assignments are equal to the number of required
assignments ( equal to the size of the matrix), stop there as the required solution is
obtained
• If required number of assignments are not obtained, that is obtained number of
assignments are less than the size of the matrix, and no zeros are present among
unstriked elements, then we need to go to next iteration.
Example 1 : Find the best pair of assignment of jobs to the machines for
minimising the
total cost of assignment

  I II III IV

A 8 26 17 11

B 13 28 4 26

C 38 19 18 15

D 19 26 24 10
Row operation: Subtract the minimum value in
each row from all the other values of the same
row and repeat the same for all the other rows

0 18 9 3

9 24 0 22

23 4 3 0

9 16 14 0
Column operation: Subtract the minimum value in
each column from all the other values of the same
column and repeat the same for all the other columns

0 14 9 3

9 20 0 22

23 0 3 0

9 12 14 0
Solution for example 1:

Optimal pair of assignments Cost


A-I 8
B - III 4
C - II 19
D - IV 10
Total Cost 41
Example 2

  I II III IV

A 15 25 35 20

B 21 27 33 17

C 17 25 37 15

D 14 31 39 21
Row operation:

  I II III IV

A 0 10 20 5

B 4 10 16 0

C 2 10 22 0

D 0 17 25 7
Column operation:

  I II III IV

A 0 0 4 5

B 4 0 0 0

C 2 0 6 0

D 0 7 9 7
Solution for example 2:

Optimal pair of assignments Cost

A - II 25

B - III 33

C - IV 15

D-I 14

Total cost 87
Example 3:
Example 3:
Going to next iteration
We need to go to the next iteration when we are not able to
get the required number of assignments initially and no
zeros are present among all unstriked elements

The following steps need to be carried out for going to the


next iteration
• Identify the minimum value among all unstriked elements
• Subtract that minimum value from all unstriked elements
• Add that minimum value to all intersection elements
• Striked off elements remain same
Example 3:
Example 3: Solutions : Multiple optimal solutions
are possible some times (especially when we go
for trial and error method)

Optimal cost Optimal cost


assignment assignment
A-I 8 A-I 8
B - II 11 B - IV 8
C - III 5 C - II 6
D - IV 7 D - III 9
Total 31 Total 31
Unbalanced Assignment problem

  P Q R S T

A 6 2 5 2 6

B 2 4 7 8 8

C 7 8 6 9 8

D 6 2 3 4 5

E 9 3 8 9 7

F 4 7 4 6 8
Unbalanced Assignment problem example
Unbalanced Assignment problem example
SOLUTION

 Pair of  Cost
assignments

 A-S  2
 B-P  2
 C-DUMMY  0

 D-T  5
 E-Q  3
 F-R  4
Total 16
Special cases of AP
• Unbalanced AP
• Restrictive AP
• Profit maximisation in AP
Unbalanced Assignment problem

  P Q R S T

A 6 2 5 2 6

B 2 4 7 8 8

C 7 8 6 9 8

D 6 2 3 4 5

E 9 3 8 9 7

F 4 7 4 6 8
Unbalanced Assignment problem example
Unbalanced Assignment problem example
SOLUTION

 Pair of  Cost
assignments

 A-S  2
 B-P  2
 C-DUMMY  0

 D-T  5
 E-Q  3
 F-R  4
Total 16
Restrictive AP
A job shop has purchased three new machines of different
specification. The job shop has four location available for installing
these three new machines. The estimated installation cost matrix is as
given below. Determine the best pair of assignment of machines to the
locations so as to minimise the total cost of installation by using
Hungarian technique

  1 2 3 4

A 13 10 12 11

B 15 - 13 20

C 5 7 10 6
Restrictive AP
Profit maximisation problem in AP
• Profit matrix:

  P Q R S

A 42 35 28 21

B 30 25 20 15

C 30 25 20 15

D 24 20 16 12
Profit maximisation problem in AP:
Equivalent cost matrix

  I II III IV

A -42 -35 -28 -21

B -30 -25 -20 -15

C -30 -25 -20 -15

D -24 -20 -16 -12


Profit maximisation problem in AP
Profit maximisation problem in AP
Profit maximisation problem in AP
Traveling salesman problem
• Profit matrix:
Route for traveling salesman – A-C-B-D-A
  A B C D

A - 35 28 21

B 30 - 20 15

C 30 25 - 15

D 24 20 16 -

You might also like