Conference Paper

# Making AC-3 an Optimal Algorithm.

Conference: Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI 2001, Seattle, Washington, USA, August 4-10, 2001

Source: DBLP

- [Show abstract] [Hide abstract]

**ABSTRACT:**a b s t r a c t This paper concerns project scheduling under resource constraints. Traditionally, the objective is to find a unique solution that minimizes the project makespan, while respecting the precedence constraints and the resource constraints. This work focuses on developing a model and a decision support framework for industrial application of the cumulative global constraint. For a given project scheduling, the proposed approach allows the generation of different optimal solutions relative to the alternate availability of out-sourcing and resources. The objective is to provide a decision-maker an assistance to construct, choose, and define the appropriate scheduling program taking into account the possible capacity resources. The industrial problem under consideration is modeled as a constraint satisfaction problem (CSP). It is imple-mented under the constraint programming language CHIP V5. The provided solutions determine values for the various variables associated to the tasks realized on each resource, as well as the curves with the profile of the total consumption of resources on time.Computers & Industrial Engineering 09/2010; 61:357-363. · 1.69 Impact Factor -
##### Conference Paper: Suppression de symÈtries pour les mÈthodes rÈtro-prospectives

[Show abstract] [Hide abstract]

**ABSTRACT:**Les techniques de suppression de symÈtries dÈveloppÈes pour la programmation par contraintes ont pour objectif d'amÈliorer l'efficacitÈ des mÈthodes de rÈsolution en rÈduisant drastiquement la taille de l'espace de recherche. ParallËlement, les mÈthodes de rÈsolution rÈcentes, telles que les mÈthodes rÈtro-prospectives, permettent de s'attaquer ‡ des problËmes de plus en plus grands, que ce soit par la taille des domaines ou le nombre de variables considÈrÈes, et dont l'espace de recherche augmente bien s˚r lui aussi. Il paraÓt donc intÈressant de faire profiter les mÈthodes rÈtro-prospectives des amÈliorations permises par les techniques de suppression de symÈtries qui ont cependant ÈtÈ dÈveloppÈes pour un cadre plus classique d'exploration. Dans cet article, nous proposons donc un algorithme hybridant une mÈthode rÈtro-prospective (textttdecision-repair) et une technique gÈnÈrique de suppression de symÈtries (SBDS). Nous prÈsentons plusieurs approches pour exprimer et traiter efficacement dans ce cadre les contraintes liÈes ‡ la suppression des symÈtries. De premiers rÈsultats expÈrimentaux valident la dÈmarche.2Ëmes JournÈes Francophones de Programmation par Contraintes (JFPC'06); 06/2006 -
##### Conference Paper: Constraint propagation versus local search for incremental temporal constraint problems

[Show abstract] [Hide abstract]

**ABSTRACT:**Summary form only given. Our aim is to maintain the global consistency of a constraint satisfaction problem involving temporal constraints any time a new constraint is added. This problem is of practical relevance since it is often required to check whether a solution to a CSP continues to be a solution when a new constraint is added and if not, whether a new solution satisfying the old and new constraints can be found. The two methods that we present are respectively a complete search technique based on constraint propagation and an approximation method based on stochastic local search. The goal of both methods is to check whether the existence of a solution is maintained any time a new constraint is added. The approximation method does not guarantee the completeness of the solution provided, but is of interest for those problems where it is impossible or impractical to find a complete solution. This is the case for real time applications where a solution should be returned within a given deadline and over constrained problems where a complete solution does not exist.Computer Systems and Applications, 2003. Book of Abstracts. ACS/IEEE International Conference on; 08/2003

Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.