| Article ID: | iaor20124088 |
| Volume: | 24 |
| Issue: | 2 |
| Start Page Number: | 228 |
| End Page Number: | 244 |
| Publication Date: | Mar 2012 |
| Journal: | INFORMS Journal on Computing |
| Authors: | Langevin Andr, Guret Christelle, Jussien Narendra, Rousseau Louis-Martin, Cambazard Hadrien, Malapert Arnaud |
| Keywords: | combinatorial optimization, programming: constraints |
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.