IDEAS home Printed from https://ideas.repec.org/a/eee/csdana/v58y2013icp397-406.html
   My bibliography  Save this article

Comparison among run order algorithms for sequential factorial experiments

Author

Listed:
  • Hilow, Hisham

Abstract

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.

Suggested Citation

  • Hilow, Hisham, 2013. "Comparison among run order algorithms for sequential factorial experiments," Computational Statistics & Data Analysis, Elsevier, vol. 58(C), pages 397-406.
  • Handle: RePEc:eee:csdana:v:58:y:2013:i:c:p:397-406
    DOI: 10.1016/j.csda.2012.09.013
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167947312003428
    Download Restriction: Full text for ScienceDirect subscribers only.

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. 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.
    2. 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.
    Full references (including those not matched with items on IDEAS)

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. 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). General contact details of provider: http://www.elsevier.com/locate/csda .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.