Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
33 views

Assignment Problem: Unbalanced and Maximal Assignment Problems

This document summarizes unbalanced and maximal assignment problems. For unbalanced problems where the number of rows and columns are unequal, zeros are added to make the matrix balanced. The example shows a 4 machine, 3 job problem with costs in a table. The reduced matrix finds a minimum cost of Rs. 50 by assigning jobs A, B, C to machines 1, 2, 3. Maximal problems aim to maximize total profit. A 5 machine, 5 job problem matrix lists return amounts. The reduced matrix finds the optimal assignment of jobs C, E, D, B, A to machines 1, 2, 3, 4, 5 yields maximum profit of Rs. 50.

Uploaded by

Safwan mansuri
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
33 views

Assignment Problem: Unbalanced and Maximal Assignment Problems

This document summarizes unbalanced and maximal assignment problems. For unbalanced problems where the number of rows and columns are unequal, zeros are added to make the matrix balanced. The example shows a 4 machine, 3 job problem with costs in a table. The reduced matrix finds a minimum cost of Rs. 50 by assigning jobs A, B, C to machines 1, 2, 3. Maximal problems aim to maximize total profit. A 5 machine, 5 job problem matrix lists return amounts. The reduced matrix finds the optimal assignment of jobs C, E, D, B, A to machines 1, 2, 3, 4, 5 yields maximum profit of Rs. 50.

Uploaded by

Safwan mansuri
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Lecture 19

Assignment problem :
Unbalanced and maximal Assignment Problems

19.1 Unbalanced Assignment Problems


If the number of rows and columns are not equal then such type of problems are called as
unbalanced assignment problems.

Example
A company has 4 machines on which to do 3 jobs. Each job can be assigned to one and only one
machine. The cost of each job on each machine is given in the following table

Machines
W X Y Z
A 18 24 28 32
Jobs
B 8 13 17 19
C 10 15 19 22

Solution
18 24 28 32
8 13 17 19
10 15 19 22
0 0 0 0

Row Reduced matrix


0 6 10 14
0 5 9 11
0 5 9 12
0 0 0 0

I Modified Matrix

N < n i.e. 2 < 4

II Modified Matrix

1
N < n i.e. 3 < 4

III Modified Matrix

N=n

Zero assignment

Multiple assignments exists

Solution -I

Minimum cost = 18 + 13 + 19 = Rs 50

Solution -II

Minimum cost = 18 + 17 + 15 = Rs 50

2
19.2 Maximal Assignment Problem

Example
A company has 5 jobs to be done. The following matrix shows the return in terms of rupees on
assigning ith ( i = 1, 2, 3, 4, 5 ) machine to the jth job ( j = A, B, C, D, E ). Assign the five jobs to
the five machines so as to maximize the total expected profit.

Jobs
A B C D E
1 5 11 10 12 4
2 2 4 6 3 5
Machines
3 3 12 5 14 6
4 6 14 4 11 7
5 7 9 8 12 5

Solution

Subtract all the elements from the highest element


Highest element = 14

9 3 4 2 10
12 10 8 11 9
11 2 9 0 8
8 0 10 3 7
7 5 6 2 9

Row Reduced matrix

7 1 2 0 8
4 2 0 3 1
11 2 9 0 8
8 0 10 3 7
5 3 4 0 7

I Modified Matrix

N < n i.e. 3 < 5

II Modified Matrix

3
N < n i.e. 4 < 5

III Modified Matrix

N=n

Zero assignment

Optimal assignment 1 C 2 E 3 D 4 B 5 A
Maximum profit = 10 + 5 + 14 + 14 + 7 = Rs. 50

You might also like