Operation Research Assignment problem Introduction of assignment problem objective of assignment problem methods of assignment problem (Hungarian method)

hod) special case in assignment problem 1. unbalanced 2. maximization 3. prohibited 4. delegacy 5. travelling sales man problem

Assignment problem is special type of problem which deals in allocating the various resources or items to various activities on one to one basis in such a way that the time or cost involved is minimized and sales or profit is maximized. Example: sales force to different region Different bus to different routes Different machine to different jobs Different people to different job Assumption: 1. number of row should be equal to number of column. 2. One person should be assigned only one job & vice versa.

Hungarian method of assignment Step 1:Starting with the first row ,locate the smallest cost element in each row of the cost table,now substract this smallest elements from each elements in this row. Step 2:Consider each column an locate the smallest element in it.Substract the smallest element in each column from every element of the column.

Page 1 of 3

Step 3:Make the assignment ( a).Examine the row successively until a row with exactly one zero is found make an assignment to this single zero by putting square around it and cross out all othe zero appearing in the corresponding column as they will not be used to make any other assignment in that column. ( b).Examine the column successively until a column with exactly one zero is found.make an assignment to this single zero by putting square around it and cross out all other zero appearing in the corresponding row. Step 4:Draw horizontal and vertical lines necessary to cover all the zero. ( a).Mark all rows that do not have any assignment. ( b).Draw straight line through all unmarked row and marked column.

Step 5:Select the smallest element among all the uncovered elements.substract this smallest elements from all uncovered elements and add it to the element which lies at the intersection of two lines and repeat the step 3 to get the required assignments. Special case in assignment problem. Maximization case in assignment problem In some cases the pay off elements of the assignments problem May represent revenue or profit instead of cost so that the objective will be maximize total revenue or profit. The problem of maximization can be converted into minimization case by selecting the largest elements among all elements of the profit matrix and then subtracting it from all other elements in the matrix including itself and then we can placed as usual and obtain the optimum solution. Travelling sales man problem Travelling salesman problem is very similar to the assignment problem.

Page 2 of 3

Unbalanced assignment problem When number of row are not equal to the number of column, the assignment problem is called unbalanced assignment problem .in such case dummy row or column are added in matrix to make at a square matrix . For example: If five worker are not be assigned to six machine a dummy low is simple added .the cost or time associated with this dummy row or column is assigned is zero element in the matrix. Prohibited assignment problem Some time due to certain reason an assignment cannot be made in a particular cell for example a particular machine cannot be installed at a particular to perform .to resolve this we put as to avoid assignment in those all where there in a restriction of assignment

Page 3 of 3