Improvement in hungarian algorithm for assignment problem

Abstract

Hungarian method for assignment problem is generally used in parallel environment for the assignment of job to a processor. If the number of processors and number of jobs are same, then we can assign each processor 1 job with less cost using Hungarian method. If the number of jobs is larger compared to number of processors, then this method does not work (another approach is using dummy processors, but it is not implementable). In this paper, we proposed an alternate approach same as Hungarian method for assignment of more jobs to lesser processors.