Court Hearing Scheduling
Parallel Machine Scheduling · Weighted Tardiness
A court administrator must assign 8 pending hearings to 3 courtrooms over a 4-week schedule, minimizing total weighted tardiness. Criminal cases (weight 3) take priority over civil (weight 2) and family (weight 1). Each week of delay costs the judiciary $15,000–$40,000 in accumulated backlog.
Where This Decision Fits
Public service scheduling — the highlighted step is what this page optimizes
The Problem
From court dockets to optimization theory
A district court has 8 pending hearings with varying priority levels (criminal, civil, family), durations (1–4 days), and filing dates spanning weeks 1–3. Three courtrooms are available over a 4-week horizon. Each hearing has a due date based on statutory requirements, and each type carries a different weight reflecting its urgency: criminal cases (w=3), civil cases (w=2), and family cases (w=1).
The objective is to minimize total weighted tardiness — Σwj·Tj — where Tj = max(0, Cj − dj) is the tardiness of hearing j. Every day a hearing is late beyond its statutory deadline incurs backlog costs, erodes public trust, and may violate constitutional speedy trial guarantees.
| Court Domain | Parallel Machine Model | |
|---|---|---|
| Courtroom | Machine | |
| Hearing / case | Job | |
| Hearing duration (days) | Processing time pj | |
| Statutory deadline | Due date dj | |
| Case priority (criminal > civil > family) | Weight wj | |
| Minimize backlog cost | Minimize Σwj·Tj |
subject to
Σi xij = 1 ∀ j // each hearing assigned to exactly one courtroom
Cj = Sj + pj // completion = start + duration
Tj ≥ Cj − dj // tardiness ≥ lateness
Tj ≥ 0 // no negative tardiness
xij ∈ {0, 1} // binary assignment
Try It Yourself
Schedule hearings across courtrooms and see the Gantt chart update
Court Docket Scheduler
8 Hearings · 3 Courtrooms| # | Case | Type | Wt | Days | Due (day) |
|---|
Ready. Select a scenario and click “Solve & Visualize”.
| Algorithm | Σw·T | Late | On-Time | Time |
|---|---|---|---|---|
| Click Solve & Visualize | ||||
The Algorithms
Three approaches to weighted tardiness scheduling
Earliest Due Date (EDD)
O(n log n) | Optimal for 1 || LmaxSort all hearings by their due date in ascending order. Assign each hearing to the courtroom with the earliest availability. By processing the most urgent deadlines first, EDD minimizes the maximum lateness. For weighted tardiness it is not optimal but provides a strong baseline that mirrors how most courts naturally prioritize.
Weighted Shortest Processing Time (WSPT)
O(n log n) | Optimal for 1 || ΣwjCjSort hearings by wj/pj in descending order — high-priority short cases first. This rule, attributed to Smith (1956), is optimal for minimizing weighted completion time on a single machine and provides an excellent heuristic for weighted tardiness on parallel machines. It clears quick, high-weight criminal cases early.
Random Assignment
O(n) | No guaranteeAssign hearings in random order to the least-loaded courtroom. This serves as a baseline to quantify how much improvement the structured heuristics deliver. In practice, unoptimized dockets can resemble random assignment when cases are scheduled on a first-come basis without priority analysis.
Real-World Complexity
Why court scheduling goes beyond the parallel machine model
Beyond the Basic Model
- Judge specialization — Not every judge can hear every case type; criminal, family, and commercial divisions require different expertise and certifications
- Attorney availability — Counsel for both parties must be available, creating multi-resource constraints that compound scheduling difficulty
- Jury selection windows — Jury trials require additional pre-hearing days for voir dire, adding setup times to the scheduling model
- Continuance requests — Cases frequently request postponements, requiring dynamic rescheduling of the entire docket
- Plea negotiations — Criminal cases may resolve before their hearing, creating stochastic processing times (pj may drop to 0)
- Witness coordination — Expert witnesses may be shared across cases, creating precedence and resource-sharing constraints
- Constitutional deadlines — Speedy trial requirements create hard deadlines that cannot be violated, adding hard constraint dimensions
Key References
Foundational works in scheduling and court operations research
- (1956). “Various optimizers for single-stage production.” Naval Research Logistics Quarterly, 3(1-2), 59–66.
- (2016). “Scheduling: Theory, Algorithms, and Systems.” 5th Edition, Springer.
- (2009). “A model for scheduling court cases.” Interfaces, 39(5), 430–442.
Need to optimize court docket scheduling?
From hearing sequencing to judge assignment and multi-courtroom resource allocation, mathematical modeling can reduce backlog and improve access to justice. Let’s discuss how Operations Research can work for your jurisdiction.