An Optimal Constraint Programming Approach to the Open-Shop Problem - IMT Atlantique Accéder directement au contenu
Article Dans Une Revue INFORMS Journal on Computing Année : 2012

An Optimal Constraint Programming Approach to the Open-Shop Problem

Résumé

This paper presents an optimal constraint programming approach for the open-shop scheduling problem, which integrates recent constraint propagation and branching techniques with new upper bound heuristics. Randomized restart policies combined with nogood recording allow us to search diversification and learning from restarts. This approach is compared with the best-known metaheuristics and exact algorithms, and it shows better results on a wide range of benchmark instances.

Dates et versions

hal-00685160 , version 1 (04-04-2012)

Identifiants

Citer

Arnaud Malapert, Hadrien Cambazard, Christelle Guéret, Narendra Jussien, André Langevin, et al.. An Optimal Constraint Programming Approach to the Open-Shop Problem. INFORMS Journal on Computing, 2012, - (24), pp.228 - 244. ⟨10.1287/ijoc.1100.0446⟩. ⟨hal-00685160⟩
321 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More