检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]天津大学管理学院,天津300072
出 处:《中国管理科学》2011年第1期77-83,共7页Chinese Journal of Management Science
基 金:国家自然科学基金面上项目(70671072)
摘 要:面向复杂零件的协同制造,以工艺流程为核心将协同制造任务进行分解,并有效利用"逻辑制造单元"和"逻辑加工路线"等概念描述复杂零件的协同制造任务,最终目标是形成基于复杂零件工艺流程的、可支撑异地协同生产的加工路线。对复杂零件协同制造的制造资源优化配置问题进行了数学分析和描述,建立了问题的目标函数与约束条件。本文以加工时间、运输费用和加工质量作为目标,约束条件包括顺序约束、释放期约束、时间约束、交货期约束、成本约束和质量约束,最终将资源优化配置问题归结为多目标优化问题,并利用遗传算法进行求解,得到了较为满意的结果。通过实例分析,将模型应用于某型号发动机叶片协同制造,说明采用本论文的模型可以有效解决复杂零件协同制造的资源优化配置问题。In order to solve resource optimizing deployment problem for cooperative manufacturing of complex parts,the cooperative manufacturing task is decomposed by taking process flow as core.The concepts such as LMU(logical manufacturing unit)and LMP(logical manufacturing process),etc.are used to describe cooperative manufacturing task of complex parts.The ultimate goal is to establish a process routing that can support cooperative manufacturing based on process flows of complicated parts.The objective function and constraints of the problem are established.The problem of resource optimizing deployment is converted to multi-objective optimization model,with processing time,delivery expense and processing quality as objectives,and sequence,release time,production time,time of delivery,cost and quality as constraints,and is solved by genetic algorithm.At last,the model is used for the coordination manufacturing of an generator engine.This example proves the feasibility and validity of the method.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.44