Comparison among run order algorithms for sequential factorial experiments
Four algorithms for sequencing runs of the 2n factorial experiment are compared according to the two criteria: the number of factor level changes (i.e. cost) and the time trend resistance. These algorithms are: Correa et al. (2009), Cui and John (1998), Cheng and Jacroux (1988) and Coster and Cheng (1988), referred to here as Algorithms I, II, III (a and b) and IV, respectively. The comparison includes also the identification of whether a run order of one algorithm can equivalently be generated by another algorithm.
Volume (Year): 58 (2013)
Issue (Month): C ()
|Contact details of provider:|| Web page: http://www.elsevier.com/locate/csda|
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Alexander Correa & Pere Grima & Xavier Tort-Martorell, 2009. "Experimentation order with good properties for 2k factorial designs," Journal of Applied Statistics, Taylor & Francis Journals, vol. 36(7), pages 743-754.
- Guillermo De Leon Adams & Pere Grima Cintas & Xavier Tort-Martorell Llabres, 2005. "Experimentation order in factorial designs with 8 or 16 runs," Journal of Applied Statistics, Taylor & Francis Journals, vol. 32(3), pages 297-313.
When requesting a correction, please mention this item's handle: RePEc:eee:csdana:v:58:y:2013:i:c:p:397-406. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu)
If references are entirely missing, you can add them using this form.