Machine-Part Grouping and Cluster Analysis

The machine-part grouping problem is considered, equivalent to partitioning the set of machines and operations, corresponding to block diagonalisation with constraints. The attempts to solve the problem through clustering are outlined. The difficulties are presented, linked with (i) ambiguity of formulation; (ii) selection of criteria; and (iii) lack of effective algorithms. A unified survey of criteria is provided. The return is proposed to basic clustering scheme, providing simple and fast algorithms, which may not yield optimal solutions, but can be easily controlled and their solutions improved.