An Efficient Constraint Programming Approach to Preemptive Job Shop Scheduling - LAAS - Laboratoire d'Analyse et d'Architecture des Systèmes Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

An Efficient Constraint Programming Approach to Preemptive Job Shop Scheduling

Résumé

Constraint Programming has been widely, and very successfully, applied to scheduling problems. However, the focus has been on uninterruptible tasks, and preemptive scheduling problems are typically harder for existing constraint solvers. Indeed, one usually needs to represent all potential task interruptions thus introducing many variables and symmetrical or dominated choices. In this paper, building on mostly known results, we observe that a large class of preemptive disjunctive scheduling problems do not require an explicit model of task interruptions. We then introduce a new constraint programming approach for this class of problems that significantly outperforms state-of-the-art dedicated approaches in our experimental results.
Fichier principal
Vignette du fichier
LIPIcs-CP-2023-19.pdf (829.32 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04245373 , version 1 (17-10-2023)

Identifiants

Citer

Carla Juvin, Emmanuel Hebrard, Laurent Houssin, Pierre Lopez. An Efficient Constraint Programming Approach to Preemptive Job Shop Scheduling. 29th International Conference on Principles and Practice of Constraint Programming, Aug 2023, Toronto ( CA ), Canada. pp.19, ⟨10.4230/LIPIcs.CP.2023.19⟩. ⟨hal-04245373⟩
62 Consultations
19 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More