CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

An Efficient Solution to the Discrete Least-Cost Tolerance Allocation Problem With General Loss Functions

Johan Lööf (Institutionen för produkt- och produktionsutveckling, Produktutveckling) ; Tomas Hermansson ; Rikard Söderberg (Institutionen för produkt- och produktionsutveckling, Produktutveckling)
The 9th CIRP International Seminar on Computer Aided Tolerancing, April 11-12, Tempe, Arizona, USA (2005)
[Konferensbidrag, övrigt]

The tolerance allocation problem consists of choosing tolerances on dimensions of a complex assembly so that they combine into an ‘optimal state’ while retaining certain requirements. This optimal state often coincides with the minimum manufacturing cost of the product. Sometimes it is balanced with an artificial cost that the deviation from target induces on the quality of the product. This paper analyses and suggests a solution to the discrete allocation problem. It also extends the problem to include treating general loss functions. General loss in this paper means an arbitrary polynomial function of a certain degree. We also briefly review the current work that has been made on solving the tolerance allocation problem.

Nyckelord: Tolerance allocation, Quality loss, Discrete Optimization



Denna post skapades 2006-08-25. Senast ändrad 2016-01-12.
CPL Pubid: 7853

 

Institutioner (Chalmers)

Institutionen för produkt- och produktionsutveckling, Produktutveckling

Ämnesområden

Teknisk mekanik

Chalmers infrastruktur