Job Dispatching Simulator

Simulate single-machine scheduling with priority dispatching rules. Compare how different dispatching rules (SPT, EDD, WSPT, etc.) sequence jobs on a single…

Compare how different dispatching rules (SPT, EDD, WSPT, etc.) sequence jobs on a single machine. Visualize the resulting Gantt chart and evaluate performance metrics like makespan and total tardiness.

What are dispatching rules and how do they affect scheduling performance?

Dispatching rules are priority-based heuristics for sequencing jobs on machines in real time. Unlike optimal scheduling algorithms that require complete knowledge of all jobs upfront, dispatching rules make local decisions as each machine becomes available, making them practical for dynamic shop floor environments.

Common rules include SPT (Shortest Processing Time) which minimizes average flow time, EDD (Earliest Due Date) which minimizes maximum tardiness, and WSPT (Weighted Shortest Processing Time) which minimizes weighted flow time. No single rule dominates across all performance criteria — the best rule depends on the scheduling objective.

The Gantt chart visualization shows the resulting schedule timeline, while performance metrics like makespan (total completion time), total tardiness (sum of late deliveries), and average flow time quantify schedule quality. Comparing multiple rules on the same job set reveals which rule best fits the current objective.

Formula: SPT: Sort by ascending processing time (pⱼ) EDD: Sort by ascending due date (dⱼ) WSPT: Sort by descending wⱼ/pⱼ ratio CR: Sort by ascending (dⱼ - t) / pⱼ Tardiness: Tⱼ = max(0, Cⱼ - dⱼ)

Example Calculation

3 jobs: A(p=4, d=10), B(p=2, d=8), C(p=6, d=12). SPT order: B→A→C, completions: 2,6,12, tardiness: 0+0+0=0. EDD order: B→A→C (same), tardiness=0. LPT order: C→A→B, completions: 6,10,12, tardiness: 0+0+4=4. SPT is optimal here.

When to Use This Calculator

Common Mistakes to Avoid

How to Interpret Results

Related Standards & References

Frequently Asked Questions

Which dispatching rule should I use?

It depends on your objective. SPT minimizes average flow time and work-in-process inventory. EDD minimizes maximum lateness (best for meeting the tightest deadline). WSPT is optimal for minimizing weighted completion time when jobs have different priorities. CR (Critical Ratio) adapts dynamically to the current time. For most shops, try multiple rules and compare metrics.

Why not use optimal scheduling algorithms instead of dispatching rules?

Optimal scheduling (e.g., branch-and-bound, MIP) is NP-hard for most real problems — computation time grows exponentially with the number of jobs. Dispatching rules run in O(n log n) time and can handle dynamic arrivals, machine breakdowns, and priority changes in real time. In practice, sophisticated dispatching rules achieve within 5-15% of optimal for most problems.