Article ID: | iaor20011240 |
Country: | United Kingdom |
Volume: | 38 |
Issue: | 11 |
Start Page Number: | 2459 |
End Page Number: | 2470 |
Publication Date: | Jan 2000 |
Journal: | International Journal of Production Research |
Authors: | Mukhopadhyay S.K., Babu K. Ramesh, Sai K.V. Vijai |
Keywords: | graphs |
Graph theory can be effectively applied to the group technology configuration problem. Earlier attempts were made to use graph theoretic algorithms, e.g. minimal spanning tree, tree search, and branch & bound to solve the group technology problem. The proposed algorithm is based on modified Hamiltonian chain (MHC) and consists of two stages. Stage I forms the graph from the machine part incidence matrix. Stage II generates a modified Hamiltonian chain which is a subgraph of the main graph developed in Stage I, and it gives machine sequence and part sequence directly. Dummy edges are considered in MHC for better accessibility in order to arrive at a block diagonal solution to the problem. This paper presents a simple approach by designing a MHC in the graph theoretic method to solve the group technology configuration problem. Results obtained from testing the method are compared with the other well-known methods and found to be satisfactory.