Covering technique-based algorithm for machine grouping to form manufacturing cells

This paper discusses an algorithm which helps the formation of machine groups (manufacturing cells). For a given set of components and their process routeing, the algorithm first considers several possible cells. It then develops a similarity matrix to reflect the components’ routeing similarity with that of the arrangement of the facilities in the cell. In this paper, the heuristic procedure for solving the ‘covering problem’ has been modified to determine an economical number of manufacturing cells and cell arrangements (sequences of machines) so that each cell is identified to process specific component(s). The design process considered minimizing the total costs which includes handling, machines idle time and overtime. The algorithm has been applied to a practical case problem and its results are presented with a sensitivity analysis.