检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]上海第二工业大学电子与电气工程学院,上海201209 [2]上海交通大学自动化系,上海200240
出 处:《上海交通大学学报》2008年第12期1947-1952,1957,共7页Journal of Shanghai Jiaotong University
基 金:国家自然科学基金资助项目(60574049)
摘 要:给定一个制造车间,把生产每一产品所需要的所有零部件的工序合并构成了一个有序图,即物流网络,称为加工装配图(OPC),其对应的图结构可以抽象为有向树.以这样的有向树为基础,提出通过树的旋转处理算法和序列聚类分析,得到车间的平面布局,并通过一个实际使用范例证实这一方法的有效性.In a fabrication-based assembly workshop, the material flow network in the facility is obtained by merging the routings of all the parts and subassemblies into a precedence hierarchy known as an operations process chart (OPC) in literature, which inherently possesses a graph structure called a directed intree. This paper describes an algorithmic method for the design of workshop layouts that have such a hierarchical directed graph (digraph) representation of their material flows, including a tree manipulation algorithm and a sequence clustering algorithm to form layout modules. Its application in an industrial case study demonstrates the validation of this method.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.17.176.160