CRT Scheduler / Optimizer

How It Works

PROBLEM: Assign N tasks to 970,200 time slots with constraints.
Brute force: search 970,200^N combinations. Impossible.

CRT INSIGHT: 970200 = 8 x 9 x 25 x 49 x 11
Instead of one giant search, solve 5 TINY problems:
  Channel D (mod 8):  8 options   — temporal phase
  Channel K (mod 9):  9 options   — resource group
  Channel E (mod 25): 25 options  — priority class
  Channel b (mod 49): 49 options  — dependency chain
  Channel L (mod 11): 11 options  — integrity check

SEARCH SPACE: 8 + 9 + 25 + 49 + 11 = 102 (additive)
vs BRUTE FORCE: 8 * 9 * 25 * 49 * 11 = 970,200 (multiplicative)

SPEEDUP: 970,200 / 102 = 9,512x for single-task assignment
For N tasks: multiplicative savings compound exponentially.

CRT reconstructs the UNIQUE global slot from 5 independent channel assignments.
L=11 channel = free consistency check. If L disagrees: schedule is corrupt.

THIS IS NOT AN APPROXIMATION. CRT reconstruction is EXACT.
The ring structure IS the optimization.

1. Task Scheduling

Tasks: Constraints: No overlap (mod channel) Dependency chains Resource limits per channel Schedule (CRT) Schedule (Brute Force) Compare Both

2. Per-Channel View

See how CRT decomposes the schedule into 5 independent problems.

3. Scaling Comparison

Watch how CRT factored search scales vs brute force as tasks increase.

4. Constraint Satisfaction

CRT channels = independent constraint dimensions. Solve each channel's constraints separately.

5. L=11 Integrity Check

Corrupt a schedule assignment. L=11 detects it instantly.