Advertisement

Improvement in Hungarian Algorithm for Assignment Problem

  • Kartik Shah
  • Praveenkumar Reddy
  • S. Vairamuthu
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 324)

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.

Keywords

Assignment problem Hungarian method Improvement 

Notes

Acknowledgments

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.

References

  1. 1.
    W. Kuhn, The hungarian method for assignment problem. Nav. Res. Logistics Q. 2, 83–87 (1955)CrossRefGoogle Scholar
  2. 2.
    D.P. Bertsekas, Linear network optimization algorithms and codes (MIT Press, Cambridge, 1991)MATHGoogle Scholar
  3. 3.
    G. Carpaneto, S. Martello, P. Toth, Algorithms and codes for assignment problem. Ann. Oper. Res. 13, 193–223 (1988)CrossRefMathSciNetGoogle Scholar
  4. 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
  5. 5.
    U. Derigs, The shortest augmenting path method for solving assignment problem-motivation and computational experience. Ann. Oper. Res. 4, 57–102 (1985)CrossRefMathSciNetGoogle Scholar
  6. 6.
    M. Engqust, A successive shortest path algorithm for the assignment problem. INFRO. 20, 370–384 (1982)Google Scholar
  7. 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
  8. 8.
    J.R.M. Hall, An algorithm for distinct representatives. Am. Math. Monthly 51, 716–717 (1956)CrossRefGoogle Scholar
  9. 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. 10.
    E. Lawler, Combinational Optimization: Networks and Matroids (Holt, Rinehart & Winston, New York, 1976), p. 206Google Scholar
  11. 11.
    L.F. Mcginnis, Implementation and testing of a primal dual algorithm for the assignment problem. Oper. Res. Int. J. 31, 277–291 (1983)MATHMathSciNetGoogle Scholar
  12. 12.
    C.H. Papadimitriou, K. Steiglitz, Combinational Optimization: Algorithm and complexity (Prentice-Hall, Englewood Cliffs, 1982)Google Scholar
  13. 13.
    E. Balas, D. Miller, J. Pekny, P. Toth, A parallel shortest path algorithm for assignment problem. J. ACM 38(4), 985–1004 (1991)CrossRefMATHMathSciNetGoogle Scholar

Copyright information

© Springer India 2015

Authors and Affiliations

  • Kartik Shah
    • 1
  • Praveenkumar Reddy
    • 1
  • S. Vairamuthu
    • 1
  1. 1.School of Computing Science and EngineeringVIT UniversityVelloreIndia

Personalised recommendations