基于优先规则的空间资源约束项目调度算法  

Spatial Resource Constrained Project Scheduling Algorithm Based on Priority Rules

作　　者：张道广[1] 聂兰顺[1] 靳金涛 战德臣[1] 

机构地区：[1]哈尔滨工业大学计算机科学与技术学院,哈尔滨150001

出　　处：《计算机工程》2015年第5期62-69,76,共9页Computer Engineering

基　　金：国家自然科学基金资助项目(61273038);国家科技支撑计划基金资助项目(2012BAF12B16)

摘　　要：任务组占用空间资源项目调度问题需满足组内任务的序关系和人力、设备等常规资源约束,以及空间资源这一特殊资源的约束,同时任务组之间也需满足上述约束,使得该调度问题异常复杂。以船舶建造分段制造问题为背景,建立任务组占用空间资源受限的项目调度问题数学模型,基于并行调度生成方案提出基于优先规则的启发式调度算法,实现对该调度问题的综合求解。实例测试结果表明了该算法的正解性和有效性。Spatial resource project scheduling problem not only satisfies the conventional resource constraints of the task order relations, human resources, equipment, etc. , but also satisfies the resource constraints of spatial resource occupied by activity groups. The constraints between activity groups make the problem extremely complicated. In the context of block manufacturing in shipbuilding, a mathematical model of the spatial resource constrained project scheduling problem occupied by activity groups is proposed by modeling of different kinds of resource. On the basis of the parallel scheduling scheme,a heuristic scheduling algorithm based on priority rules is proposed. Example test compared with the different data scale is made and the result shows that the algorithm is correct and effective.

关 键 词：优先规则 任务组 空间资源 项目调度 约束 调度算法 

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