Heuristics and lower bounds for the simple assembly line balancing problem type 1: Overview, computational tests and improvements

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.

MoreLess

Year of publication:	2015
Authors:	Pape, Tom
Published in:	European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 240.2015, 1, p. 32-42
Publisher:	Elsevier
Subject:	Heuristic \| Lower bound \| Assembly line balancing \| Reduction technique \| Partitioning problem

More details

Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://ebvufind01.dmz1.zbw.eu/10011097754