期刊文献+

求解Flow-shop调度问题的HSGATS算法研究

Research of HSGATS Algorithms to Solve the Scheduling Problem of Flow-shop
在线阅读 下载PDF
导出
摘要 通过研究流程企业典型生产加工方式的Flow-shop加工调度问题,分析了求解这一调度问题的各种算法的性能,特别是混合遗传算法中的混合策略,进而提出了一种以启发式搜索算法为前置算法、遗传算法为主体算法、禁忌搜索算法为后置算法的新的混合遗传算法-HSGATS算法,并针对置换Flow-shop调度问题提出了具体的算法设计和实现方法;通过对大量置换Flow--ShopBenchmark问题进行实验求解和其他算法的比较分析,验证了此算法是十分有效的。 Through researching the typical producing method of Flow-shop processing scheduling for the flow enterpris-es,this paper analyses the performances of various algorithms for solving this scheduling problem.Especially,the admix-ture strategies in mixed genetic algorithms are analysed.Further,the paper puts forward a new admixture genetic algo-rithm-HSGATS in which elicitation search algorithm is used as a pre-algorithm;genetic algorithm is used as the main algorithm,and tabu search algorithm is used as a post-algorithm.Aimming at displacement Flow-shop scheduling,the concrete design of algorithm and its realizing method is proposed.By doing many experiments to solve Flow-shop Benchmark and when comparing with some other algorithms ,this algorithm has been proved to be very effective.
出处 《计算机工程与应用》 CSCD 北大核心 2004年第9期46-49,共4页 Computer Engineering and Applications
基金 国家863高技术研究发展计划资助(编号:2001AA411220)
关键词 启发式搜索算法 遗传算法 禁忌搜索算法 Flow—shop 生产调度 elicitation search algorithms ,genetic algorithms ,tabu search algorithms ,Flow-shop,production scheduling
  • 相关文献

参考文献4

二级参考文献2

共引文献25

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部