Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6897402 | European Journal of Operational Research | 2014 | 7 Pages |
Abstract
The simple assembly line balancing problem (SALBP) is a well-studied NP-complete problem for which a new problem database of generated instances was published in 2013. This paper describes the application of a branch, bound, and remember (BB&R) algorithm using the cyclic best-first search strategy to this new database to produce provably exact solutions for 86% of the unsolved problems in this database. A new backtracking rule to save memory is employed to allow the BB&R algorithm to solve many of the largest problems in the database.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
David R. Morrison, Edward C. Sewell, Sheldon H. Jacobson,