Id guess that youd have a hard time doing this in SD. Its a very standard
type of problem, usually handled with discrete event methods. The
interesting feature is the rules to be used to select work at each batch
stage, such as shortest job first, oldest job first and so on. Outputs
are usually as distributions of through-time, queue lengths, and so on.
Beware of priority rules. I once simulated such a system and, half way
through my work, the chief engineer allowed the progress planners to put red
labels on jobs that the customers thought were urgent. The result? Within
about two weeks the factory floor was a sea of red.
Geoff Coyle
From: "geoff coyle" <geoff.coyle@btinternet.com>