{
  "abstract": "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.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2610.04186",
  "author_total": 1,
  "authors": [
    {
      "name": "Wei-Chang Yeh"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/4kv8xn95p6v35.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2610.04186",
  "fulltext_url": null,
  "id": "4kv8xn95p6v35",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2610.04186",
  "language": null,
  "licence": "LicenseRef-arXiv-nonexclusive-1.0",
  "licence_label": "arXiv licence",
  "licence_source": "article",
  "licence_url": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "cs.SY"
    ],
    [
      "arxiv",
      "eess.SY"
    ],
    [
      "arxiv",
      "math.OC"
    ],
    [
      "openalex",
      "2209|Scheduling and Optimization Algorithms"
    ]
  ],
  "openalex": "W7220648222",
  "pdf_url": "https://arxiv.org/pdf/2610.04186",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-03",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/4kv8xn95p6v35.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:27:10Z",
      "native_id": "2610.04186",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2610.04186"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math.OC",
      "subfield": "optimisation-control"
    }
  ],
  "title": "Time-reliability optimization of multi-pass underfill dispensing sequences on printed circuit boards: a schedule-dependent reliability model solved by a multiset-permutation binary-addition-tree algorithm",
  "title_text": "Time-reliability optimization of multi-pass underfill dispensing sequences on printed circuit boards: a schedule-dependent reliability model solved by a multiset-permutation binary-addition-tree algorithm",
  "type": "preprint",
  "updated_at": "2026-10-30T12:27:10Z",
  "url": "https://research.draconitic.com/paper/4kv8xn95p6v35",
  "venue": "arXiv",
  "versions": []
}