Two Clause Learning Approaches for Disjunctive Scheduling

Mohamed Siala 1, * Christian Artigues 1 Emmanuel Hébrard 1
* Corresponding author
1 LAAS-ROC - Équipe Recherche Opérationnelle, Optimisation Combinatoire et Contraintes
LAAS - Laboratoire d'analyse et d'architecture des systèmes
Abstract : 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.
Complete list of metadatas

Cited literature [25 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01229050
Contributor : Emmanuel Hebrard <>
Submitted on : Monday, November 16, 2015 - 11:10:54 AM
Last modification on : Wednesday, January 15, 2020 - 1:58:07 PM
Long-term archiving on: Friday, April 28, 2017 - 5:16:51 PM

File

cp2015.pdf
Files produced by the author(s)

Identifiers

Citation

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⟩

Share

Metrics

Record views

228

Files downloads

385