互联网 qkzz.net
全刊杂志网:首页 > 女性 > 文章正文
刊社推荐

基于最小费用网络流的快速扩散制造任务分配算法


□ 苏婷婷 莫 蓉 赵 岩 高 博

  摘 要:针对武器装备快速扩散制造环境下的任务分配问题,提出了一种基于最小费用网络流的任务分配方法。本方法以完成任务的时间及费用最少为目标,首先计算出各个零件的最大产量,其次根据零件最大产量计算出产品的最大产量;然后根据产品最大产量反算出各个零件的分配产量,针对每个步骤提出了相应的计算方法;最后,以航空发动机压气机机匣中的某级机匣壳体和静子叶片为例,给出了算法验证。实例表明,该方法在解决扩散制造任务分配上是合理的、实用的。
  关键词:快速扩散制造; 任务分配; 最小费用网络流
  中图分类号:TH165文献标志码:A
  文章编号:1001-3695(2009)06-2314-05
  doi:10.3969/j.issn.1001-3695.2009.06.095
  
  Method of task assignment based on theory of minimum cost network flow forrapid proliferating manufacturing
  SU Ting-ting, MO Rong, ZHAO Yan, GAO Bo
   (Key Laboratory of Contemporary Design & Integrated Manufacturing Technology for Ministry of Education, Northwestern Polytechnical University, Xian 710072, China)
  Abstract:
  To solve the problem of task assignment in rapid proliferating manufacturing, this paper proposed the method of task assignment based on the theory of minimum cost network flow which aimed at less cost and time. Firstly, calculated the max output of each part, and secondly based on this the max output of whole product was computed, and thirdly calculated the allocated output of each part. For these three steps proposed three methods. Finally, took the aero-engine compressor shell casing and static-blisk as the calculated objects, studied a case. The fact proves that this method can efficiently solve the task assignment problem in rapid proliferating manufacturing. ......
很抱歉,暂无全文,若需要阅读全文或喜欢本刊物请联系《计算机应用研究》杂志社购买。
欢迎作者提供全文,请点击编辑
分享:
 

了解更多资讯,请关注“木兰百花园”
分享:
 
精彩图文


关键字
支持中国杂志产业发展,请购买、订阅纸质杂志,欢迎杂志社提供过刊、样刊及电子版。
关于我们 | 网站声明 | 刊社管理 | 网站地图 | 联系方式 | 中图分类法 | RSS 2.0订阅 | IP查询
全刊杂志赏析网 2017