Designing manufacturing cells: A staged approach and a tabu search algorithm

This paper proposes a three-stage approach for the manufacturing cells design problem and a tabu search scheme for its solution. The proposed approach is based on the observation that almost all computationally complex aspects can be incorporated in a middle stage optimization model. A preliminary parts grouping stage precedes and a stage elimating remaining intercellular traffic follows. The tabu search scheme that solves the middle stage problem integrates proper short- and long-term memory structures and an overall search strategy for their use. At the code-development phase, special care has been taken to enhance the explorative capability of the algorithm by correlating search statistics with the values of the search parameters. The resulting algorithm is robust and produces more than promising results with negligible computational effort. In the absence of known optimal solutions for larger dimensions (more than 30 machines), datasets from mathematically similar areas were used. Tests with problems of size up to 50 also give encouraging results.