Robust Tolerance Synthesis With the Design of Experiments Approach

1999 ◽  
Vol 122 (3) ◽  
pp. 520-528 ◽  
Author(s):  
Chang-Xue (Jack) Feng ◽  
Andrew Kusiak

Design of tolerances impacts quality, cost, and cycle time of a product. Most literature on deterministic tolerance design has focused on developing exact and heuristic algorithms to minimize manufacturing cost. Some research has been published on probabilistic tolerance synthesis and optimization. This paper presents the design of experiments (DOE) approach for concurrent selection of component tolerances and the corresponding manufacturing processes. The objective is to minimize the variation of tolerance stackups. Numerical examples illustrate the methodology. The Monte Carlo simulation approach is used to obtain component tolerances and tolerance stackups. Process shift, the worst case and root sum square tolerance stackup constraints, and setup reduction constraints have been incorporated into the proposed methodology. Benefits of the proposed DOE approach over exact algorithms are discussed. [S1087-1357(00)00202-1]

1996 ◽  
Vol 118 (1) ◽  
pp. 166-169 ◽  
Author(s):  
A. Kusiak ◽  
Chang-Xue Feng

Design of a product (process) includes system design, parameter design, and tolerance design. Robust design is closely applicable to parameter design and tolerance design. The current literature on robust design has focused on parameter design while the problem of tolerance design has not been adequately covered. The tolerance design literature emphasizes the use of optimization to minimize cost while little attention has been paid to minimizing the sensitivity of tolerances to the variation of manufacturing processes. This paper discusses the application of the design of experiments (DOE) approach to tolerance synthesis to minimize manufacturing variations in a probabilistic case. The DOE approach is illustrated with an example.


2015 ◽  
Vol 07 (03) ◽  
pp. 1550032 ◽  
Author(s):  
Abdullah N. Arslan ◽  
Betsy George ◽  
Kirsten Stor

The pattern matching with wildcards and length constraints problem is an interesting problem in the literature whose computational complexity is still open. There are polynomial time exact algorithms for its special cases. There are heuristic algorithms, and online algorithms that do not guarantee an optimal solution to the original problem. We consider two special cases of the problem for which we develop offline solutions. We give an algorithm for one case with provably better worst case time complexity compared to existing algorithms. We present the first exact algorithm for the second case. This algorithm uses integer linear programming (ILP) and it takes polynomial time under certain conditions.


1990 ◽  
Vol 112 (2) ◽  
pp. 113-121 ◽  
Author(s):  
Woo-Jong Lee ◽  
T. C. Woo

Tolerance, representing a permissible variation of a dimension in an engineering drawing, is synthesized by considering assembly stack-up conditions based on manufacturing cost minimization. A random variable and its standard deviation are associated with a dimension and its tolerance. This probabilistic approach makes it possible to perform trade-off between performance and tolerance rather than the worst case analysis as it is commonly practiced. Tolerance (stack-up) analysis, as an inner loop in the overall algorithm for tolerance synthesis, is performed by approximating the volume under the multivariate probability density function constrained by nonlinear stack-up conditions with a convex polytope. This approximation makes use of the notion of reliability index [10] in structural safety. Consequently, the probabilistic optimization problem for tolerance synthesis is simplified into a deterministic nonlinear programming problem. An algorithm is then developed and is proven to converge to the global optimum through an investigation of the monotonic relations among tolerance, the reliability index, and cost. Examples from the implementation of the algorithm are given.


10.14311/696 ◽  
2005 ◽  
Vol 45 (3) ◽  
Author(s):  
H.-A. Crostack ◽  
M. Höfling ◽  
J. Liangsiri

Production is a multi-step process involving many different articles produced in different jobs by various machining stations. Quality inspection has to be integrated in the production sequence in order to ensure the conformance of the products. The interactions between manufacturing processes and inspections are very complex since three aspects (quality, cost, and time) should all be considered at the same time while determining the suitable inspection strategy. Therefore, a simulation approach was introduced to solve this problem.The simulator called QUINTE [the QUINTE simulator has been developed at the University of Dortmund in the course of two research projects funded by the German Federal Ministry of Economics and Labour (BMWA: Bundesministerium für Wirtschaft und Arbeit), the Arbeitsgemeinschaft industrieller Forschungsvereinigungen (AiF), Cologne/Germany and the Forschungsgemeinschaft Qualität, Frankfurt a.M./Germany] was developed to simulate the machining as well as the inspection. It can be used to investigate and evaluate the inspection strategies in manufacturing processes. The investigation into the application of QUINTE simulator in industry was carried out at two pilot companies. The results show the validity of this simulator. An attempt to run QUINTE in a user-friendly environment, i.e., the commercial simulation software – Arena® is also described in this paper.NOTATION: QUINTE Qualität in der Teilefertigung  (Quality in  the manufacturing process)  


Proceedings ◽  
2020 ◽  
Vol 63 (1) ◽  
pp. 47
Author(s):  
Karam Al-Akel ◽  
Liviu-Onoriu Marian

Even if Lean and Six Sigma tools are available for large audiences, many of the continuous improvement projects fail due to the lack of a pathway that ensures appropriate results in a timely manner. We would like to address this universal issue by generating, testing and validating an algorithm that improves manufacturing processes in a controlled manner. With a selection of the most valuable set of tools and concepts implemented in a specific order, a guideline for successful project implementation is proposed. Decreasing the overall number of continuous improvement project failures is the main scope of our algorithm and suggested methodology.


Machines ◽  
2021 ◽  
Vol 9 (6) ◽  
pp. 124
Author(s):  
Dantam Rao ◽  
Madhan Bagianathan

Currently, permanent-magnet-type traction motors drive most electric vehicles. However, the potential demagnetization of magnets in these motors limits the performance of an electric vehicle. It is well known that during severe duty, the magnets are demagnetized if they operate beyond a ‘knee point’ in the B(H) curve. We show herein that the classic knee point definition can degrade a magnet by up to 4 grades. To prevent consequent excessive loss in performance, this paper defines the knee point k as the point of intersection of the B(H) curve and a parallel line that limits the reduction in its residual flux density to 1%. We show that operating above such a knee point will not be demagnetizing the magnets. It will also prevent a magnet from degenerating to a lower grade. The flux density at such a knee point, termed demag flux density, characterizes the onset of demagnetization. It rightly reflects the value of a magnet, so can be used as a basis to price the magnets. Including such knee points in the purchase specifications also helps avoid the penalty of getting the performance of a low-grade magnet out of a high-grade magnet. It also facilitates an accurate demagnetization analysis of traction motors in the worst-case conditions.


Symmetry ◽  
2021 ◽  
Vol 13 (2) ◽  
pp. 156
Author(s):  
Juntao Zhu ◽  
Hong Ding ◽  
Yuchen Tao ◽  
Zhen Wang ◽  
Lanping Yu

The spread of a computer virus among the Internet of Things (IoT) devices can be modeled as an Epidemic Containment (EC) game, where each owner decides the strategy, e.g., installing anti-virus software, to maximize his utility against the susceptible-infected-susceptible (SIS) model of the epidemics on graphs. The EC game’s canonical solution concepts are the Minimum/Maximum Nash Equilibria (MinNE/MaxNE). However, computing the exact MinNE/MaxNE is NP-hard, and only several heuristic algorithms are proposed to approximate the MinNE/MaxNE. To calculate the exact MinNE/MaxNE, we provide a thorough analysis of some special graphs and propose scalable and exact algorithms for general graphs. Especially, our contributions are four-fold. First, we analytically give the MinNE/MaxNE for EC on special graphs based on spectral radius. Second, we provide an integer linear programming formulation (ILP) to determine MinNE/MaxNE for the general graphs with the small epidemic threshold. Third, we propose a branch-and-bound (BnB) framework to compute the exact MinNE/MaxNE in the general graphs with several heuristic methods to branch the variables. Fourth, we adopt NetShiled (NetS) method to approximate the MinNE to improve the scalability. Extensive experiments demonstrate that our BnB algorithm can outperform the naive enumeration method in scalability, and the NetS can improve the scalability significantly and outperform the previous heuristic method in solution quality.


2012 ◽  
Vol 499 ◽  
pp. 3-8
Author(s):  
Xin You Li ◽  
Wu Yi Chen

In order to reduce manufacturing cost, a methodology of accuracy synthesis for machine tool was recommended by combining both machining cost and Least Square method. Weighted coefficients representing the machining difficulty of manufacturing processes were introduced. 3PRS/UPS redundant parallel kinematic mechanism (3PRS/UPS PKM) was taken as an example, and its component tolerances were derived by the proposed method. Comparing with conventional method, the component tolerances were allocated reasonably. A further tolerance allocation for spherical and rotational joints was studied in detail. And hence, the producibility of component was improved and the manufacturing cost was reduced. The results showed that the proposed method was capable of producing tolerance allocations economically and accurately.


Sign in / Sign up

Export Citation Format

Share Document