Enhancing Hybrid CP-SAT Search for Disjunctive Scheduling - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

Enhancing Hybrid CP-SAT Search for Disjunctive Scheduling

Résumé

Disjunctive scheduling problems such as the job shop and open shop are at the heart of many real world scheduling instances. In this paper, we frame such problems as disjunctive temporal networks associated with a makespan minimization objective. For those, we propose a hybrid approach between SAT/SMT and CP solvers. In particular, we keep from SMT solvers the aggregated constraint propagation in decision procedures as well as the explanations and clause learning mechanisms upon conflict. However, like all CP solvers, we maintain an explicit domain representation of integer variables, tightly integrated with clause learning. Automated search exploits explanations to derive activity-based heuristics combined with the more classical value-based heuristics of CP solvers. The resulting solver is shown to be competitive with state-of-the-art exhaustive search solvers on the classical benchmarks of job shop and open shop problems.
Fichier principal
Vignette du fichier
aries-jobshop.pdf (481.82 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04174800 , version 1 (01-08-2023)

Identifiants

  • HAL Id : hal-04174800 , version 1

Citer

Arthur Bit-Monnot. Enhancing Hybrid CP-SAT Search for Disjunctive Scheduling. 26th European Conference on Artificial Intelligence (ECAI 2023)), Sep 2023, Krakow, Poland. ⟨hal-04174800⟩
75 Consultations
225 Téléchargements

Partager

Gmail Facebook X LinkedIn More