A scheduling problem with many interacting constraints is solved today with classical heuristics.
The problem is formulated for hybrid quantum-classical solvers and benchmarked against strong classical baselines using cloud-accessible hardware and simulators.
The expected result is an evidence-based view of whether, and when, quantum approaches may add value for this workload.