A cutting plane approach for the single-product assembly system design problem

This paper evaluates a new branch-and-cut approach, establishing a computational benchmark for the single-product, assembly system design (SPASD) problem. Our approach, which includes a heuristic, preprocessing, and two cut-generating methods, outperformed optimization subroutine library in solving a set of 102 instances of the SPASD problem. The approach is robust; test problems show that it can be applied to variations of the generic SPASD problem that we encountered in industry.