Assignment Model Approach to Man-Job Matching Using Hungarian Method K. I.

Abumere Department of Production Engineering, University of Benin, Edo State, Nigeria.

Abstract Assignment problem refers to the class of LP problems that involve determining the most efficient assignment of people to projects, salespeople to territories, contracts to bidders, jobs to machines, vehicles to routes, operators to machines, offices to personnel etc. In this paper, a notion of assignment model approach to man-job matching using Hungarian method is presented. The results obtained in solving the generalized assignment problem examine the maximum profit of assignment of jobs to agents. Therefore, each job is assigned to precisely one agent subject to capacity restrictions on the agents. Finally, a theoretical brief flow chart for assignment problem was provided. Keywords: Assignment, Hungarian, maximum 1 Introduction

Imagine, if in a factory there is one machine and one operator is there to operate. How would you employ the worker? Your immediate answer will be, the available operator will operate the machine. Again, suppose there are machines in the factory and two operators are engaged at different rates to operate them. Which operator should operate which machine for maximizing profit? Similarly, if there are n machines available and n persons are engaged at different rates to operate them. Which operator should be assigned to which machine to ensure maximum efficiency? While answering the above questions we have to think about the interest of the productivity, so we have to fine such an assignment by which the factory gets maximum profit on minimum investment. Such problems are known as assignment problems. In this paper, such problems are presented. Assignment problem is a special type of linear programming problem where the objective is most often to minimize total costs or total time of performing the tasks at hand. One important characteristic of assignment problems is that only one job or worker is assigned to one machine or project. Application Areas of Assignment Problem Though assignment problem finds applicability in various diverse business situations, some of its main application areas are: i. In assigning machines to factory workers.

ii. iii. iv. v.

In assigning sales/marketing people to sales territories. In assigning contracts to bidders by systematic bid-evaluation. In assigning teachers to classes. In assigning accountants to accounts of the clients.

Solution Methods The assignment problem can be solved by the following four methods: Enumeration method Simplex method Transportation method Hungarian method Enumeration Method In this method, a list of all possible assignments among the given resources and activities is prepared. Then an assignment involving the minimum cost, time, distance or maximum profit is selected. If two or more assignments have the same minimum cost, time or distance then the problem has multiple optimal solutions. This method can be used only if the number of assignment is less. It becomes unsuitable for manual calculations if number of assignments is large. Simplex Method An assignment problem can be formulated as a linear program, and the simplex method can be used to solve it. However, sometimes the simplex method is inefficient for assignment problems (particularly problems with a high degree of degeneracy). Transportation Method Assignment problem is a special case of transportation problem; therefore, it can also be solved using transportation method. But the degeneracy problem of solution makes the transportation method computationally inefficient for solving the assignment problem. Hungarian Method This method was developed by D. Kuhn, a Hungarian mathematician and is therefore known as the Hungarian method of assignment problem. In order to use this method, one needs to know only the cost of making all possible assignments. Each assignment problem has a matrix (table) associated with it. Normally, the objects (or people) one wishes to assign are expressed in rows, whereas the columns represent the tasks (or things) assigned to them. The number in the table would then be the costs associated with each particular assignment. It may be noted that the assignment problem is a variable of transportation problem with two characteristics. i. The cost matrix is a square matrix,

ii. 2

The optimum solution for the problem would be such that there would be only one assignment in a row or column of the cost matrix. Formulation of Assignment Problem

Let there be n jobs and n persons are available with different skills. If the cost of doing jth work by ith person is Cij. Then the cost matrix is given in table 1 below: TABLE 1: Persons Jobs 1 2 : : I N C11 C21 : : Ci1 Cn1 C12 C22 : : Ci2 Cn2 C13 C23 : : Ci3 Cn3 ..C1j ..C2j ::::::::::::: ::::::::::::: ::::::::::::: :::::::::Cij .Cnj ..C1n ..C2n :::::::::::: :::::::::::: :::::::::::: :::::::::Cin ..Cnn 1 2 3 ..j ..n

Now, the problem is which work is to be assigned to whom so that the cost of completion of work will be minimum. Mathematically, the problem can be expressed as follows: Min Z =
n n i=1 j=1

Cij Xij

Subject to the constraints

n j=1 n i=1

Xij = 1 for all i (resourse availability)

Xij = 1 for all i (activity requirement)

and Xij = 0 or 1, for all i to activity j. Where Xij is defined as an indicator variable expressed as follows: Xij =             

with the restrictions; (i) (ii) ith person will do only one work, jth work will be done only by one person.

Motivation for Solution Let Ui = minimum element in row i Vj = minimum element in column j Cij = a new cost element Where Cij = Cij Ui - Vj So, the equivalent problem can be written as: Min Z = CijXij
I j

= (Cij Ui - Vj)Xij
i j

= Min (Z - UiXij - VjXij)

i j i j

= Min Z Min (UiXij + VjXij)

i j j i

= Min Z (K1 + K2) Where K1 and K2 are constants. = Min Z K Where K is called the lower bound. Variation of Assignment Problem Multiple Optimum Solutions This situation of more than one optimal solution the manager has a elasticity in decision making. Here the manager can choose any of the solutions by his will and experience. Maximization 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 Hungarian Method can also solve such problems, as it is easy to obtain an equivalent minimization problem by converting every number in the matrix to an opportunity loss. 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.

Unbalanced Assignment Problem It is an assignment problem where the number of persons is not equal to the number of jobs. If the number of persons is less than the number of jobs then we introduce one or more dummy persons (rows) with zero values to make the assignment problem balanced. Likewise, if the number of jobs is less than the number of persons then we introduce one or more dummy jobs (columns) with zero values to make the assignment problem balanced. 3 Assignment Algorithm (Hungarian Method)

This method is dependent upon two vital theorems stated as follows: Theorem 1: If a constant is added (or subtracted) to every element of any row (or column) of the cost matrix (Cij) in an assignment problem then an assignment which minimizes the total cost for the new matrix will also minimize the total cost matrix. Theorem 2: If all Cij 0 and there exist a solution Xij = Xij such that CijXij = 0. Then this solution is an optimal solution i.e. minimizes Z. The computational procedure is given as follows: Step I: (A) Row Reduction: Subtract the minimum entry of each row from all the entries of the respective row in the cost matrix. (B) Column Reduction: After completion of row reduction, subtract the minimum entry of each column from all the entries of the respective column. Step II: Zero Assignment: (A) Starting with the first row of the matrix received in step 1, examine the rows one by one until a row containing exactly one zero (unique zero) is found. Then an experimental assignment indicated by is marked to that zero. Now all the zeros in the column in which the assignment is made are crossed-out (X). This procedure should be adopted for each row assignment. (B) When the set of rows has been completely examined, an identical procedure is applied successively to columns. Starting with the first column, examine all columns until a column containing exactly one zero (unique zero) is found. Then make an experimental assignment in that position and cross other zeros in the row in which the assignment was made. Continue these successive operations on rows and columns until all zeros are either been assigned or crossed-out. After this step two situations arise; (i) Total assigned zeros = n; the assignment is optimal, (ii) Total assigned zeros < n; use step III and onwards.

Step III: Draw of Minimum Lines to Cover Zeros: The following procedure is adopted to cover all the zeros at least once. (i) Mark () to all rows in which the assignment has not been made. (ii) See the position of zero(s) in marked () row(s) and then mark () to the corresponding column(s). (iii) See the marked () column(s) and find the position of assigned zeros and then mark () to the corresponding rows which are not marked till now. (iv) Repeat procedures (ii) and (iii) till the completion of marking. (v) Draw the lines through unmarked rows and marked columns. Note: If the above method does not work then make an arbitrary assignment and then follow step (IV). Step IV: Select the Smallest Element from the Uncovered Elements. (i) (ii) Subtract this smallest element from all uncovered elements and itself. Add this smallest element to all elements at the intersection of two lines.

Step V: Thus the number of zeros is increased. Now, the matrix is modified with the help of step ii and finds the required assignment. 4 Conclusion

The Hungarian Method is implemented in subroutines that are used in generating optimum demand and supply plans and is included with the demonstration model package. A maximization assignment problem can be converted to minimization problem, simply by multiplying each entry in the effectiveness matrix by -1 before solving in the usual manner. Many manufacturing and business problems involve oneto-one allocation of resources to uses. For each possible allocation of resource-to-use, a measure of effectiveness is required; this may be expressed in terms of cost, time, revenue or profit, depending on circumstances.

THEORETICAL BRIEF, FLOW CHART FOR ASSIGNMENT PROBLEM Start

Construct the effectiveness matrix if not already given

Row Reduction

Column Reduction No Is zero assignment possible? (i) (ii) (iii) Draw minimum number of lines To cover all the zeros Choose the least uncovered Element Subtract this from the uncovered Elements and add it to the elements at intersection of the lines. ASSIGNMENT put square over the zeros and cross-out all zeros (if any) of the corresponding column or row respectively Yes

No Is zero assignment possible?

Yes SOLUTION Add the elements of the given matrix corresponding to each square

Stop

Acknowledgement The author gratefully acknowledge the training assistance for this paper from Dr. A. C. Igboanugo (Associate Professor) and Prof. G. Ovuworie. References Tervi, Marko (2008). The Difference that CEOs Make: An Assignment Model Approach. American Economic Review 98(3), pp. 642668. Teulings, Coen N (1995). The Wage Distribution in a Model of the Assignment of Skills to Jobs. Journal of Political Economy, 102, pp. 280315. Moulin, H., Stong, R. (2002). Fair queuing and other probabilistic allocation methods. Mathematics of Operations Research, 27, 1-30. Hamdy, A. Taha, (2007). An Introduction Textbook of Operations Research, eight edition, University of Arkansas, Fayetteville. Luenberger, D., (2003). Linear and Nonlinear Programming, Kluwer Academic Publishers, Boston.