New Version

Assembly-line scheduling · QPC on IBM Heron r2

Three parallel production lines, twelve jobs, one coupled assignment problem (Hernandez et al. case class, arXiv:2605.30252). QPC runs line A / line B / line C as polycontextural blocks in one IBM Heron r2 submission. Recommended customer tryout domain.

Plain English

What this is
Assign each job to exactly one assembly line while balancing processing time, tardiness, and changeover penalties. Factory scheduling on three co-resident lines.
What QPC computed
12-job pilot on ibm_fez · 36 active variables · 156Q Heron r2 layout · 8192 shots · decoder = schedule cost (lower is better).
QPC result
Polycontextural decoder: schedule cost 39.7936 · 0 late jobs · one coupled job · d96daa0tcv6s73djknig.
What that means
Every job lands on a feasible line with no late-job flags under the declared threshold. A concrete operations plan from one polycontextural quantum run: three lines coupled in one job.

Lane B · Industry pilot. Headline 0 late jobs uses QPC’s declared problem decoder on quantum samples from one coupled 156-qubit job. Operations KPI from that readout.

Try your own line weights: optimization showcase · Architecture proofs: JSC.

Customer tryout. Manufacturing buyers map showcase sliders to Line A / B / C priority and coupling between lines. Same 8-parameter pattern as this pilot, bounded for evaluation.

IBM Fez · Heron r2 156Q (July 2026)

QPC executionSchedule costLate jobsQubitsDepthIBM job ID
QPC polycontextural (one run)39.79360156116d96daa0tcv6s73djknig

Three line contextures co-reside on Heron r2: morphogrammatic padding, transjunction bridges on shared job families, one gate-native Fez submission for multi-line scheduling structure.

QPC circuit layout (one submission)

warm-start assignments → [Line A contexture: local scheduling cost on line-A family jobs] → transjunction (shared sequencing variables) → [Line B contexture: local scheduling cost] → transjunction → [Line C contexture: local scheduling cost] → transjunction closure → one-hot mixer (one line per job) → measure → schedule_cost() + late_jobs()

Related pilots

Request showcase run → Heron trilogy overview Task definition