首页> 中文期刊> 《计算机工程与设计》 >具有不精确活动时间的项目调度算法

具有不精确活动时间的项目调度算法

         

摘要

针对以最小化项目工期为目标的资源受限项目调度问题,提出对不精确活动时间项目调度的求解方法。对现实项目调度中存在的不精确活动时间及模糊资源分配进行分析,在模糊集理论基础上建立了数学模型,提出一种基于蚁群算法的对不精确活动周期下的项目调度问题求解方法。人工蚂蚁的初始节点采用概率优先约束原则选择,以避免单一概率选择可能导致的过快收敛的局限性,提高解的质量;对算法所使用的重要参数的选择进行分析说明,给出计算方法。进行模拟实例并与其它实验结果进行对比,对比结果表明了该算法的有效性和可行性。%A method was proposed to solve the problem of the resource-constrained project scheduling with imprecise activity du-rations .Some imprecise activity durations and fuzzy resource allocations in the real project scheduling were analyzed .On the ba-sis of the fuzzy set theory ,the model was established .A method based on the ant colony algorithm was proposed to solve the project scheduling algorithm with imprecise activity durations .The initial node of artificial ants was selected based on the proba-bility principle of priority to avoid the limitations of the excessive convergence resulting from single probability selection and to improve the quality of the solution ,then the selections of important parameters used by the algorithm were analyzed and de-scribed ,and the calculation method of the parameters was given .Finally ,results of the simulation and verification examples were compared with that of other experiments ,which show the method is effective and feasible .

著录项

相似文献

  • 中文文献
  • 外文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号