Improvement in Hungarian Algorithm for Assignment Problem
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.
KeywordsAssignment problem Hungarian method Improvement
The authors would like to thank the School of Computer Science and Engineering, VIT University, for giving them the opportunity to carry out this project and also for providing them with the requisite resources and infrastructure for carrying out the research.
- 4.D.A. Castanon, B. Smith, A. Wilson, Performance of parallel assignment algorithms on different multiprocessor architectures. Alphatech report TP-1245, Burlington, MA, (1989)Google Scholar
- 6.M. Engqust, A successive shortest path algorithm for the assignment problem. INFRO. 20, 370–384 (1982)Google Scholar
- 7.F. Glover, R. Glover, D. Klingman, Threshold assignment algorithm. Centre for Business Decision analysis report CBDA 107, Graduate School of Business, University of Taxes at Austin (1982)Google Scholar
- 9.R. Jonkar, A. Volgenant, A shortest augmenting path algorithm for the dense and sparse linear assignment problems. Computing 3, 92–106 (1987)Google Scholar
- 10.E. Lawler, Combinational Optimization: Networks and Matroids (Holt, Rinehart & Winston, New York, 1976), p. 206Google Scholar
- 12.C.H. Papadimitriou, K. Steiglitz, Combinational Optimization: Algorithm and complexity (Prentice-Hall, Englewood Cliffs, 1982)Google Scholar