Direct clustering algorithm for group formation in cellular manufacture

A new algorithm which has been developed for forming component families and machine groups for cellular manufacture by progressively restructuring the machine component matrix is described, which offers great flexibility in determining the optimum families and groups.

Abstract

This paper describes a new algorithm which has been developed for forming component families and machine groups for cellular manufacture by progressively restructuring the machine component matrix. The method allows interaction from the user when exceptions and overlap between groups cause the iterative algorithm to prematurely stop. This is an effective and efficient approach which offers great flexibility in determining the optimum families and groups. The algorithm is specifically designed for computer use in dealing with large amounts of data obtainable in realistic situations, although the procedures are simple, and can be carried out manually for the analysis of small machine component matrices.