Key takeaways
When several jobs wait at the same machine, something has to decide the order. Dispatching rules are those decisions, made explicit. They are simple, but the rule you choose quietly determines whether you favor speed, due dates, or fairness.
The set of jobs and their total work is fixed, but the order you run them in changes average wait time, how many orders are late, and how long the longest job sits. Good sequencing extracts more performance from the exact same capacity, which is why dispatching rules matter most at the bottleneck.
Four jobs wait at a machine with processing times of 1, 2, 3, and 4 hours. Run them shortest first and the average completion time is far lower than running longest first, because the quick jobs clear the queue early. But if the 4-hour job is due first, EDD would run it now to avoid a late shipment, accepting a higher average wait. Same jobs, different rule, different winner.
Dispatching rules assume each job takes its expected time. When real OEE varies, processing times drift and a rule tuned on paper underperforms on the floor. Sequencing against measured cycle times, especially at the constraint, makes the rules pay off. Book a Fabrico demo to see how live performance data supports smarter sequencing. Dispatching rules also live inside APS and finite-capacity scheduling.
There is no universal best. Shortest processing time minimizes average flow time; earliest due date minimizes lateness. Pick the rule that matches the metric you are judged on.
At the bottleneck. Sequencing the constraint well lifts the whole plant, while resequencing a resource with spare capacity has little effect.