Stochastic Dual Dynamic integer Programming for a multi-echelon lot-sizing problem with remanufacturing and lost sales

We consider an uncapacitated multi-echelon lot-sizing problem within a remanufacturing system involving three production echelons: disassembly, refurbishing and reassembly. We seek to plan the production activities on this system over a multi-period horizon. We assume a stochastic environment, in wh...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International Conference on Control, Decision and Information Technologies (Online) s. 1254 - 1259
Hlavní autoři: Quezada, Franco, Gicquel, Celine, Kedad-Sidhoum, Safia
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.04.2019
Témata:
Approximation algorithms
Dynamic programming
Heuristic algorithms
Production
Programming
Stochastic processes
Uncertainty
ISSN:2576-3555
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We consider an uncapacitated multi-echelon lot-sizing problem within a remanufacturing system involving three production echelons: disassembly, refurbishing and reassembly. We seek to plan the production activities on this system over a multi-period horizon. We assume a stochastic environment, in which the input data of the optimization problem are subject to uncertainty. We consider a multi-stage stochastic integer programming approach relying on scenario trees to represent the uncertain information structure and propose a solution method based on an extension of the stochastic dual dynamic programming algorithm. Our results show that this approach can provide good quality solutions for large-size instances in a reasonable time and significantly outperforms the use of a stand-alone mathematical solver.
ISSN:2576-3555
DOI:10.1109/CoDIT.2019.8820709