Design of experiments: useful orthogonal arrays for number of experiments from 4 to 16 (Q925782): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: D\(_{s}\)-optimal experimental plans for robust parameter design / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A linear programming bound for orthogonal arrays with mixed levels / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The lattice of \(N\)-run orthogonal arrays / rank | |||
Normal rank | |||
Latest revision as of 09:41, 28 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Design of experiments: useful orthogonal arrays for number of experiments from 4 to 16 |
scientific article |
Statements
Design of experiments: useful orthogonal arrays for number of experiments from 4 to 16 (English)
0 references
22 May 2008
0 references
Summary: A methodology for the design of an experiment is proposed in order to find as many schemes as possible with the maximum number of factors with different levels for the smallest number of experimental runs. An algorithm was developed and homemade software was implemented. The abilities in generation of the largest groups of orthogonal arrays were analyzed for experimental runs of 4, 6, 8, 9, 10, 12, 14, 15, and 16. The results show that the proposed method permits the construction of the largest groups of orthogonal arrays with the maximum number of factors.
0 references
design of experiment
0 references
orthogonal arrays
0 references
Taguchi method
0 references
0 references
