Article ID: | iaor19952015 |
Country: | United Kingdom |
Volume: | 33 |
Issue: | 5 |
Start Page Number: | 1323 |
End Page Number: | 1337 |
Publication Date: | May 1995 |
Journal: | International Journal of Production Research |
Authors: | Srinivasan G., Murthy Ch. V.R. |
Keywords: | group technology |
Group Technology (GT) aims at improving productivity in batch manufacturing. Here components are divided into families and machines into cells such that every component in a part family visits maximum number of machines in the assigned cell with an objective of minimizing inter-cell movement. In situations where too many inter-cell moves exist, fractional cell formation using remainder cells can be used. Here, machines are grouped into GT cells and a remainder cell, which functions like a job shop. Component families are formed such that the components visit the assigned cell and the remainder cell and do not visit other cells. The fractional cell formation problem to minimise inter-cell moves is formulated as a linear integer programming problem. Here, movement between machine cells and remainder cells is not counted as inter-cell moves but movement of components among GT cells is considered as inter-cell movement. The fractional cell formation problem is solved using Simulated Annealing. A heuristic algorithm is developed to solve large sized GT matrices. These have applied to a variety of matrices from GT literature and tested on randomly generated matrices. Computational experiences with the algorithms are presented.