Abstract
Abstract This paper presents a graph-theoretic approach for solving the clustering problem in group technology. The machine-component incidence matrix is used to form the weight matrix. Using the two weight matrices, one for the machines and the other for the parts, two graphs are developed. The nodes of each graph are coloured using the proper colouring method. An edge, whose adjacent nodes are of same colour, partitions the graph into subgraphs, thus creating machine-part cells. This cell formation method yields solutions which compare favourably with respect to other available methods. This procedure is illustrated using an example problem from the literature.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
