A Stochastic Formulation of the Disassembly Line Balancing Problem

The disassembly line balancing problem is studied under uncertainty. Disassembly task times are assumed random variables with known probability distributions. An AND/OR graph is used to model the precedence relations among tasks. The goal is to assign the disassembly tasks to workstations while respecting precedence and cycle time constraints. The objective is to minimize the total line cost including the incompletion cost arising from task incompletion within the cycle time. A stochastic linear mixed integer programming formulation is developed.

Domains

Computer Science [cs] Modeling and Simulation

Fichier principal

978-3-642-40352-1_50_Chapter.pdf (230.44 Ko)

Origin : Files produced by the author(s)

Florent Breuil : Connect in order to contact the contributor

https://hal-emse.ccsd.cnrs.fr/emse-00766872

Submitted on : Tuesday, February 21, 2017-10:00:30 AM

Last modification on : Tuesday, April 18, 2023-10:00:05 AM

Long-term archiving on: Monday, May 22, 2017-2:03:42 PM

Dates and versions

emse-00766872 , version 1 (21-02-2017)

Licence

Attribution

Identifiers

HAL Id : emse-00766872 , version 1
DOI : 10.1007/978-3-642-40352-1_50

Cite

Mohand Lounes Bentaha, Olga Battaïa, Alexandre Dolgui. A Stochastic Formulation of the Disassembly Line Balancing Problem. 19th Advances in Production Management Systems (APMS), Sep 2012, Rhodes, Greece. pp.397-404, ⟨10.1007/978-3-642-40352-1_50⟩. ⟨emse-00766872⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

EMSE INSTITUT-TELECOM PRES_CLERMONT CNRS LIMOS IFIP IFIP-AICT IFIP-TC IFIP-TC5 IFIP-WG TDS-MACS IFIP-APMS IFIP-WG5-7 IFIP-AICT-397 CLERMONT-AUVERGNE-INP

344 View

313 Download