z-logo
open-access-imgOpen Access
The method for achievement of group interchangeability accuracy for multilink dimension chains with gaps
Author(s) -
Sergey Shilyaev,
Evgeniy Slashchev,
Yuriy Mikhaylov
Publication year - 2020
Publication title -
iop conference series. materials science and engineering
Language(s) - English
Resource type - Journals
eISSN - 1757-899X
pISSN - 1757-8981
DOI - 10.1088/1757-899x/709/2/022033
Subject(s) - interchangeability , sorting , dimension (graph theory) , automation , computer science , group (periodic table) , field (mathematics) , production (economics) , mathematics , mathematical optimization , algorithm , engineering , combinatorics , mechanical engineering , chemistry , organic chemistry , economics , macroeconomics , programming language , pure mathematics
The article provides recurrent dependencies for determining the upper and lower deviations of the sorting groups of the component parts of a dimensional chain calculated by the group interchangeability method for tasks when the closing link is a gap. The article also substantiates the necessity of formalizing the group interchangeability method for multilink dimension chains, which are divided into groups by the equal tolerance method. Using the sorting of parts for multilink dimension chains into groups and the assembly of parts within a group by the method for complete interchangeability, the technologist provides high accuracy, productivity and economy of production. At the same time, for multilink dimension chains, a graphical method is used to calculate the upper and lower deviations of the sorting groups. In this regard, a technique is proposed for automation, which allows formalizing the procedure for determining the parameters of a dimensional chain. At the same time, the field of application of the method expands, the requirements for the designer’s qualification reduce, and subjective errors are eliminated.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here