资源约束下多项目调度的拓扑优化方法  

Topological Travel for Resource-constrained Multi-project Scheduling Problem

作　　者：邓林义[1] 林焰[2] 金朝光[2] 陈明[2] 

机构地区：[1]大连理工大学计算机系,辽宁大连116024 [2]大连理工大学船舶CAD工程中心,辽宁大连116024

出　　处：《系统仿真学报》2007年第16期3846-3849,共4页Journal of System Simulation

基　　金：国家"863"(2003AA414060)

摘　　要：为了有效解决带有项目优先权约束和资源约束的多项目调度问题,综合考虑项目调度过程中任务的时序关系和资源限制,以拓扑遍历方法为基础,提出了一种多项目调度问题的拓扑优化算法。该算法利用拓扑序列的特点,能够保证任务间的时序关系,采用关键路径任务优先、向后影响度大以及最小空闲时间等优先规则进行任务调度及资源分配。结合工程实例,验证了该算法的可行性。To solve the resource-constrained and priority-constrained multi-project scheduling problem with makespan minimization as objective, a topological optimization algorithm was proposed. The algorithm was designed based on the topological travel method with respect to precedence and resource constraints. The algorithm takes the merits of topological travel, keeps the precedence constraints in the schedule, and incorporates several priotiy rules to break the ties. The feasibility of the algorithm is verified by a real instance in engineering field.

关 键 词：拓扑优化 项目调度 资源分配 多项目 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]