TY - JOUR KW - Heuristic KW - lower bound KW - assembly line balancing KW - reduction technique KW - partitioning problem N1 - 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. IS - 1 EP - 42 TI - Heuristics and Lower Bounds for the Simple Assembly Line Balancing Problem Type 1: Overview, Computational Tests and Improvements SN - 0377-2217 AV - public A1 - Pape, T JF - European Journal of Operational Research VL - 240 SP - 32 N2 - 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. UR - http://dx.doi.org/10.1016/j.ejor.2014.06.023 ID - discovery1437685 Y1 - 2014/07/01/ ER -