摘要
分析了多资源约束下多项目作业调度问题的性质和特点,建立了以拖期最短为目标的数学模型.基于资源上作业排序形成的时序关系以及各项目内部作业间时序关系组成的新时序关系图,提出求解该问题的一般算法.为降低一般算法的计算量和复杂度,使算法能够应用到实际工程,将一般算法和规则相结合,提出一种启发式算法,给出具体的算法步骤.计算示例表明,给出的算法能有效求解多资源约束下多项目作业调度问题.
The characteristics of the multi-project task scheduling under multi-resource constraints are analyzed and the mathematical model based on the shortest delay time for this problem is constructed. Based on the new time-sequence relation graph composed of the time-sequence relations between the tasks scheduling on resource and the time-sequence relations inside the projects, this paper presents a common algorithm for this problem. In order to decrease the amount and complexity of calculation and fit the practice, a heuristic algorithm combined the common algorithm and the rules, and this algorithm steps are presented. A calculation demonstration shows that the heuristic algorithm can solve the problem of the multi-project task scheduling under multi-resource constraints effectively.
出处
《哈尔滨工业大学学报》
EI
CAS
CSCD
北大核心
2007年第7期1045-1049,共5页
Journal of Harbin Institute of Technology
基金
黑龙江省国际科技合作资助项目(WH05A01)
哈尔滨工业大学校基金资助项目(HIT.2003.21)
关键词
作业调度
资源限制
启发式算法
task scheduling
multi-resource constrained
heuristic algorithm
