首页 | 官方网站   微博 | 高级检索  
     

基于关键链的资源受限项目调度新方法
引用本文:刘士新,宋健海,唐加福.基于关键链的资源受限项目调度新方法[J].自动化学报,2006,32(1):60-66.
作者姓名:刘士新  宋健海  唐加福
作者单位:1.东北大学信息科学与工程学院 教育部流程工业综合自动化重点实验室,沈阳 110004
基金项目:中国科学院资助项目;辽宁省博士科研项目
摘    要:针对资源受限项目调度问题(RCPSPs)的实际需求建立了多目标优化调度模型,综合运用现有研究成果,设计了基于关键链的项目调度方法。该方法首先采用基于优先规则的启发式算法生成工期最小的近优项目计划,再在该计划中嵌入输入缓冲和项目缓冲,保证项目计划在非确定环境下的稳定执行。论文引用RCPSPs的标准问题库PSPLIB中大量案例对算法进行了的仿真试验,结果表明本文方法较传统项目调度方法有很大改进,论文最后对仿真结果进行了深入讨论,并指出了未来的研究方向。

关 键 词:项目管理    计划与调度    关键链    启发式算法
收稿时间:2004-09-09
修稿时间:2005-09-02

Critical Chain Based Approach for Resource-constrained Project Scheduling
LIU Shi-Xin,SONG Jian-Hai,TANG Jia-Fu.Critical Chain Based Approach for Resource-constrained Project Scheduling[J].Acta Automatica Sinica,2006,32(1):60-66.
Authors:LIU Shi-Xin  SONG Jian-Hai  TANG Jia-Fu
Affiliation:1.School of Information Sciences & Engineering, Northeastern University;Key Laboratory of Process Industry Automation, Ministry of Education, Shenyang 110004
Abstract:A multi-objective model is developed for resource-constrained project scheduling problems (RCPSPs). A critical chain based project scheduling approach is presented by integrating the existing research findings. Firstly, the approach schedules an RCPSP to obtain an approximate optimal project schedule with a minimum makespan by using a priority based heuristic algorithm. Then, it embeds feeding buffer and project buffer into the approximate optimal project schedule to enhance the stability of project schedule. A full factorial computational experiment is set up using the well-known standard instances in PSPLIB. Computational results show that the new proposed approach improves the traditional project scheduling approach greatly. Finally, the computational results are analyzed and future research directions are discussed.
Keywords:Project management  planning and scheduling  critical chain  heuristics
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《自动化学报》浏览原始摘要信息
点击此处可从《自动化学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号