MODIFIED HUNGARIAN ALGORITHM TO SOLVE UNBALANCED ASSIGNMENT PROBLEM

To solve unbalanced assignment problem using Hungarian method involves the assumption of fictitious machines which becomes impractical in daily life. In actual circumstances, we have to allocate the given whole set of tasks to given number of appliances. To do this more than one task should be performed by a single appliance. In this paper an improved version of the Hungarian algorithm to solve unbalanced assignment problem which gives an optimal solution to the problem has been proposed. The algorithm is tested using numerical examples. Comparison between the previous methods is also illustrated in this paper.