Optimization of clearance variation in selective assembly for components with multiple characteristics

Quality is an important aspect of any manufacturing process. Only high quality products can survive in the market. The consumer not only wants quality, precision and trouble-free products, but also wants them at attractive prices. When a product consists of two or more components, the quality of that product depends upon the quality of the mating parts. The mating parts may be manufactured using different machines and processes with different standard deviations. Therefore, the dimensional distributions of the mating parts are not similar. This results in clearance or interference between the mating parts. In some high precision assemblies, it may not be possible to have closer assembly clearance variation with interchangeable system. Selective assembly meets the above requisite and gives an enhanced solution. Selective assembly is a method of obtaining high precision assemblies from relatively low precision components. In this paper, a new selective assembly method is proposed to minimize the clearance variation and surplus parts for a complex assembly which consists of the components viz. piston, piston ring. In this assembly, each component will have more than one quality characteristic contributing for the assembly, for e.g., piston diameter will assemble with cylinder inner diameter; piston groove diameter will assemble with piston ring inner diameter, etc. In selective assembly each quality characteristic will fall in different groups. Non-dominated sorting genetic algorithm (NSGA) is used to find the best combination to obtain the minimum clearance variation in this assembly.

[1]  X. D. Fang,et al.  A new algorithm for minimising the surplus parts in selective assembly , 1995 .

[2]  S. M. Kannan,et al.  Genetic algorithm for minimizing assembly variation in selective assembly , 2003 .

[3]  E. M. Mansoor SELECTIVE ASSEMBLY — ITS ANALYSIS AND APPLICATIONS , 1961 .

[4]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[5]  Vijayan N. Nair,et al.  Selective Assembly in Manufacturing: Statistical Issues and Optimal Binning Strategies , 2004, Technometrics.

[6]  Tamio Arai A Simulation System on Assembly Accuracy , 1992 .

[7]  X. D. Fang,et al.  Assuring the matchable degree in selective assembly via a predictive model based on set theory and probability method , 1996 .

[8]  Kalyanmoy Deb,et al.  Multi-objective optimization using evolutionary algorithms , 2001, Wiley-Interscience series in systems and optimization.

[9]  Toshirou Iyama,et al.  Effects of Race-Matching Method for Ball Bearing Manufacture , 1995 .

[10]  Collette R. Coullard,et al.  Matching problems in selective assembly operations , 1998, Ann. Oper. Res..

[11]  X. D. Fang,et al.  PCI-based tolerance as an interface between design specifications and statistical quality control , 1998 .

[12]  V. Ya. Rubenchik,et al.  Automatic sorting of rings by size prior to selective assembly , 1979 .

[13]  G. Allen Pugh Selective assembly with components of dissimilar variance , 1992 .

[14]  D. J. Desmond,et al.  SIMPLIFICATION OF SELECTIVE ASSEMBLY , 1961 .

[15]  G. A. Pugh,et al.  Partitioning for selective assembly , 1986 .

[16]  V. Jayabalan,et al.  A New Grouping Method for Minimizing the Surplus Parts in Selective Assembly , 2002 .

[17]  S. M. Kannan,et al.  A new grouping method to minimize surplus parts in selective assembly for complex assemblies , 2001 .

[18]  Richard J. Linn,et al.  A GROUPING METHOD FOR SELECTIVE ASSEMBLY OF PARTS OF DISSIMILAR DISTRIBUTIONS , 1998 .

[19]  Yasuhiro Yamada Combinatorial Optimization of Selective Assembly in Continuous Production , 1994 .