Please use this identifier to cite or link to this item: https://doi.org/10.1002/qre.1072
Title: Three-level and mixed-level orthogonal arrays for lean designs
Authors: Ma, C.-X.
Ai, M.-Y.
Chan, L.Y.
Goh, T.N. 
Keywords: 3-level orthogonal array
D-optimality
Design of experiments
Lean design
Mixed-level orthogonal array
Issue Date: Oct-2010
Source: Ma, C.-X.,Ai, M.-Y.,Chan, L.Y.,Goh, T.N. (2010-10). Three-level and mixed-level orthogonal arrays for lean designs. Quality and Reliability Engineering International 26 (6) : 529-539. ScholarBank@NUS Repository. https://doi.org/10.1002/qre.1072
Abstract: Orthogonal arrays (OA's) are widely used in design of experiments. Each OA has a specific number of rows that is fixed by the number of factors in the OA and the number of levels in each factor. In a practical application of an industrial experiment, however, because of various operational constraints it could happen that the number of runs of the experiment cannot be set exactly equal to the number of rows of an OA. In this case, a lean design can be used. A lean design is obtained by removing some specific rows and columns from the extended design matrix formed from an OA, so that the resulting sub-matrix still allows efficient estimation of the effects of some of the factors. Tables for 2-level lean designs are already available in the literature. In this paper, the authors will investigate 3-level lean designs and mixed-level lean designs, and construct tables for such designs for convenient use. Copyright © 2009 John Wiley & Sons, Ltd.
Source Title: Quality and Reliability Engineering International
URI: http://scholarbank.nus.edu.sg/handle/10635/63380
ISSN: 07488017
DOI: 10.1002/qre.1072
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

2
checked on Dec 5, 2017

WEB OF SCIENCETM
Citations

2
checked on Oct 28, 2017

Page view(s)

36
checked on Dec 9, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.