首页 | 本学科首页   官方微博 | 高级检索  
     

离散人工蜂群算法求解资源时变的项目调度问题
引用本文:孙晓雅,王金羽. 离散人工蜂群算法求解资源时变的项目调度问题[J]. 微型机与应用, 2012, 31(2): 60-63
作者姓名:孙晓雅  王金羽
作者单位:辽宁师范大学管理学院,辽宁大连,116029
摘    要:针对资源量随时间变动的项目调度问题提出了一种新的离散人工蜂群求解算法。算法食物源的位置采用基于任务排列的编码方法,并提出一种可以保持解的离散性和可行性的候选食物源生成方法。仿真结果表明,该算法能有效地求解资源时变的受限项目调度问题,研究发现在保持资源总量不变甚至减少的情况下,通过调整资源配置能够显著缩短项目工期,可见资源配置优化在项目管理中的重要作用。

关 键 词:项目调度  资源量随时间变动  人工蜂群算法  离散

A discrete artificial bee colony algorithm for project scheduling time-varying resource capacities
Sun Xiaoya,Wang Jinyu. A discrete artificial bee colony algorithm for project scheduling time-varying resource capacities[J]. Microcomputer & its Applications, 2012, 31(2): 60-63
Authors:Sun Xiaoya  Wang Jinyu
Affiliation:(Management College,Liaoning Normal University,Dalian 116029,China)
Abstract:The paper provided a new discrete artificial bee colony(DABC) algorithm for project scheduling problem with time-varying resource capacities.In DABC each food source location represents a feasible permutation of the set of activities.The paper gave a new method to produce candidate food sources which can keep the solution discrete and feasible.The simulation results show that the algorithm can effectively solve the project scheduling problem with time-varying resource capacities.Maintaining resource gross unchanged or even reduced,the makespan of project can be shorten significantly by adjusting the allocation of resources.It draw a conclusion that optimization of resource allocation is very important in project management.
Keywords:project scheduling  time-varying resource capacities  artificial bee colony algorithm  discrete
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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