In enterprise project management systems, a program at the tactical level coordinates and manages multiple projects at the operational level. There are close relationships between multiple projects in a program, which are typically manifested as shared resources and precedence relationships. Most research efforts have concentrated on the resource sharing by projects, while the precedence relationships between projects have yet to be comprehensively investigated. In this paper, a bi-objective hierarchical resource-constrained program scheduling problem proposed, where both resource sharing and precedence relationships between projects are considered in a distributed environment. The problem contains two different sub-problems at the operational level and the tactical level, and they are modeled in the same way as two bi-objective multi-mode scheduling problems. Shared resources are allocated from the tactical level to the operational level, and once they are allocated to a project, they can only be re-allocated to other projects once the current project is finished. Subsequently, a two-phase algorithm based on NSGA-III is developed. The algorithm runs at the operational level and the tactical level in turn. According to the Pareto fronts of projects that are submitted from the operational level, the bi-objective program planning at the tactical level is conducted under the constraints of precedence relationships and shared resources. The results of computational simulations demonstrate the satisfactory performance of the improved algorithm. By coordinating the local optimization of projects and the global optimization of the program in a hierarchical framework, the method proposed in this paper provides an effective integrated scheduling method for decision-makers at various levels of a program.

在企业项目管理系统中，战术级别的程序在操作级别协调和管理多个项目。一个程序中的多个项目之间存在密切的关系，通常表现为资源共享和优先关系。大多数研究工作都集中在项目资源共享上，而项目之间的优先关系尚未得到全面调查。在本文中，提出了一个双目标分层资源约束程序调度问题，其中在分布式环境中考虑了项目之间的资源共享和优先关系。该问题在操作层面和战术层面包含两个不同的子问题，并且它们的建模方式与两个双目标多模式调度问题相同。共享资源从战术层面分配到作战层面，一旦分配给一个项目，只有当前项目完成后才能重新分配给其他项目。随后，开发了基于NSGA-III的两阶段算法。该算法依次在操作级和战术级运行。根据从作战层面提交的项目的帕累托战线，战术层面的双目标计划规划是在优先关系和资源共享的约束下进行的。计算仿真结果表明改进算法具有令人满意的性能。