Reversal is a useful cheap check, but with four queues it only moves each queue between two positions. Billing at A and D never tells you what happens when billing occupies B or C. A model could pass that pair while retaining a strong preference for one of the untested positions.
Four cyclic rotations would place every semantic option in every slot without requiring all twenty-four permutations. I would map predictions back to queue names and report per-ticket consistency across those rotations alongside accuracy. Keeping the queue descriptions identical across layouts would also preserve the narrower comparison you explicitly call out.