Comparison among run order algorithms for sequential factorial experiments

DOI10.1016/J.CSDA.2012.09.013zbMath1365.62310OpenAlexW1987237364MaRDI QIDQ2361212

Hisham Hilow

Publication date: 30 June 2017

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.csda.2012.09.013

zbMATH Keywords

time trend robust run ordersgeneralized fold-over schemenumber of factor level changes and experimental costrun order algorithmssequential factorial experimentsstandard run order

Mathematics Subject Classification ID

Factorial statistical designs (62K15)

Related Items (5)

Minimum cost trend-free \(2^{n -(n - k)}\) fractional factorial designs of resolution IV derivable from the normalized Sylvester-Hadamard matrices ⋮ Minimum cost linear trend-free 12-run fractional factorial designs ⋮ Three categories of minimum cost trend resistant \(2^n\) factorial experiments derivable from the normalized Sylvester-Hadamard matrices of size \(2^n \times 2^n\) ⋮ Minimum Cost Linear Trend Free 2^n-(n-k)Designs of Resolution IV ⋮ Three categories of minimum cost systematic full \(2^{\mathrm{n}}\) factorial designs

Cites Work

• Unnamed Item
• Minimum cost trend-free run orders of fractional factorial designs
• Experimentation order with good properties for 2^kfactorial designs
• Experimentation order in factorial designs with 8 or 16 runs
• The Construction of Trend-Free Run Orders of Two-Level Factorial Designs
• Designing Experiments When Run Order Is Important
• Time-trend free run orders with the minimum level changes
• Some Run Orders Requiring a Minimum Number of Factor Level Changes for the 2 4 and 2 5 Main Effect Plans
• Technical and economic aspects of a floating offshore wind farm

This page was built for publication: Comparison among run order algorithms for sequential factorial experiments