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
Affiliations:
É/cole des Mines de Nantes, LINA UMR CNRS 6241, F-44307 Nantes, France/ and É/cole Polytechnique de Montré/al, CIRRELT, Montré/al, H3C 3A7 Qué/bec, Canada;Cork Constraint Computation Centre, Department of Computer Science, University College Cork, Ireland;É/cole des Mines de Nantes, IRCCyN UMR CNRS 6597, F-44307 Nantes, France;É/cole des Mines de Nantes, LINA UMR CNRS 6241, F-44307 Nantes, France;É/cole Polytechnique de Montré/al, CIRRELT, Montré/al, H3C 3A7 Qué/bec, Canada;É/cole Polytechnique de Montré/al, CIRRELT, Montré/al, H3C 3A7 Qué/bec, Canada
Venue:
INFORMS Journal on Computing
Year:
2012

Citing 16
Cited 1

Graphs and algorithms

Graphs and algorithms
Optimal speedup of Las Vegas algorithms

Information Processing Letters
A branch & bound algorithm for the open-shop problem

GO-II Meeting Proceedings of the second international colloquium on Graphs and optimization
Open Shop Scheduling to Minimize Finish Time

Journal of the ACM (JACM)
Gaining efficiency and flexibility in the simple temporal problem

TIME '96 Proceedings of the 3rd Workshop on Temporal Representation and Reasoning (TIME'96)
Constraint Processing

Constraint Processing
An Experimental Study of Dynamic Algorithms for Transitive Closure

Journal of Experimental Algorithmics (JEA)
A dynamic topological sort algorithm for directed acyclic graphs

Journal of Experimental Algorithmics (JEA)
Beam-ACO: hybridizing ant colony optimization with beam search: an application to open shop scheduling

Computers and Operations Research
A new particle swarm optimization for the open shop scheduling problem

Computers and Operations Research
Search in a small world

IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
Nogood recording from restarts

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Complete MCS-based search: application to resource constrained project scheduling

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
On universal restart strategies for backtracking search

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Texture-based heuristics for scheduling revisited

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Compiling finite linear CSP into SAT

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming

Closing the open shop: contradicting conventional wisdom

CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming

Quantified Score

Hi-index	0.00

Visualization

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.