Generalized wreath products of association schemes

Given a finite partially ordered set X , and, for each x in X , an association scheme on a set Ω x , we show how to define an association scheme on ∏ x Ω x in a way that specializes to iterated crossing and nesting when X is series–parallel. The character table of the new association scheme is found.