Multi-Objective Optimization of Time-Cost-Quality Using Hungarian Algorithm ()
Affiliation(s)
ABSTRACT
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.
KEYWORDS
Share and Cite:
Copyright © 2024 by authors and Scientific Research Publishing Inc.
This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.