Generalized wreath products of association schemes

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