eprintid: 1437685
rev_number: 36
eprint_status: archive
userid: 608
dir: disk0/01/43/76/85
datestamp: 2014-08-21 10:20:52
lastmod: 2021-11-30 00:26:20
status_changed: 2014-08-21 10:20:52
type: article
metadata_visibility: show
item_issues_count: 0
creators_name: Pape, T
title: Heuristics and Lower Bounds for the Simple Assembly Line Balancing Problem Type 1: Overview, Computational Tests and Improvements
ispublished: pub
divisions: UCL
divisions: B04
divisions: C06
keywords: Heuristic, lower bound, assembly line balancing, reduction technique, partitioning problem
note: 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.
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.
date: 2014-07-01
official_url: http://dx.doi.org/10.1016/j.ejor.2014.06.023
vfaculties: VMPS
oa_status: green
full_text_type: pub
language: eng
primo: open
primo_central: open_green
verified: verified_manual
elements_source: crossref
elements_id: 971232
doi: 10.1016/j.ejor.2014.06.023
language_elements: aa
lyricists_name: Pape, Tom
lyricists_id: TPAPE55
full_text_status: public
publication: European Journal of Operational Research
volume: 240
number: 1
pagerange: 32- 42
issn: 0377-2217
citation:        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 <https://doi.org/10.1016/j.ejor.2014.06.023>.       Green open access   
 
document_url: https://discovery.ucl.ac.uk/id/eprint/1437685/1/EJOR.pdf