Comparison among run order algorithms for sequential factorial experiments

摘要

Four algorithms for sequencing runs of the 2 ~n 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.