Machine-part Grouping Algorithm Using a Branch and Bound Method

분지한계법을 이용한 기계-부품 그룹형성 최적해법

The grouping of parts into families and machines into cells poses an important problem in the design and planning of the flexible manufacturing system(FMS). This paper proposes a new optimal algorithm of forming machine-part groups to maximize the similarity, based on branching from seed machine and bounding on a completed part. This algorithm is illustrated with numerical example. This algorithm could be applied to the generalized machine-part grouping problem.