Solving Variants of the Job Shop Scheduling Problem through Conflict-Directed Search - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue INFORMS Journal on Computing Année : 2015

Solving Variants of the Job Shop Scheduling Problem through Conflict-Directed Search

Résumé

We introduce a simple technique for disjunctive machine scheduling problems and show that this method can match or even outperform state of the art algorithms on a number of problem types. Our approach combines a number of generic search techniques such as restarts, adaptive heuristics and solution guided branching on a simple model based on a decomposition of disjunctive constraints and on the reification of these disjuncts. This paper describes the method and its application to variants of the job shop scheduling problem (JSP). We show that our method can easily be adapted to handle additional side constraints and different objective functions, often outperforming the state of the art and closing a number of open problems. Moreover, we perform in-depth analysis of the various factors that makes this approach efficient. We show that, while most of the factors give moderate benefits, the variable and value ordering components are key.
Fichier principal
Vignette du fichier
ijoc2014.pdf (995.82 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

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

Identifiants

Citer

Diarmuid Grimes, Emmanuel Hébrard. Solving Variants of the Job Shop Scheduling Problem through Conflict-Directed Search. INFORMS Journal on Computing, 2015, 27 (2), pp.268 - 284. ⟨10.1287/ijoc.2014.0625⟩. ⟨hal-01229043⟩
136 Consultations
1806 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More