Professional Documents
Culture Documents
Special - purpose algorithm used in linear programming. Objective : To find assignment : Which job should be assigned to which worker (machine) so that cost for performing all the jobs should be minimized OR profit after performing the jobs should be maximize.
Basic Characteristics
1. Number of jobs should be equal to number of workers (machines). 2. One job should be assigned to one worker (machine) OR One worker (machine) should be assigned with one job. 3. Every worker is able to do every kind of jobs.
Assignment Method
Assignment Method is also known as Floods technique or the Hungarian method, provides much more efficient method of solving assignment problems.
Machine X 25(cost)
Machine Y 31
Machine Z 35
Job A
Job B
Job C
15
22
20
19
24
17
Machine X 0 0
Machine Y 6 5
Machine Z 10 9
Job A Job B
Job C
Machine X
Machine Y
Machine Z
Job A
Job B Job C
0
0 5
4
3 0
10
9 0
Machine X
Machine Y
Machine Z
Job A
Job B Job C
0 0
5
4
3 0
10
9 0
Machine X 0 0 5
Machine Y 4
Machine Z 10
Job A
Job B
Job C
3
0
9
0
To
From
Machine X
0 0 5
Machine Y
4 3
Machine Z
10 9 0
Minimum value is 3
From
Machine X
0
Machine Y 1
0
Machine Z 7 6
0
0 8
Now, we see that, Job A assigned to Machine X with cost 25 Job B assigned to Machine Y with cost 20 Job C assigned to Machine Z with cost 17 Total cost is (25+20+17 = 62) to assign jobs to different machines.
A
B C D E
$3,000
3,500 2,800 3,300 2,800
$2,500
3,000 2,900 3,100 3,500
$3,300
2,800 3,900 3,400 3,600
$2,600
2,800 2,300 2,900 2,900
$3,100
3,300 3,600 3,500 3,000
Heidi wishes to determine which bid to accept from each of the five bidders so that each of them can purchase one vehicle while the total of the five Accepted bids is a maximum.
A
B C D
$900
400 1100 600
$1400
900 1000 800
$600
1100 0 500
$1300
1100 1600 1000
$800
600 300 400
1100
400
300
1000
900
Now, the above problem is Minimization Problem, which can be Solved as the earlier method.
Restrictions On Assignment
Problem Type I
Problem : In the modification of a plant layout of a factory four new machines M1, M2, M3 & M4 are to be installed in a machine shop. There are five vacant places A, B, C, D & E available. Because of limited space, machine M2 cannot be placed at C and M3 cannot be placed at A. The cost of locating of machine I to place j in rupees is shown below. Find the optimal assignment schedule. A 9 12 14 B 11 9 11 8 C 15 14 12 D 10 10 11 7 E 11 9 7 8
M1 M2 M3 M4
B 2
0
C 6 M 7 5
0
D 1 1 4
0
E 2 0
0
3 M 7 0
4 1 0
1 0
Machine M1 will be placed at A with cost of 9 Machine M2 will be placed at B with cost of 9 Machine M3 will be placed at E with cost of 7 Machine M4 will be placed at D with cost of 7 Dummy machine will be placed at C with cost 0
Total Cost = 9+9+7+7+0 = 32
Problem Type II
Problem : A salesman has to visit five cities A, B, C, D and E. The intercity distances are tabulated below : From/To A B C D E A 12 24 25 15 B 6 16 18 7 C 10 11 18 12 D 14 17 22 16 E 12 13 23 25 Note that the distance (in km.) between two cities need not be same both ways. If the salesman starts from city A and has to come back to city A, which route would you advise him to take so that total distance travelled by him is minimized?
A 6 10 14 12
B 12 11 17 13 B 0 M 1 3 1
C 24 16 22 23 C 12 10 M 8 11
D 25 18 18 25 D 13 12 8 M 13
E 15 7 12 16 E 3 1 2 2 M
A B C D E Step I (a)
From To
A M 0 0 0 0
A B C D E
A M 0 0 0 0
B 0 M 1 3 1 B
0
C 4 2 M 0 3 C 4 2 M
0
D 5 4 0 M 5 D 5 4
0
E 2 0 1 1 M E 2
0
A B C D E Step II
To From
A M 0 0 0
0
A B C D E
M 1 3 1
1 1 M
M 5
A M 0 0
B
0
C 4
2
D 5 4
0
E 2 0 1
1
A B C
M 1
D
E
0
0
3
1
0
3
M
5
The next minimum (non zero) element in the matrix is 1. So, we try into the solution. Another schedule can be : AB, B E, E C, CD, DA involving distance of 12+7+23+18+14 = 74 km.
Earlier routing was involving 71 km. is the shortest, but it does not satisfy the restrictions.