Adobe Scan 19-May-2023
Adobe Scan 19-May-2023
Adobe Scan 19-May-2023
In Xnn
Table
Jobs
Persons 1 2 3 4
A 5 2 8
B 0 3 8 2
C 2 4 7
D 2 1 1
Step 2
ldentify the minimum element in each column
and subtract it from every element of that
column.
Jobs
Persons 1 2 3 4
A 5 7
B 3 7
C 2 3 6
D 2 0 0
Make the assignment for the reduced matrix
obtain from steps 1 and 2 in the following
way:
Jobs
Persons 1 2 3
A 5 1 7
B 3 7 1
C 2 3 6
D 2
Draw the minimum number of vertical and
horizontal lines necessary to cover all the
zeros in the reduced matrix obtained from
last step
Jobs
Persons 1 2 3 4
A 5 1 7
B 3 7 1
D
Select the smallest element from all| the
uncovered elements. Subtract this smallest
element from all the uncovered elements and
add it to the elements, which lie at the
intersection of two lines. Thus, we obtain
another reduced matrix for fresh assignment.
Jobs
Persons 1 2 3
A 4 6
B 0 2 6
3 3 6
D 3
Jobs
Persons 1 2 3 4
A 4 6
B 2 6
C 3 3 6
D 3
B 13 28 14 26
C 38 19 18 15
D 19 26 24 10
Men
Persons 1 2 3 4
A 7 11 5
B oo 11 o 13
C 23 2
D 12 13
15
D
Maximisation case in Assignment Problem
Some assignment problems entail
maximizing the profit, effectiveness, or layoff
of an assignment of persons to taskS or of
jobs to machines.
The conversion is accomplished by
subtracting all the elements of the given
effectiveness matrix from the highest
element.
It turns out that minimizing opportunity loss
produces the same assignment solution as
the original maximization problem.
Five different machines can do any of the five
required jobs, with different profits resulting
from each assignment as given below:
Machines
Jobs A B C D E
1 30 37 40 28 40
2 40 24 27 21 36
3 40 32 33 30 35
25 38 40 36 36
5 29 62 41 34 39
Find out the maximum profit
possible through
optimusignment.
Here, the highest element is 62.
subtract each value from 62.
Machines
Jobs A B C D E
1 32 25 22 34 22
2 22 38 35 41 26
3 22 30 29 32 27
37 24 22 26 26
33 21 28 23
Machines (Profit-matrix)
workers IV VI VII
A 40 40 35 25 50
B 42 30 16 25 27
C 50 48 40 60 50
D 20 19 20 18 25
E 58 60 59 55 53
Persons 1 2 3 4
A 20 25 22 28
15 18 23 17
19 17 21 24
A 20 25 22 28
B 15 18 23 17
C 19 17 21 24
D
(dummy)
Example8. In a typical assignment problem, four different
machines are to be assigned to three different jobs with the
restriction that exactly one machine is allowed for each job.
The associated costs (in rupees "000) are as follows:
Jobs
Persons 1 2 3
|A 60 80 50
B 50 30 60
|C 70 90 40
|D 80 50 70