一种模糊项目调度问题的变宽Beam Search算法  

Width-changeable Beam Search algorithm for fuzzy project scheduling

作　　者：程序[1] 吴澄[1] 

机构地区：[1]清华大学自动化系,北京100084

出　　处：《控制理论与应用》2007年第4期630-633,共4页Control Theory & Applications

基　　金：国家重点基础研究计划(973计划)资助项目(2002CB312202).

摘　　要：具有弹性约束和模糊工期的项目调度问题是一类具有实际应用意义但难于解决的问题.传统BS(Beam Search)方法存在常数线宽大小影响求解效果的问题.本文建立了此类项目调度问题的模型,并将序优化理论思想与BS方法结合,提出一种通过计算和改变线宽,兼顾解的质量和求解速度的变宽BS调度算法.仿真计算结果表明,该算法能够在较短时间内得到满意的调度结果,适用于实际模糊项目调度决策.Project scheduling with flexible constraints and ill-known processing time is a practical but hard problem. In traditional Beam Search（BS） algorithms, constant beam-width could influence the quality of solution. A model of this category of scheduling problem is formulated in this paper. By combining traditional BS algorithm and OO（ordinal optimization） theory, a width-changeable BS algorithm, which balances the quality of solution with computing time, is presented. Experimental results show that this algorithm can obtain satisfactory solution in acceptable time and be applied to practical fuzzy projects.

关 键 词：项目调度 柔性约束 不确定工期 集束搜索 

分 类 号：F224[经济管理—国民经济]