This paper considers the machine–part clustering under the assumption of alternative process plans for each part. Kusiak's p-median model of part family formation dealing with the problem has critical disadvantages in that the model requires too many binary variables and constraints and the number of part families must be known in advance. Furthermore, the solution quality of the model in terms of the number of exceptional elements is poor for ill-structured problems. Motivated by Viswanathan's work, this paper proposes two new p-median models using new measures of similarity between machine pairs: one with the prespecified number of cells and the other without the prespecified number of cells. Computational experience shows the applicability of new p-median models of machine cell formation over Kusiak's model.