期刊文献+

混合装配流水线上最小makespan的协同优化 被引量:11

Co-optimization for Mixed-Model Assembly Flow Line to Minimize Makespan
原文传递
导出
摘要 混合装配流水线是实现快速响应的一种多品种小批量的生产组织方式,流水线平衡和产品排序是紧密相关而且对目标值存在交互影响作用的两个NP-hard问题.文章分析了流水线平衡与产品排序对流水线的makespan目标的交互影响,建立了优化模型;基于两个问题的交互影响,采用协同进化算法,并行协同地优化混合装配流水线上的makespan.通过对经典流水线问题的计算实验,并与串行独立优化方法对比,结果表明:并行协同优化是一种全局优化方法,能够克服后者的局限性,改善优化的结果,进一步地,文中对混合装配流水线上makespan的协同优化方法可以推广到Flowshop的优化中去. Mixed model assembly fow llne is a kind of multiple products and low volume production organization method, through that the enterprise realized to response quickly to market needs. Line balancing and Model sequencing axe both NP-hard problem and they are tightly interrelated and influenced each other in mixed model assembly flow line. The mutual influence on makespan of mixed model assembly line is analyzed firstly in this paper, and then the optimization model is given. Based the mutual influence of line balancing and model sequencing, a co-evolutionary algorithm is adopted to minimize makespan in parallel. Through solving the classical assembly line problem, and in contrast with the optimal method in series and separately, it shows that the parallel co-optimization is a global search method, and it can overcome latter limitations, improve the optimization results, and the co- optimization method on the mixed-model assembly flow line could be further extended to optimization on flowshop.
出处 《系统工程理论与实践》 EI CSCD 北大核心 2007年第2期153-160,共8页 Systems Engineering-Theory & Practice
基金 国家自然科学资金(70332001) 中国博士后科学基金(2004035636) 南京理工大学经济管理学院高层次课(专项)预研基金
关键词 流水线平衡 产品排序 MAKESPAN 协同优化 line balancing model sequencing makespan co-optimization
  • 相关文献

参考文献24

  • 1吕绪华,潘开灵.一类装配式流水作业排序问题的启发式算法及其性能比研究[J].武汉冶金科技大学学报,1999,22(2):203-206. 被引量:4
  • 2韩丽敏,周泓,冯允成.解流水车间作业排序问题的一种禁止搜索算法[J].航空计算技术,1999,29(1):43-48. 被引量:2
  • 3Sun X,Morizawa K,Nagasawa H.Powerful heuristics to minimize makespan in fixed,3-machine,assembly-type flowshopscheduling[J].European Journal of Operational Research,2003,146:498-516.
  • 4Aldowaisan T,AUahverdi A.New heuristics for no-wait flowshops to minimize makespan[J].Computers & Operations Research,2003,30:1219-1231.
  • 5Framinan J M,Leisten R,Ruiz-Usano R.Efficient heuristics for llowshop sequencing with the objectives of makespan and flowtime minimization[J].European Journal of Operational Research,2002,141:559-569.
  • 6Sung C S,Kim Y H.Minimizing makespan in a two-machine flowshopwith dynamic arrivals allowed[J].Computers & Operations Research,2002,29:275-294.
  • 7Caraffa V,Ianes S,Bagchi T P,Chelliah S.Minimizing makespan in a blocking flowshop using genetic algorithms[J].International Journal of Production Economics,2001,70:101-115.
  • 8Iyera S K,Saxenab B.Improved genetic algorithm for the permutation flowshopscheduling problem[J].Computers & Operations Research,2004,31:593-606.
  • 9B. Guo Y. Nonaka Department of Industrial Management and Engineering, Science University of Tokyo 1-3 Kagurazaka, Shinjuku-ku, Tokyo 162, Japan,guo@ms.kagu.sut.ac.jp.Minimizing Makespan on Mixed Mass Production Lines of Two and Three Machines[J].International Journal of Plant Engineering and Management,1998,3(3):11-16. 被引量:1
  • 10Ponnambalam S G,Aravindan P,Naidu G M.A comparative evaluation of assembly line balancing heuristics[J].The International Journal of Advanced Manufacturing Technology,1999(15):577-586.

二级参考文献16

共引文献23

同被引文献99

引证文献11

二级引证文献55

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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