This seems like something I should know, but I’ve been struggling with it and it’s driving me nuts. If you have p processes each involving s steps, how do you calculate the number of possible orderings for all steps across all processes? Any formula or algorithm requiring no more than p*s steps (factorial counts as one step) would be appreciated.