3documents trouvés
Planification multi-site : modélisation sous forme d'un problème de satisfaction de contraintes dynamiques
M.TROJET, F.H'MIDA, P.LOPEZ, P.ESQUIROL
MOGISA, ESSTT
Manifestation avec acte : International Conference on Modeling Optimization & SIMulation (MOSIM 2012), Bordeaux (France), 6-8 Juin 2012, 10p. , N° 12218
Lien : http://hal.archives-ouvertes.fr/hal-00690327
Diffusable
Plus d'informations
Résumé
Cet article propose un modèle de planification d'une chaîne logistique, basé sur une structure décisionnelle à deux niveaux. Adoptant un processus dynamique permettant d'actualiser les données à chaque étape de planification, le premier niveau planifie la production en recherchant le meilleur compromis entre les leviers décisionnels disponibles liés aux aspects capacité et coût de production. Le deuxième niveau établit un ordonnancement des opérations de fabrication et de transport en minimisant la date de fin du planning. L'interaction entre les deux niveaux est établie par des contraintes de conservation d'énergie. Nous adoptons une approche par satisfaction de contraintes dynamiques ("Dynamic Constraint Satisfaction Problem") permettant de mettre en évidence cette interaction.
Project scheduling under resource constraints: application of the cumulative global constraint in a decision support framework
M.TROJET, F.H'MIDA, P.LOPEZ
ESSTT, MOGISA
Revue Scientifique : Computers and Industrial Engineering, Vol.61, N°2, pp.357-363, Septembre 2011 , N° 10345
Lien : http://hal.archives-ouvertes.fr/hal-00491796/fr/
Diffusable
Plus d'informations
Abstract
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 outsourcing 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 implemented 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.
Project scheduling under resource constraints: application of the cumulative global constraint
M.TROJET, F.H'MIDA, P.LOPEZ
ESSTT, MOGISA
Manifestation avec acte : 39th International Conference on Computers & Industrial Engineering (CIE39), Troyes (France), 6-8 Juillet 2009, pp.62-67 , N° 09223
Lien : http://hal.archives-ouvertes.fr/hal-00380242/fr/
Diffusable
Plus d'informations
Abstract
This paper concerns project scheduling under resource constraints. The objective is to find a solution that minimizes the project makespan, while respecting the precedence constraints and the resource constraints. The problem under consideration is modelled as a Constraint Satisfaction Problem (CSP). It is implemented under the constraint programming language CHIP V5. For modelling the resource constraints, we are particularly interested in the application of the cumulative global constraint. 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.