Metraipolis › archive › dc_6ef3ca629410
Time-reliability optimization of multi-pass underfill dispensing sequences on printed circuit boards: a schedule-dependent reliability model solved by a… — arXiv:2610.04186
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.04186
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-06T13:05:07.178Z
- SHA-256 of the archived text
ffd4f5f4b5b177affb6e26212b63e1b8359611156416d9c0fa0846c6a31cef89- Stable URL of this page
https://metraipolis.com/documento/dc_6ef3ca629410
How to cite
Time-reliability optimization of multi-pass underfill dispensing sequences on printed circuit boards: a schedule-dependent reliability model solved by a… — arXiv:2610.04186 — arXiv (en), https://arxiv.org/abs/2610.04186 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_6ef3ca629410 (Metraipolis archive dc_6ef3ca629410, sha256 ffd4f5f4b5b177affb6e26212b63e1b8359611156416d9c0fa0846c6a31cef89)
BibTeX
@misc{dc6ef3ca629410,
title = {Time-reliability optimization of multi-pass underfill dispensing sequences on printed circuit boards: a schedule-dependent reliability model solved by a… — arXiv:2610.04186},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.04186},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_6ef3ca629410; sha256 ffd4f5f4b5b177affb6e26212b63e1b8359611156416d9c0fa0846c6a31cef89},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.04186. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Multi-pass underfill dispensing couples cycle time with process reliability because the sequence determines the inter-pass flow times. This paper formulates a tri-objective multiset-permutation routing model that minimises nominal cycle time and additive duration variance while maximising reliability under hard- and soft-dwell policies; reliability combines pass, schedule-dependent flow and travel terms. Under independent durations and deterministic dwell thresholds, the variance measure equals the cycle-time variance under soft dwell and bounds it from above under hard dwell. A multiset-permutation binary-addition-tree algorithm enumerates the feasible routes without duplication and prunes prefixes by dominance. Six instances, including three BeagleBone Black benchmarks, yield reference Pareto fronts, the largest search space of $1.47 \times 10^{12}$ routes in 38 minutes on 20 CPU cores. Among simulated candidates, the nominally cost-selected routes incur maximum estimated excess costs of USD 0.0014 per board at the modelled duration variability and USD 0.0035 with it doubled. Round-robin dispatch is within 3.7 % of the reference optimum at the tested costs; NSGA-II and simplified swarm optimisation show at most 0.53 % observed cost regret while recovering about 30 % of the largest hard-dwell front. The framework quantifies sequencing trade-offs and heuristic decision regret; physical reliability prediction requires inspection-based calibration.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno).
Categorie arXiv: Optimization and Control (math.OC) ; Systems and Control (eess.SY).
Pagina del lavoro: https://arxiv.org/abs/2610.04186 — 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-06T11:21:31.878Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).