AAAI

Association for the Advancement of Artificial Intelligence

Home > Proceedings / Proceedings of the International Conference on Automated Planning and Scheduling, 23 > Book One

An Optimal Constraint Programming Approach to the Open-Shop Problem

Authors

Arnaud Malapert,Hadrien Cambazard,Christelle Guéret,Narendra Jussien,André Langevin,Louis-Martin Rousseau

University Nice Sophia Antipolis,Grenoble Institute of Technology,University of Angers,École des Mines de Nantes INRIA TASC UMR CNRS 6241,École Polytechnique de Montréal,École Polyechnique de Montréal


Proceedings:

Book One

Volume

Issue:

Proceedings of the International Conference on Automated Planning and Scheduling, 23

Track:

Journal Presentation Track

Downloads:

Download PDF

Abstract:

This is a summary of the journal article published by Journal on Computing entitled "An Optimal Constraint Programming Approach to the Open-Shop Problem." The article 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 to search diversification and learning from restarts. This approach is compared with the best-known metaheuristics and exact algorithms, and shows better results on a wide range of benchmark instances.

DOI:

10.1609/icaps.v23i1.13575


ICAPS

Proceedings of the International Conference on Automated Planning and Scheduling, 23