The procedure for SALBP-1 performs a branch-and-bound-and-remember search for the optimal solution, as described in Sewell and Jacobson (2012) and Morrison et al. (2014).
Download: The package contains two versions of the code (in programming language C++) as described in a readme-file which additionally contains information on compiling the code for Linux or windows and how to use it.
- BBR-for-SALBP1 (ZIP, provided by David Morrison)
Data requirement: The input file format supported is the ALB-format described here such that the following data sets can be used:
Attention: If compiled under Linux, make sure the input file uses Unix-style line endings or the input procedure will not read the files correctly.
Sewell, E.C.; Jacobson, S.H. (2012): A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem. INFORMS Journal on Computing 24, 433-442.
Morrison, D.R.; Sewell, E.C.; Jacobson, S.H. (2014): An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset. European Journal of Operational Research 236/2, 403–409.