Combinatorial benders cuts for assembly line balancing problems with setups

Akpinar, S., Elmi, A. and Bektas, T. (2016) Combinatorial benders cuts for assembly line balancing problems with setups. European Journal of Operational Research. (doi:10.1016/j.ejor.2016.11.001).

Record type: Article

Abstract

The classical assembly line balancing problem consists of assigning assembly work to workstations. In the presence of setup times that depend on the sequence of tasks assigned to each workstation, the problem becomes more complicated given that two interdependent problems, namely assignment and sequencing, must be solved simultaneously. The hierarchical nature of these two problems also suggest a natural decomposition of the problem. This paper adopts such an approach and describes an exact algorithm based on Benders decomposition to solve both simple and mixed-model assembly line balancing problems with setups. The algorithm is tested on a set of benchmark instances and numerically compared against a mixed-integer linear programming formulation of the problem solved using an off-the-shelf optimizer.

Text

Akpinar&Elmi&Bektas.pdf - Author's Original

Download (380kB)

Text

AkpinarElmiBektasR2.pdf - Accepted Manuscript

Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (380kB)

More information

Submitted date: 7 April 2016

Accepted/In Press date: 1 November 2016

e-pub ahead of print date: 5 November 2016

Keywords: combinatorial optimization, type-I assembly line balancing problem, sequence-dependent setup times, benders decomposition, combinatorial benders cuts

Organisations: Centre of Excellence in Decision, Analytics & Risk Research