Optimization Online


Combinatorial Benders Cuts for Assembly Line Balancing Problems with Setups

Sener Akpinar (sener.akpinar***at***deu.edu.tr)
Atabak Elmi (atabak.elmi***at***gantep.edu.tr)
Tolga Bektas (T.Bektas***at***soton.ac.uk)

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.

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

Category 1: Combinatorial Optimization


Download: [PDF]

Entry Submitted: 04/07/2016
Entry Accepted: 04/07/2016
Entry Last Modified: 04/07/2016

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society