Multi-objective project portfolio scheduling with multi-skilled and inter-project dependency based on NSGA-Ⅱ: Case study
Heng Zhang et al.
Abstract
This study addresses the complex resource-constrained scheduling problem for software project portfolios, where baseline and customized projects with inter-dependencies are developed in parallel. We formulated a nonlinear integer programming model that simultaneously minimizes total duration, optimizes software quality, and balances engineer workload, explicitly incorporating multi-skilled human resources and cross-project dependencies. To solve this problem, we developed an improved Non-dominated Sorting Genetic Algorithm Ⅱ (NSGA-Ⅱ) algorithm featuring localized coding, heuristic population initialization, and Pareto-based local search. A real-world case study from an AI-powered voice technology enterprise demonstrates the method's efficacy: the final population significantly outperforms the initial one, and our algorithm surpasses classic NSGA-Ⅱ, Ant Lion Optimization (ALO), and Simulated Annealing (SA) in convergence and diversity. Crucially, our approach achieves remarkable improvements—reducing duration by 16%, enhancing quality by 21.6%, and improving workload balance by 94.4% compared to skill-homogenized scenarios. Similarly, inter-project dependency-aware scheduling improves duration, quality, and workload balance by 5.2%, 3.9%, and 53.9%, respectively, compared to inter-project dependency-unaware scenarios. Managers can utilize the decoded Pareto optimal solutions to formulate detailed allocation plans, thereby achieving contextually optimized resource management.
Evidence weight
Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40
| F · citation impact | 0.50 × 0.4 = 0.20 |
| M · momentum | 0.50 × 0.15 = 0.07 |
| V · venue signal | 0.50 × 0.05 = 0.03 |
| R · text relevance † | 0.50 × 0.4 = 0.20 |
† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.