摘要
资源约束型项目调度的优化是一个NP-hard问题,其求解难度随着资源约束项的增多呈指数方式增长,传统的基于Excel表的手工优化方法不能及时计算出有效的资源配置方式,从而影响项目管理人员的资源调度。针对多资源约束型项目调度的优化问题提出基于遗传算法的资源约束型项目调度的优化方法,该算法采用基于活动优先权的十进制编码方式,结合活动的存储邻接矩阵,有效地解决活动调度违例现象;运用优先抢占模式的资源分配方式安排活动资源,避免资源分配中的冲突问题;并为该算法设计了启发式遗传算法的C语言程序,通过计算机的多次迭代运算得出满足资源约束的最优工期。实践结果表明,遗传算法可以快速有效地解决企业项目调度的优化问题,适合在企业项目进度管理中推广运用。
The Resource-Constrained Project Scheduling Problem （RCPSP） is a NP -hard problem. With the Resouree＇s type increase, this problem is more difficult to solve and the computing measures is increasing with the index method. The Excel sheet can not optimize the resource configuration in time, so that many people are hard to set down the project scheduling effectively. To handle this problem, a genetic algorithm for solving resource-constrained project scheduling is presented in this paper. The suggested approach employs a way of encoding genetics based on activity precedence. The violation of activity precedence that exists within potential genetics can well be detected by using the activity matrix. Then, the resource conflict among activities of projects can be avoided by means of preempt-based resources assignment. This algorithm for solving RCPSP is implemented using C language, and the experiment shows that a better solution can be found in a reasonable time.
出处
《管理科学》
CSSCI
2008年第4期60-68,共9页
Journal of Management Science
关键词
项目调度
资源约束
遗传算法
调度优化
project scheduling
resource-constrained
genetic algorithms
optimization of scheduling
