841 articles – 1540 Notices  [english version]
HAL : hal-00630129, version 1

Fiche détaillée  Récupérer au format
Principles and Practice of Constraint Programming - CP 2009, Lisbon : Portugal (2009)
Closing the Open Shop: Contradicting Conventional Wisdom
Diarmuid Grimes 1, Emmanuel Hebrard 1, Arnaud Malapert 2, 3
(19/09/2009)

This paper describes a new approach for solving disjunctive temporal problems such as the open shop and job shop scheduling domains. Much previous research in systematic search approaches for these problems has focused on developing problem specific constraint propagators and ordering heuristics. Indeed, the common belief is that many of these problems are too difficult to solve without such domain specific models. We introduce a simple constraint model that combines a generic adaptive heuristic with naive propagation, and show that it often outperforms state-of-the-art solvers for both open shop and job shop problems.
1 :  Cork Constraint Computation Centre (4C UCC)
University College Cork
2 :  Laboratoire d'Informatique de Nantes Atlantique (LINA)
CNRS : UMR6241 – Université de Nantes – École Nationale Supérieure des Mines - Nantes
3 :  Centre Interuniversitaire de Recherche sur les Réseaux d'Entreprise, la Logistique et le Transport (CIRRELT)
Université de Montréal – École Polytechnique de Montréal – HEC MONTRÉAL
Informatique/Recherche opérationnelle

Informatique/Intelligence artificielle