 |
HAL-LAAS Open Archive Laboratory for Analysis and Architecture of Systems |  |
Conference papers
Two Clause Learning Approaches for Disjunctive Scheduling
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.
Cited literature [25 references]
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
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)