Accès ouvert · CC BY

Conflict-Weighting Variable Selection in Reactive Multi-Objective Job-Shop and RCPSP

Article scientifique 2026 Sciences mathématiques et statistiques Anglais

Résumé

Abstract Conflict-weighting variable selection (dom/wdeg and its descendants) is central to constraint-programming (CP) search for scheduling, yet its variants are easily conflated, and their behaviour under repeated multi-objective re-solving of perturbed snapshots with long-scope propagators (noOverlap, cumulative) had not been characterised. We first make the weight-increment rules explicit: crediting a propagator failure to the entire scope of the failing constraint is the original dom/wdeg rule of 2004, as implemented by Choco's domOverWDegSearch; per-variable attribution is a later refinement. We compare scope-sharing, per-variable weighting, and a History of Decisions (HD) augmentation in a single Choco harness where only the increment rule varies, on 162 standard job-shop and PSPLIB Resource-Constrained Project Scheduling Problem (RCPSP) instances with paired seeds and five reactive snapshots (159 form the test set). Three findings emerge: scope-sharing coincides with Choco dom/wdeg up to tie-breaking; measured instantaneous scope-freshness is low, making the sufficient high-freshness convergence bound vacuous on these benchmarks, and direct search-tree measurements show the two rules are not interchangeable in the tested regime; and HD leaves hypervolume unchanged while reducing search effort on the RCPSP instances where proofs close. Against contextual priority-rule Non-dominated Sorting Genetic Algorithm (NSGA-II/III) baselines at an equal per-snapshot budget, the CP selectors attain higher hypervolume and far lower internal solver time on RCPSP only; NSGA leads on job-shop hypervolume, a gap that persists when its fronts are capped to the CP front cardinality. Conflict-weighting gains are thus family-dependent; we provide the controlled, reproducible benchmark that delimits where the variants genuinely differ.

Citer ce document

Ouali, L., Bezoui, M., & Amroun, K. (2026). Conflict-Weighting Variable Selection in Reactive Multi-Objective Job-Shop and RCPSP. Research Square. https://doi.org/10.21203/rs.3.rs-10008411/v1

Exporter : BibTeX · RIS (Zotero, Mendeley, EndNote)

Accès au document

Texte intégral archivé sur SPHAERO, en accès ouvert : lisible gratuitement en ligne après connexion. Le document reste aussi disponible à sa source. Se connecter

Voir l'article sur le site de la revue

Licence et provenance

Licence : CC BY

Notice moissonnée depuis OpenAlex le 16/11/2026. Le document reste hébergé par sa source.
Voir le document à la source →

Statistiques

Consultations (hors robots) : 1

Téléchargements (hors robots) : 0

Méthode de comptage