• COMPARATIVE STUDY OF HA, MOA AND NAA METHODS FOR SOLVING ASSIGNMENT PROBLEMS
Abstract
The assignment problem is a special case of the transportation problem in which the objective is to assign n number of resources to n number of activities at a minimum cost or maximum profit. In this paper we attempt to introduce the algorithms and solution steps for HA, MOA and NAA methods used to solve assignment problems. Finally we compare with the optimal solutions among these three methods.
Keywords
Assignment problem, Hungarian assignment method (HA-method), Matrix one’s assignment method (MOA-method), New approach assignment method (NAA-method), Optimization.
Full Text:
PDFThis work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2024 International Journal of Mathematical Archive (IJMA) Copyright Agreement & Authorship Responsibility |