The University of Southampton
University of Southampton Institutional Repository

Combinatorial benders cuts for assembly line balancing problems with setups

Combinatorial benders cuts for assembly line balancing problems with setups
Combinatorial benders cuts for assembly line balancing problems with setups
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.
combinatorial optimization, type-I assembly line balancing problem, sequence-dependent setup times, benders decomposition, combinatorial benders cuts
0377-2217
Akpinar, S.
e337d204-3935-489a-9179-028fdd527524
Elmi, A.
5502cd39-6126-4cdc-80f2-967f0091a447
Bektas, T.
0db10084-e51c-41e5-a3c6-417e0d08dac9
Akpinar, S.
e337d204-3935-489a-9179-028fdd527524
Elmi, A.
5502cd39-6126-4cdc-80f2-967f0091a447
Bektas, T.
0db10084-e51c-41e5-a3c6-417e0d08dac9

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
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

Identifiers

Local EPrints ID: 391260
URI: http://eprints.soton.ac.uk/id/eprint/391260
ISSN: 0377-2217
PURE UUID: eff99a75-4c3f-410d-845c-72d876c71db0
ORCID for T. Bektas: ORCID iD orcid.org/0000-0003-0634-144X

Catalogue record

Date deposited: 08 Apr 2016 15:53
Last modified: 17 Dec 2019 06:52

Export record

Altmetrics

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×