An Optimal Constraint Programming Approach to the Open-Shop Problem
Published Online:7 Apr 2011https://doi.org/10.1287/ijoc.1100.0446
Abstract
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.
