首页> 中文期刊> 《武汉理工大学学报(交通科学与工程版)》 >基于蚁群算法的资源受限多项目调度问题研究

基于蚁群算法的资源受限多项目调度问题研究

         

摘要

资源受限多项目调度问题主要是在资源有限的条件下寻找理想的项目调度方案,从而使多项目的完成工期最短.对于这一NP问题,文中采用改进后的蚁群算法.该算法基于串行调度生产机制,结合多项目任务列表和项目优先权对启发式信息进行改进,从而在满足项目紧前约束的条件下对多项目进行合理的调度.通过与其他多项目调度启发式算法相比,该算法能有效的分配资源,显著的缩短多项目的完成时间.%The resource-constrained multi-project scheduling problem addresses the important issue which seeks to find the expected project scheduling when the amount of resource is limited, and make the overall multi-project duration is shortest. For it is a NP problem, this paper use the improved ant colony algorithm. The algorithm utilized the serial schedule generation scheme to construct project schedules, and combined with multi-project task lists and project priorities to improve on the heuristic information to achieve the reasonable scheduling when meet precedence feasible. Through compare with other multi-project scheduling heuristic algorithm, this algorithm can effectively allocate resources, significantly reduce the multi-project completion time.

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号