Skip to Main content Skip to Navigation
New interface
Conference papers

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 metadata

Cited literature [25 references]  Display  Hide  Download
Contributor : Emmanuel Hebrard Connect in order to contact the contributor
Submitted on : Monday, November 16, 2015 - 11:10:54 AM
Last modification on : Tuesday, October 25, 2022 - 11:58:11 AM
Long-term archiving on: : Friday, April 28, 2017 - 5:16:51 PM


Files produced by the author(s)



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⟩



Record views


Files downloads