检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《计算机集成制造系统》2006年第6期857-861,共5页Computer Integrated Manufacturing Systems
摘 要:为实现汽车装配工艺的快速规划,提出将汽车装配工艺规划的区域层次法与任务分配的最大集算法相接合的方法。首先,对汽车零部件装配关系进行分析,并据此进行整车区域层次建模,形成“零部件∈层次∈区域∈整车”的树状结构,在此基础上对零部件进行检索,生成装配任务,确定各任务之间的优先关系;然后运用最大集算法确定各区域内装配任务的先后顺序,将各任务分配到区域子工位;最后,结合生产线实际资源约束情况,对各区域子工位之间的作业顺序进行调整,从而完成规划。应用这种规划方法,开发了一套面向汽车总装的计算机辅助工艺规划系统,实现了装配任务的快速自动规划。To realize fast process planning for automobile final assembly, a process planning method was presented based on the combination of zone/layer method for automobile final assembly task generation and largest set rule for task distribution. Firstly, based on the analysis of the assembly relationships among different parts, a zone/layer model of the whole automobile was established, which formed as a tree in the form of "part layer zone automobile". The parts were searched from the tree, and then the assembly tasks were generated and the priorities of the tasks were defined. Secondly, the task sequence within every zone was determined by largest set rule and the tasks were distributed into different sub-stations. Finally, the sequence of the sub-station of different zone was adjusted under production resources constraints. Based on this planning method, a computer-aided process planning system for automobile final assembly was developed so that the fast and automated process planning was realized.
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28