摘要
In this paper, we propose an algorithm for solving multi-objective assignment problem (MOAP) through Hungarian Algorithm, and this approach emphasizes on optimal solution of each objective function by minimizing the resource. To illustrate the algorithm a numerical example (Sec. 4;Table 1) is presented.
In this paper, we propose an algorithm for solving multi-objective assignment problem (MOAP) through Hungarian Algorithm, and this approach emphasizes on optimal solution of each objective function by minimizing the resource. To illustrate the algorithm a numerical example (Sec. 4;Table 1) is presented.
作者
Ventepaka Yadaiah
V. V. Haragopal
Ventepaka Yadaiah;V. V. Haragopal(Department of Mathematics, Osmania University, Hyderabad, India;Department of Statistics, Osmania University, Hyderabad, India)
