Scribd
Upload
3K views10 pages

Assumptions in Assignment Problem

The document discusses the assignment problem in linear programming. The assignment problem aims to minimize the cost or time of completing a number of jobs by assigning each job to a unique person or machine. The document outlines the assumptions and Hungarian method for solving assignment problems. It provides steps for using the Hungarian method, which involves identifying minimum elements and making deductions to arrive at an optimal assignment. An example is given to demonstrate applying the Hungarian method to assign five jobs to five persons to minimize the total time. The optimal assignment achieved a total time of 175 minutes.

Uploaded by

Darya Memon
Copyright
© Attribution Non-Commercial (BY-NC)
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
3K views10 pages

Assumptions in Assignment Problem

The document discusses the assignment problem in linear programming. The assignment problem aims to minimize the cost or time of completing a number of jobs by assigning each job to a unique person or machine. The document outlines the assumptions and Hungarian method for solving assignment problems. It provides steps for using the Hungarian method, which involves identifying minimum elements and making deductions to arrive at an optimal assignment. An example is given to demonstrate applying the Hungarian method to assign five jobs to five persons to minimize the total time. The optimal assignment achieved a total time of 175 minutes.

Uploaded by

Darya Memon
Copyright
© Attribution Non-Commercial (BY-NC)
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/ 10

Assignment Problem in Linear programming

The assignment problem is a special type of transportation problem, where the objective is to minimize the cost or time of completing a number of jobs by a number of persons. Assumptions in Assignment problem Number of jobs is equal to the number of machines or persons. q Each man or machine is assigned only one job. q Each man or machine is independently capable of handling any job to be done. q Assigning criteria is clearly specified (minimizing cost or maximizing profit).
q

8/2/12

1 1

Hungarian Method It is an efficient method for solving assignment problems . This method is based on the following principle: If a constant is added to, or subtracted from, every element of a row and/or a column of the given cost matrix of an assignment problem, the resulting assignment problem has the same optimal solution as the original problem.

8/2/12

2 2

Steps
1.

Identify the minimum element in each row and subtract it from every element of that row. Identify the minimum element in each column and subtract it from every element of that column. Make the assignments for the reduced matrix obtained from steps 1 and 2 in the following way: i. For each row or column with a single zero value cell that has not be assigned or eliminated, box that zero value as an assigned cell. ii. For every zero that becomes assigned, cross out (X) all other zeros in the same row and the same column. iii. The above process may be continued until every zero cell is either assigned or crossed (X).
8/2/12 3 3

1.

1.

5.

Draw the minimum number of vertical and horizontal lines necessary to cover all the zeros in the reduced matrix. 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.

5.

Go to step 3 and repeat the procedure until you arrive at an optimal assignment.

8/2/12

4 4

Example
Following table shows required number of minutes for five persons to complete four jobs. Assign each job to a person working simultaneously. So that total time is minimum.

Person 1 2 3 4 5

Mixin PouringCompacti Finishi g4 ng 2 ng 5 6


0 3 8 3 7 4 2 3 9 4 62 6 0 6 2 6 1 3 2 7 2 8 2 2 2 2 7 5 8 5 6 5 5 6 0

8/2/12

5 5

Dummy activity will be added to equate the number of jobs to the number of persons.

Subtract minimum value of the row from that row. Subtract minimum value of column from that column. Check weather optimal solution is possible.

Perso Mixin Pouring Compacti Finishi Dumm n g4 ng 2 ng 5 y 0 6 4 3 7 1 3 0 4 1 2 0 2 3 4 5 1 0 5 2


3 8

2 0 2 1

62 6 0 6 2 6 1

5 6 0 0

2 7

3 1 0 5

5 8 5 6 5 5 6 0

0 0 0 0

0 0 0 0

3 7 4 2 3 9

2 8 2 2 2 2

8/2/12

6 6

Cover zero with minimum lines Select minimum valued uncovered element Deduct that element from all uncovered elements Add the element to all crossing points

Perso Mixin Pouring Compacti Finishi Dumm n g4 ng 2 ng 5 y 0 6 4 3 7 1 3 0 4 1 2 0 2 3 4 5 1 0 5 2


3 8

2 0 2 1

62 6 0 6 2 6 1

5 6 0 0

2 7

3 1 0 5

5 8 5 6 5 5 6 0

0 0 0 0

0 0 0 0

3 7 4 2 3 9

2 8 2 2 2 2

8/2/12

7 7

Perso n 1 2 3 4 5

Mixin Pouring Compacti Finishi Dumm g4 ng 2 ng 5 y 0 6 4 3 7 3 0 4 1 2 0 3 2 62 0 5 7 3 1 8 2 5 8 0 0 6 2 5 0 3 0 6 1 0 7 0 8 6 5 4 2 0 6 0 2 0 5 0 2 2 2 5 2 3 1 0 6 0 2 5 6 0


9 1 2 0

Perso Mixin Pouring Compacti Finishi Dumm n g ng 2 ng5 y 0 4 6 4 3 7 1 2 0 3 0 1 0 2 3 4 5 0 0 5 2


3 8

1 0 2 1

62 6 0 6 2 6 8/2/12 1

4 6 0 0

2 7

2 1 0 5

5 8 5 6 5 5 6 0

0 1 1 1

0 0 0 0

3 7 4 2 3 9

2 8 2 2 2 2

8 8

Perso Mixin Pouring Compacti Finishi Dumm n g ng 2 ng5 y 0 4 6 0 4 3 7 1 2 0 3 0 1 2 3 4 5


q

3 8

1
0

62 6 0 6 2 6 1

4 6 0
0

2 7

2 1
0

5 8 5 6 5 5 6 0

0 1 1 1

0 0 0 0

0 5 2

3 7 4 2 3 9

2 8 2 2 2 2

2 1

For each row or column with a single zero value cell that has not be assigned or eliminated, box that zero value as an assigned cell. For every zero that becomes assigned, cross out (X) all other zeros in the same row and the same column. 8/2/12 9
9

Person 1 2 3 4 5

Mixin PouringCompacti Finishi g4 ng 2 ng 5 6


0 3 8 3 7 4 2 3 9 4 62 6 0 6 2 6 1 3 2 7 2 8 2 2 2 2 7 5 8 5 6 5 5 6 0

Total Time = 38 + 60 + 55 + 22 = 175 minutes

8/2/12

10 10

You might also like