A systematic approach for automatic assembly sequence plan generation

被引:37
作者
Lai, HY [1 ]
Huang, CT [1 ]
机构
[1] Natl Cheng Kung Univ, Dept Mech Engn, Tainan 701, Taiwan
关键词
assembly sequences planning; liaison matrix; precedence relations;
D O I
10.1007/s00170-003-1760-5
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper presents a systematic approach for automatic assembly sequence plan generation (ASPG) by using an integrated framework of the part liaison matrix and precedence Boolean relations. The objective of this study is to propose a unified and integrated mathematical representation, manageable by computer programs, that allows an optimal assembly sequence be generated for various different production conditions and environment. To meet the aforementioned objective, a five-step modelling procedure is presented. In the first step, the product design and production information associated with part allocations and assembling sequences are logically arranged, simplified and systematically coded into the liaison matrix and precedence Boolean algebraic expression. In the second step, the position and assembly sequence relations of the original product are simplified into the so-called sub-assembly by using a group-like technology method. By doing so, the liaison matrix and precedence Boolean relation of the grouped sub-assemblies can then be easily obtained in the third modelling step. In the fourth modelling step, the constrained precedence Boolean relations of the grouped sub-assemblies are characterised and generalised for use in the proposed model. By simultaneously solving the aforementioned general and constrained position and precedence Boolean relations, the optimised assembly sequence of the underlying product can be quickly obtained in the fifth modelling step. A product assembly example is presented to illustrate the effectiveness of the proposed modelling approach. The enhancement of assembly efficiency and quality are also carefully evaluated .
引用
收藏
页码:752 / 763
页数:12
相关论文
共 25 条
[1]   A METHODOLOGY FOR ANALYSIS OF ASSEMBLY OPERATIONS DIFFICULTY [J].
BENARIEH, D .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1994, 32 (08) :1879-1895
[2]  
Bourjault A., 1984, Contribution a une approche methodologique de l'assemblage automatise: elaboration automatique des sequences operatoires
[3]  
CHEN SF, 1999, P 1999 ASME DES ENG, P563
[4]   SIMPLIFIED GENERATION OF ALL MECHANICAL ASSEMBLY SEQUENCES [J].
DEFAZIO, TL ;
WHITNEY, DE .
IEEE JOURNAL OF ROBOTICS AND AUTOMATION, 1987, 3 (06) :640-658
[5]   AND OR GRAPH REPRESENTATION OF ASSEMBLY PLANS [J].
DEMELLO, LSH ;
SANDERSON, AC .
IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, 1990, 6 (02) :188-199
[6]   REPRESENTATIONS OF MECHANICAL ASSEMBLY SEQUENCES [J].
DEMELLO, LSH ;
SANDERSON, AC .
IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, 1991, 7 (02) :211-227
[7]   Generation of optimized assembly sequences using genetic algorithms [J].
Dini, G ;
Failli, F ;
Lazzerini, B ;
Marcelloni, F .
CIRP ANNALS 1999 - MANUFACTURING TECHNOLOGY, 1999, :17-20
[8]  
Dini G, 1992, CIRP Ann-Manuf Technol, V41, P1, DOI 10.1016/s0007-8506(07)61140-8
[9]  
GOTTIPOLU RB, 1995, INT J COMPUT APPL T, V8, P125
[10]   Disassembly sequence plan generation using a branch-and-bound algorithm [J].
Güngör, A ;
Gupta, SM .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2001, 39 (03) :481-509