Show simple item record

dc.contributor.authorBlum, Christian
dc.identifier.citationBlum, Christian. Iterative beam search for simple assembly line balancing with a fixed number of work stations. "SORT", vol. 35, núm. 2, p. 145-164.
dc.description.abstractThe simple assembly line balancing problem (SALBP) concern s the assignment of tasks with pre-defined processing times to work stations that are arran ged in a line. Hereby, precedence constraints between the tasks must be respected. The optimi zation goal of the SALBP-2 variant of the problem concerns the minimization of the so-called cy cle time, that is, the time in which the tasks of each work station must be completed. In this work we p ropose to tackle this problem with an iterative search method based on beam search. The propose d algorithm is able to generate optimal solutions, respectively the best upper bounds, for 283 out of 302 test cases. Moreover, for 9 further test cases the algorithm is able to improve the c urrently best upper bounds. These numbers indicate that the proposed iterative beam search al gorithm is currently a state-of-the-art method for the SALBP-2
dc.format.extent20 p.
dc.publisherInstitut d'Estadística de Catalunya
dc.relation.ispartofSORT. 2011, vol. 35, núm. 2
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Spain
dc.subject.classificationOptimització i investigació operativa
dc.subject.lcshProgramming (Mathematics)
dc.subject.otherassembly line balancing
dc.subject.otherfixed number of work stations
dc.subject.otherbeam search
dc.titleIterative beam search for simple assembly line balancing with a fixed number of work stations
dc.subject.lemacProgramació (Matemàtica)
dc.description.peerreviewedPeer Reviewed
dc.subject.amsClassificació AMS::90 Operations research, mathematical programming::90C Mathematical programming
dc.rights.accessOpen Access
local.citation.authorBlum, Christian

Files in this item


This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivs 3.0 Spain
Except where otherwise noted, content on this work is licensed under a Creative Commons license : Attribution-NonCommercial-NoDerivs 3.0 Spain