![]() |
|
![]()
|
Journal of Engineering, Project, and Production Management, 2022, 12(3), 209-216
Approach for Solving Project Assignment with Bicriterion
1Associate Professor, Department
of Industrial Management, Chung Hua University, No. 707, Sec. 2, Wufu
Rd., HsinChu, Taiwan, E-mail: apma.service@gmail.com
Project Management
Received August 11, 2021; revised February 5, 2022; February 14, 2022; accepted February 20, 2022
Available online May 6, 2022
Abstract: Assigning the right member to the most suitable position is key to the success of a project, and this task has been commonly executed by the project manager based on personal judgment in practice. This paper proposes a matching approach coupled with a revised Hungarian algorithm for optimizing the cost-time project assignment problem. The approach iteratively searches for the augmenting path concerning the current matching rather than solving the entire problem repeatedly. This unique feature greatly reduces the computation efforts. Problems of different sizes and sample ranges are simulated using the proposed technique and G&N’s method. Results show that the presented algorithm excels the previous approach in not only producing a lower bound for the project time but also in reaching the optimal solution using much less computing time.
Keywords: project assignment, cost-minimizing, time-minimizing, matching. Copyright © Journal of Engineering, Project, and Production Management (EPPM-Journal). This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License. Requests for reprints and permissions at eppm.journal@gmail.com. Citation: Chang, D. T., Lin, H. H., Chen, S. H., and Wei, C. C. (2022). Approach for Solving Project Assignment with Bicriterion. Journal of Engineering, Project, and Production Management, 12(3), 209-216.
DOI:
10.32738/JEPPM-2022-0019
|