Compiling capacitated single-item lot-sizing problem in a CostMDD - IMT Mines Albi-Carmaux Accéder directement au contenu
Communication Dans Un Congrès Année : 2022

Compiling capacitated single-item lot-sizing problem in a CostMDD

Résumé

This paper deals with capacitated single-item lot sizing problem (CLSP) in an interactive support system context. The interaction is done thanks to queries to the system: The decision-maker makes partial choices and asks about the consequences in terms of costs but also about possible inventory levels. Hence, three fundamental queries are investigated: Find production plans with a cost less than K; Find possible plans with conditioning on a pair of variables (production and inventory); Find the production plans that simultaneously satisfy the previous queries. A knowledge compilation approach is used and composed of two phases: offline and online. Offline, a top-down algorithm computes cost multivalued decision diagrams. While online, we show how cost multivalued decision diagrams can improve the reactivity of answers to queries. The proposed approach is compared to classical constraint programming with CP Optimizer. Tests indicate that our algorithm is more efficient than CP resolving in terms of computation time.
Fichier principal
Vignette du fichier
1-s2.0-S2405896322020146-main.pdf (502.88 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte

Dates et versions

hal-03833551 , version 1 (28-10-2022)

Licence

Paternité - Pas d'utilisation commerciale - Pas de modification

Identifiants

Citer

Walid Khellaf, Romain Guillaume, Jacques Lamothe. Compiling capacitated single-item lot-sizing problem in a CostMDD. MIM 2022 - 10th IFAC Conference on Manufacturing Modelling, Management and Control, IFAC, Jun 2022, Nantes, France. pp.2024 - 2029, ⟨10.1016/j.ifacol.2022.10.005⟩. ⟨hal-03833551⟩
61 Consultations
68 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More