Metraipolis › archive › dc_6f0fbf9afbd0

BOLT: Multi-Bottleneck Bound-Guided Learning for Flexible Job-Shop Scheduling with Time Lags and Resource-Coupled Transport — arXiv:2610.22433

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.22433
License (as archived)
CC0-1.0
Archived
2026-10-19T08:48:16.152Z
SHA-256 of the archived text
8f0001f0662d6662ee86d6acb50f8212a0957a6f8e93ed1bb1d81f3904da2c1b
Stable URL of this page
https://metraipolis.com/documento/dc_6f0fbf9afbd0

How to cite

BOLT: Multi-Bottleneck Bound-Guided Learning for Flexible Job-Shop Scheduling with Time Lags and Resource-Coupled Transport — arXiv:2610.22433 — arXiv (en), https://arxiv.org/abs/2610.22433 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_6f0fbf9afbd0 (Metraipolis archive dc_6f0fbf9afbd0, sha256 8f0001f0662d6662ee86d6acb50f8212a0957a6f8e93ed1bb1d81f3904da2c1b)
BibTeX
@misc{dc6f0fbf9afbd0,
  title = {BOLT: Multi-Bottleneck Bound-Guided Learning for Flexible Job-Shop Scheduling with Time Lags and Resource-Coupled Transport — arXiv:2610.22433},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.22433},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_6f0fbf9afbd0; sha256 8f0001f0662d6662ee86d6acb50f8212a0957a6f8e93ed1bb1d81f3904da2c1b},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.22433. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Flexible job-shop scheduling becomes resource-coupled when a scarce vehicle fleet moves jobs between stations, because the schedule sets the transport waits. BOLT (bound-oriented learning for transport-coupled scheduling) builds a lower bound from chain, machine-capacity, and fleet-capacity relaxations. The bound equals the makespan at termination, so its per-step changes form a reward that sums to a constant minus the makespan. Because it never exceeds the attainable makespan, each candidate's bound increase is a proven rise of the makespan floor, which the policy reads as a price. The root bound certifies a completed schedule's suboptimality gap without a solver. On industry-motivated 10-module prefabricated-construction instances, explicit transport coupling outperforms a transport-penalty policy in every tested cell where loaded moves occupy at least 66% of fleet time and in none at or below 56%. Across five zero-shot 50- and 80-module production batches, BOLT outperforms the best dispatching-rule pair on four and the penalty policy on the three with long moves. In the three-vehicle 80-module batch, its mean makespan is 13.0% below the best pair and 4.2% below an hour-budget constraint-programming solver whose proven gap averages 34%. BOLT decides in 2.3-5.9 ms per event on one processor core and re-plans a disruption in seconds.

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno).
Categorie arXiv: Machine Learning (cs.LG) ; Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2610.22433 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T08:42:40.199Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).