Skip to Main content Skip to Navigation
New interface
Conference papers

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

Abstract : 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.
Document type :
Conference papers
Complete list of metadata
Contributor : IMT Mines Albi IMT Mines Albi Connect in order to contact the contributor
Submitted on : Friday, October 28, 2022 - 2:47:25 PM
Last modification on : Monday, November 7, 2022 - 3:54:41 PM


Publisher files allowed on an open archive


Distributed under a Creative Commons Attribution - NonCommercial - NoDerivatives 4.0 International License



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⟩



Record views


Files downloads