- Start every limit at 1. Add tokens 1 at a time until one person is always busy, then apply Theory of Constraints.
- Start every limit at an arbitrarily large value, like 10. Subtract tokens 1 at a time until flow is observed. Then start looking for a way to remove 1 more.
- Create a Value Stream Map and measure the time-on-task distribution of each activity. Use Little’s Law to calculate the corresponding queue sizes.
Notice that “match the number of people currently available” is not one of the ways. You’re trying to discover how many people you need not how many you have.