摘要
利用基于蒙特卡罗模拟的关键路径(CPM)优化算法模型,通过分析项目计划中各任务之间可能存在工序约束和期限约束对CPM的影响,提出了基于约束的CPM动态优化算法.该算法可得到CPM,工期及其统计特性和相关的冲突信息,为决策者提供更好的决策信息支持.采用Matlab,C#和SQL Server实现了所提出算法,实例分析验证了该算法的有效性.
A dynamic critical path method（CPM） optimal algorithm base on constraints of scheduling network plan is proposed by using the CPM optimal algorithm model based on Monte Carlo simulation,and the constraints including actives sequence constraints and date limitation constraints are considered together with CPM. CPM,duration,information of related conflicts and their statistic characteristic are obtained,which is helpful to improve the decision support. Matlab,C# and SQL Server 2000 are utilized to implement proposed algorithm. The realistic case study shows the effectiveness of proposed algorithm.
出处
《控制与决策》
EI
CSCD
北大核心
2010年第2期166-170,共5页
Control and Decision
关键词
网络计划图
关键路径方法
工序约束
期限约束
蒙特卡罗模拟
Scheduling network plan Critical path method Work sequence constraints Date limitation constraints Monte Carlo simulation
