UCL Discovery Stage
UCL home » Library Services » Electronic resources » UCL Discovery Stage

Heuristics and Lower Bounds for the Simple Assembly Line Balancing Problem Type 1: Overview, Computational Tests and Improvements

Pape, T; (2014) Heuristics and Lower Bounds for the Simple Assembly Line Balancing Problem Type 1: Overview, Computational Tests and Improvements. European Journal of Operational Research , 240 (1) 32- 42. 10.1016/j.ejor.2014.06.023. Green open access

[thumbnail of EJOR.pdf]
Preview
PDF
EJOR.pdf
Available under License : See the attached licence file.

Download (761kB)

Abstract

Assigning tasks to work stations is an essential problem which needs to be addressed in an assembly line design. The most basic model is called simple assembly line balancing problem type 1 (SALBP-1). We provide a survey on 12 heuristics and 9 lower bounds for this model and test them on a traditional and a lately-published benchmark dataset. The present paper focuses on algorithms published before 2011. We improve an already existing dynamic programming and a tabu search approach significantly. These two are also identified as the most effective heuristics; each with advantages for certain problem characteristics. Additionally we show that lower bounds for SALBP-1 can be distinctly sharpened when merging them and applying problem reduction techniques.

Type: Article
Title: Heuristics and Lower Bounds for the Simple Assembly Line Balancing Problem Type 1: Overview, Computational Tests and Improvements
Open access status: An open access version is available from UCL Discovery
DOI: 10.1016/j.ejor.2014.06.023
Publisher version: http://dx.doi.org/10.1016/j.ejor.2014.06.023
Language: English
Additional information: Copyright © 2014 The Author. Published by Elsevier B.V. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/3.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Keywords: Heuristic, lower bound, assembly line balancing, reduction technique, partitioning problem
UCL classification: UCL
UCL > Provost and Vice Provost Offices > UCL BEAMS
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Maths and Physical Sciences
URI: https://discovery-pp.ucl.ac.uk/id/eprint/1437685
Downloads since deposit
42,624Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item