You are here

Two Clause Learning Approaches for Disjunctive Scheduling

Authors: 

Mohamed Siala, Christian Artigues, Emmanuel Hebrard

Publication Type: 
Refereed Conference Meeting Proceeding
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.
Conference Name: 
CP 2015
Proceedings: 
Principles and Practice of Constraint Programming
Digital Object Identifer (DOI): 
10.1007/978-3-319-23219-5_28
Publication Date: 
13/08/2015
Pages: 
393-402
Conference Location: 
Ireland
Institution: 
National University of Ireland, Cork (UCC)
Open access repository: 
No