HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Parallelized approaches to solve the capacitated lot-sizing problem with lost sales and setup times

Abstract : Multi-item lot-sizing problems faced in industrial contexts are often too large to be directly solved by standard optimization solvers. To this purpose, parallelization approaches are very useful to transform the single resolution of a complex problem into the resolution of smaller independent sub-problems, leading to much smaller computational times. We first motivate and propose new practically relevant instances for the Capacitated Lot-Sizing Problem (CLSP) with lost sales, setup times and target ending inventory. Two ways of paralleli-zing the problem are then introduced. A first approach is based on a Lagrangian relaxation of the item binding capacity constraints. We show that the problem linked to each item can be solved in polynomial time. A second approach uses a parallelized version of Relax-And-Fix and Fix-and-Optimize heuristics where, instead of optimizing the time intervals in chronological order at each iteration, different time intervals are optimized in parallel. The best interval is picked according to various strategies and is fixed for the following iterations.
Document type :
Conference papers
Complete list of metadata

Cited literature [6 references]  Display  Hide  Download

Contributor : Safia Kedad-Sidhoum Connect in order to contact the contributor
Submitted on : Monday, April 6, 2020 - 1:21:09 PM
Last modification on : Monday, February 21, 2022 - 3:38:20 PM


Publisher files allowed on an open archive


  • HAL Id : hal-02476625, version 1


Mehdi Charles, Stéphane Dauzère-Pérès, Safia Kedad-Sidhoum, Issam Mazhoud. Parallelized approaches to solve the capacitated lot-sizing problem with lost sales and setup times. 10th International Workshop on Lot sizing - IWLS 2019, Conservatoire national des arts et métiers, 2019, Paris, France. ⟨hal-02476625⟩



Record views


Files downloads