改进粒子群算法求解应急项目瓶颈资源动态调度问题  

Improved PSO to dynamic scheduling problem of bottleneck in emergency

作　　者：杨琴[1] 廖斌[1] 吴秋琴[1] 李金奇[1] 

机构地区：[1]四川师范大学商学院,成都610101

出　　处：《计算机应用研究》2013年第4期989-992,共4页Application Research of Computers

基　　金：国家自然科学基金资助项目(71001005);四川省"十二五"规划项目(SC11C042);四川省教育厅科研资助项目(10ZC004)

摘　　要：应急项目中资源的调度受到多种随机因素影响,处于复杂动态的环境中,求解困难;约束理论指出瓶颈是复杂系统管理的核心,将调度的重点放在瓶颈资源上可以简化复杂系统问题。针对于此,研究了应急项目中瓶颈资源的动态调度问题,以达到提高资源的利用率、减轻损失等目的。首先,从优化目标、机器环境、作业特征和约束几方面分析并描述了应急项目中瓶颈资源调度的问题特征,建立了相应的数学模型;接着,运用混合重调度策略和改进粒子群算法进行算法设计,实现了瓶颈资源的动态调度;最后,通过仿真实验并对比了多种算法的结果,验证了该算法的可行性和有效性,证明其具有较好的理论和实际应用价值。Emergency projects＇ optimal resource scheduling is in a complex and dynamic environment.It makes the problem-solving more difficult.Theory of constraints confirms that bottleneck determine the whole system＇s performance.Dynamic scheduling of the bottleneck can simplify the complex system problems.Thus,this paper studied the dynamic scheduling problem of bottleneck in emergency to improve the resource＇ utilization,and cut down the expense etc.Firstly,it analyzed the problem＇s characteristics from the aspects of the optimal goal,machine environment,processing characters and constraints,and built the mathematical model.Then,it used hybrid rescheduling strategy and improved particle swarm optimization to build an algorithm and realized the dynamic scheduling of the bottleneck resources.Finally,the case study demonstrates the algorithm＇s feasibility,effectiveness,the value of theory and the practical application.

关 键 词：应急项目 瓶颈资源 动态调度 粒子群算法 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]