Two Clause Learning Approaches for Disjunctive Scheduling - Archive ouverte HAL
Communication Dans Un Congrès Année : 2015

Two Clause Learning Approaches for Disjunctive Scheduling

Résumé

We revisit the standard hybrid CP/SAT approach for solving disjunctive scheduling problems. Previous methods entail the creation of redundant clauses when lazily generating atoms standing for bounds modifications. We first describe an alternative method for handling lazily generated atoms without computational overhead. Next, we propose a novel conflict analysis scheme tailored for disjunctive scheduling. Our experiments on well known Job Shop Scheduling instances show compelling evidence of the efficiency of the learning mechanism that we propose. In particular this approach is very efficient for proving unfeasibility.
Fichier principal
Vignette du fichier
cp2015.pdf (305.08 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01229050 , version 1 (16-11-2015)

Identifiants

Citer

Mohamed Siala, Christian Artigues, Emmanuel Hébrard. Two Clause Learning Approaches for Disjunctive Scheduling. Principles and Practice of Constraint Programming, Aug 2015, Cork, Ireland. pp.393-402, ⟨10.1007/978-3-319-23219-5_28⟩. ⟨hal-01229050⟩
174 Consultations
309 Téléchargements

Altmetric

Partager

More