A heuristic algorithm for allocation of components in manufacturing processes (Q1821019): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0377-2217(87)90027-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2011375514 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4054519 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3707148 / rank | |||
Normal rank | |||
Latest revision as of 18:19, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A heuristic algorithm for allocation of components in manufacturing processes |
scientific article |
Statements
A heuristic algorithm for allocation of components in manufacturing processes (English)
0 references
1987
0 references
Whereas the assembly error resulting from an independent choice of toleranced components is cumulative, it may be possible to improve on this result by using the available information on the true characteristics of the components. A heuristic algorithm is developed based on the exchange method known from clustering analysis, allowing a locally minimum error allocation of series of components to form assembly sets. Different alternative forms of the algorithm are available, as can be seen from the examples presented.
0 references
combinatorial analysis
0 references
heuristic algorithm
0 references
exchange method
0 references
clustering analysis
0 references
