首页 | 本学科首页   官方微博 | 高级检索  
     

资源约束下多项目调度的拓扑优化方法
引用本文:邓林义,林焰,金朝光,陈明. 资源约束下多项目调度的拓扑优化方法[J]. 系统仿真学报, 2007, 19(16): 3846-3849
作者姓名:邓林义  林焰  金朝光  陈明
作者单位:1. 大连理工大学计算机系,辽宁,大连,116024;大连理工大学船舶CAD工程中心,辽宁,大连,116024
2. 大连理工大学船舶CAD工程中心,辽宁,大连,116024
基金项目:国家高技术研究发展计划(863计划)
摘    要:为了有效解决带有项目优先权约束和资源约束的多项目调度问题,综合考虑项目调度过程中任务的时序关系和资源限制,以拓扑遍历方法为基础,提出了一种多项目调度问题的拓扑优化算法。该算法利用拓扑序列的特点,能够保证任务间的时序关系,采用关键路径任务优先、向后影响度大以及最小空闲时间等优先规则进行任务调度及资源分配。结合工程实例,验证了该算法的可行性。

关 键 词:拓扑优化  项目调度  资源分配  多项目
文章编号:1004-731X(2007)16-3846-04
收稿时间:2006-05-25
修稿时间:2006-05-252007-04-16

Topological Travel for Resource-constrained Multi-project Scheduling Problem
DENG Lin-yi,LIN Yan,JIN Chao-guang,CHEN Ming. Topological Travel for Resource-constrained Multi-project Scheduling Problem[J]. Journal of System Simulation, 2007, 19(16): 3846-3849
Authors:DENG Lin-yi  LIN Yan  JIN Chao-guang  CHEN Ming
Affiliation:1 .Department of Computer Science, Dalian University of Technology, Dalian 116024, China; 2. Engineering Center of Ship CAD, Dalian University of Technology, Dalian 116024, China
Abstract: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.
Keywords:project scheduling   resource allocation   multi-project   topological optimization
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号