Two Clause Learning Approaches for Disjunctive Scheduling - LAAS - Laboratoire d'Analyse et d'Architecture des Systèmes Access content directly
Conference Papers Year : 2015

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.
Fichier principal
Vignette du fichier
cp2015.pdf (305.08 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

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

Identifiers

Cite

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⟩
148 View
279 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More