##  [Dispatching Rule](/dispatching-rule-0) 

 Definition

A deterministic or policy function used at a resource or machine to select the next job from a queue based on job attributes (e.g., processing time, due date, priority) and the current system state; dispatching rules map observable inputs to a sequencing decision intended to advance specific operational objectives such as minimise mean flow time, lateness or maximise throughput.

 

 

 

 

 

 





## Principle

Principle

A dispatching rule translates scheduling objectives and available local information into a repeatable selection decision; the chosen rule systematically biases short‑term sequencing outcomes (mean flow time, tardiness, fairness) and therefore must be aligned with the system’s performance metric and constraints.

 

 

 

 

 





## Demonstration

Demonstration

Illustrative scenario → Situation: a single machine with queued jobs of varying lengths and due dates. Recognition: objective is to minimise average completion time. Action: apply Shortest Processing Time (SPT) dispatching. Consequence: average completion time falls, but longer jobs experience increased waiting and potential unfairness relative to due dates.

 

 

 

 

## Misapplication

Misapplication

Applying a rule (e.g., SPT) without matching it to the operational objective (e.g., minimising tardiness or meeting delivery windows) or ignoring setup dependencies; the semantic error is treating a rule as universally optimal rather than objective‑dependent and context‑sensitive.

 

 

 

 

 





## Consequence

Consequence

Appropriate rule selection can improve targeted KPIs (reduced mean flow time, fewer tardy jobs, higher throughput); however, every rule trades off other metrics (e.g., fairness, maximum lateness) and may interact poorly with sequence‑dependent setups or batching requirements.

 

 

 

 

## Reversal

Reversal

When setups are sequence‑dependent, processing times are highly variable, or objectives are multi‑criteria (cost, tardiness, stability), static single‑criterion dispatching rules often underperform; in such cases dynamic heuristics, lookahead scheduling or optimisation models are required.

 

 

 

 

 





## Boundary

Boundary

Clearly within: shop‑floor job sequencing at an individual machine or cell using observable job attributes. Boundary case: multi‑machine environments with blocking, parallel machines or batching where local dispatching must coordinate with system‑level policies. Clearly outside: strategic capacity planning or long‑term master scheduling, which are not local sequencing policies.

 

 

 

 

 





## Semantic Tension

Semantic Tension

Local optimality (minimising a chosen metric at one resource) ↔ Global objectives and fairness: rules that optimise a local KPI can degrade system‑level performance or produce unfair treatment of certain jobs.

 

 

 

 

 





## Synthesis

Synthesis

A dispatching rule is an operational mapping from state and job features to a sequencing decision; its value lies in aligning that mapping with the system’s primary objective and recognising the inevitable trade‑offs with secondary metrics and interactions.