GRAFICS—a nonhierarchical clustering algorithm for group technology

An efficient nonhierarchical clustering algorithm, based on initial seeds obtained from the assignment method, for finding part-families and machine cells for group technology (GT) is presented. By a process of alternate clustering and generating seeds from rows and columns, the zero-one machine-component incidence matrix was block-diagonalized with the aim of minimizing exceptional elements (intercell movements) and blanks (machine idling). The algorithm is compared with the existing nonhierarchical clustering method and is found to yield favourable results. © 1991 Taylor & Francis Group, LLC.