Skip to Main content Skip to Navigation
Conference papers

Robust U-Type Assembly Line Balancing Problem: A Decomposition Based Approximate Solution Algorithm

Abstract : We investigate balancing U-type assembly lines under uncertainty. We formulate the robust problem and develop an optimization model to design lines that hedge against disruptions. Offering more alternatives to group the operations, U-type assembly layouts are shown to be more efficient than conventional straight lines. As a result, they have been widely investigated in literature. However, a great majority of the studies assume deterministic environments and ignore various sources of uncertainty, like variability in operation times. We address this research gap. To hedge against variations in operation times, we employ robust optimization that considers worst case situations. However, this approach could result in pessimist solutions. In order to avoid that, we will assume that only a subset of operation times will be assigned to their worst case values. To solve the model, we will make use of Benders Decomposition, however it may converge slowly for large instances. To be able to solve real life problems, we will propose approximate solution algorithm. The efficiency of the algorithm will be evaluated with some computational tests.
Document type :
Conference papers
Complete list of metadata
Contributor : Florent Breuil Connect in order to contact the contributor
Submitted on : Thursday, March 15, 2012 - 5:04:28 PM
Last modification on : Wednesday, August 4, 2021 - 3:42:04 PM


  • HAL Id : emse-00679488, version 1


Alexandre Dolgui, Öncü Hazir. Robust U-Type Assembly Line Balancing Problem: A Decomposition Based Approximate Solution Algorithm. 17th International Working Seminar on Production Economics, Feb 2012, Innsbruck, Austria. Paper220, p. 225-230. ⟨emse-00679488⟩



Record views