Abstract
A math programming model is formulated for selecting assembly stations and assigning operations to these stations so as to satisfy a production volume requirement at minimum system cost. A branch-and-bound algorithm, coupled with a subgradient optimization procedure, is proposed. The model and algorithm are demonstrated by example on a system design problem for assembling automobile alternators. The model is applicable to many kinds of manufacturing systems.