期刊文献+

基于混合遗传算法的可重组制造系统作业计划方法 被引量:3

Programming Problem of Reconfigurable Manufacturing System Based on Hybrid Genetic Algorithm
下载PDF
导出
摘要 提出了基于混合遗传算法的可重组制造系统作业(RMS)计划方法。RMS的作业计划以瓶颈工序为目标,前、后工序的作业根据瓶颈工序分别按拉动、推动的方式排定。作业计划的优化算法利用禁忌搜索特有的记忆思想重新设计遗传算法中的变异算子,形成了具有针对性的混合遗传算法,从而改变生产线的加工能力,以适应市场快速多变的需求,并以一个实验验证其有效性。 This paper presents an ap manufacturing systems (RMS) because the extensive application of genetic algorithms and tabu search proves that they are effective tools for solving combinatorial optimization problems. Bottlenecks are the objective of programming by which the former and the latter processes can be pulled or pushed. Redesign of mutation operator of genetic algorithm is completed by combination with the memory function of tabu search in order to form the hybrid algorithm. With the certification of experiment, this method show the result is satisfactory. Manufacturing systems can meet the changes of requirements effectively and rapidly.
出处 《机电一体化》 2007年第1期9-13,共5页 Mechatronics
关键词 可重组 作业计划 遗传算法 禁忌搜索 reconfigurable programming problem genetic algorithm tabu search
  • 相关文献

参考文献6

二级参考文献42

  • 1L.A.扎德[美] 陈国权(译).模糊集合、语言变量及模糊逻辑[M].北京:科学出版社,1990..
  • 2许虹 唐任仲 程耀东.基于合弄制造原理的制造设备可重构技术[A]..第4届国际设计与制造前沿会议(ICFDM 2000)[C].中国杭州,2000-06.17-19.
  • 3Guinet A. Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time.International Journal of Production Research, 1996,34 : 1643-- 1654.
  • 4Hunsucker J L, Shah J R. Comparative performance analysis of priority rules in a constrained flowshop with multiple processor environment . European Journal of Operational Research, 1994, 72:102 --104.
  • 5Brah S A, Hunsucker J L. Branch and bound algorithm for the flowshop with multiprocessors. European Journal of Operational Research, 1991,51 : 88--89.
  • 6Negenman E G. Local search algorithms for the multiprocessor flowshop scheduling problem. Euro-pean Journal of Operational Research, 2001,128 : 147 --158.
  • 7Nowicki E, Smutnicki C. A fast Tabu search algorithm for the permuation flowshop problem[J]. European Journal of Operational Research, 1996, 91:160--175.
  • 8Ben-Daya M, AI-Fawzan M. A tabu search approach for the flowshop scheduling problem[J]. European Journal of Operational Research, 1998,109 : 88-- 95.
  • 9Santos D L, Hunsucker J L, Deal D E. Global lower bounds for flowshops with multiple processors[J].European Journal of Operational Research, 1995,80:112--120.
  • 10Dannenbring D. An evaluation of flowshop sequencing heuristics . Management Science, 1977,23 : 1174 --1182.

共引文献130

同被引文献24

  • 1刘勇,谷寒雨,席裕庚.基于约束理论的混合复杂流水线规划调度算法[J].计算机集成制造系统,2005,11(1):97-103. 被引量:15
  • 2田颖,江平宇,周光辉,赵刚.基于遗传算法的工艺规划与调度集成方法[J].西安交通大学学报,2006,40(9):1041-1044. 被引量:12
  • 3王军强,孙树栋,王东成,杨宏安.基于约束理论的制造单元管理与控制研究[J].计算机集成制造系统,2006,12(7):1108-1116. 被引量:25
  • 4赵刚,江平宇.面向大规模定制生产的e-陶制造单元标层解分析优化规划模型[J].机械工程学报,2007,43(2):178-185. 被引量:12
  • 5SAMEH M S. The reeonfiguration issues in manufacturing systems [ J]. Journal Materials Processing Technology, 2003,138 (5) : 277 -283.
  • 6SCHALLER J. A comparison of heuristics for family and job schedu- ling in a now-line manufacturing cell [ J ]. International Journal o| Production Research,2000,38 (2) :287- 308.
  • 7KIM H M, MICHELENA N F, PAPALAMBROS P Y. Targetcasca- ding in optimal system design[ J ]. Journal of Mechanical Design, 2003,125(3) :474-480.
  • 8MICHALEK J J, PAPALAMBROS P Y. An efficient weighting update method to achieve acceptable consistency deviation in analytical target cascading[J]. Journal of Mechanical Design,2005,127(2) :206- 214.
  • 9MOON C, SEO Y. Evolutionary algorithm for advanced process plan- ning and scheduling in a multi-plan [ J ]. Computers & Industrial Engineering ,2005,48 (2) :311-325.
  • 10Chakravorty S S.An evaluation of the DBR control mechanism in a job shop environment. The International Journal of Management Science . 2001

引证文献3

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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