@article{8c76ded864864dcba46ba06175316fe8,
title = "An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset",
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.",
keywords = "Assembly line balancing, Branch and bound, Combinatorial optimization",
author = "Morrison, {David R.} and Sewell, {Edward C.} and Jacobson, {Sheldon H.}",
note = "The computational results reported were obtained using the Simulation and Optimization Laboratory. This research has been supported in part by the Air Force Office of Scientific Research (FA9550-10-1-0387), the Department of Defense (DoD) through the National Defense Science & Engineering Graduate Fellowship (NDSEG) Program, and the National Science Foundation through the Graduate Research Fellowship Program. The third author is supported in part by (while serving at) the National Science Foundation. Any opinion, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the United States Government. The authors would like to thank three anonymous referees and the associate editor for comments which significantly improved this paper.",
year = "2014",
month = jul,
day = "16",
doi = "10.1016/j.ejor.2013.11.033",
language = "English (US)",
volume = "236",
pages = "403--409",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier B.V.",
number = "2",
}