Skip to Main content Skip to Navigation
Conference papers

L-Shaped Algorithm for Stochastic Disassembly Line Balancing Problem

Mohand Lounes Bentaha 1, 2 Olga Battaïa 1, 2 Alexandre Dolgui 3 
3 Laboratoire en Sciences et Technologies de l'Information
LIMOS - Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes, DEMO-ENSMSE - Département Décision en Entreprise : Modélisation, Optimisation
Abstract : Disassembly Line Balancing Problem considered here both chooses the best disassembly alternative for an end of life product and assigns the corresponding disassembly tasks to the workstations of the line with the aim to reduce the line cost. Precedence and cycle time constraints are observed. Task times are assumed stochastic with known normal probability distributions. The line cost includes the investment and operation costs for workstations as well as penalty costs generated by the cycle time constraints violations. To deal with uncertainties, a stochastic linear mixed integer formulation is developed. To solve efficiently the problem, L-shaped algorithm combined with Latin Hypercube Sampling is proposed.
Document type :
Conference papers
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download
Contributor : Florent Breuil Connect in order to contact the contributor
Submitted on : Friday, March 22, 2019 - 11:52:16 AM
Last modification on : Sunday, June 26, 2022 - 9:36:31 AM
Long-term archiving on: : Sunday, June 23, 2019 - 2:34:02 PM


Files produced by the author(s)



Mohand Lounes Bentaha, Olga Battaïa, Alexandre Dolgui. L-Shaped Algorithm for Stochastic Disassembly Line Balancing Problem. 7th IFAC Conference on Manufacturing Modelling, Management, and Control, 2013, Jun 2013, St Petersburg, Russia. pp. 407-411, ⟨10.3182/20130619-3-RU-3018.00500⟩. ⟨emse-00881583⟩



Record views


Files downloads