A decomposition based solution algorithm for U-type assembly line balancing with interval data

Abstract : Balancing U-type assembly lines under uncertainty is addressed in this paper by formulating a robust problem and developing its optimization model and algorithm. U-type assembly layouts are shown to be more efficient than conventional straight lines. A great majority of studies on U-lines assume deterministic environments and ignore uncertainty in operation times. We aim to fill this research gap and, to the best of our knowledge, this study will be the first application of robust optimization to U-type assembly planning. We assume that the operation times are not fixed but they can vary. We employ robust optimization that considers worst case situations. To avoid over-pessimism, we consider that only a subset of operation times take their worst case values. To solve this problem, we suggest an iterative approximate solution algorithm. The efficiency of the algorithm is evaluated with some computational tests.
Document type :
Journal articles
Complete list of metadatas

https://hal-emse.ccsd.cnrs.fr/emse-01119350
Contributor : Florent Breuil <>
Submitted on : Monday, February 23, 2015 - 9:22:09 AM
Last modification on : Thursday, October 17, 2019 - 12:36:12 PM

Identifiers

Citation

Öncü Hazir, Alexandre Dolgui. A decomposition based solution algorithm for U-type assembly line balancing with interval data. Computers and Operations Research, Elsevier, 2015, In Press, Accepted Manuscript. ⟨10.1016/j.cor.2015.01.010⟩. ⟨emse-01119350⟩

Share

Metrics

Record views

299