Designing cellular manufacturing systems by a truncated tree search
Authors:
- 1 February 1996
- journal article
- research article
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 34 (2) , 349-361
Abstract
The cell formation problem in designing cellular manufacturing systems is formulated as a 0-1 quadratic programming model. The objective of the model is to minimize intercellular moves using distance as a measure. A truncated tree search algorithm to solve the cell formation problem is presented. The performance of the algorithm is tested on several problems obtained from the literature. Comparison of the results of the algorithm with some existing approaches is presented. In addition, this paper extends the truncated tree search approach to deal with multiple machines in the cell formation problem.Keywords
This publication has 13 references indexed in Scilit:
- DESIGNING CELLULAR MANUFACTURING SYSTEMS: BRANCH-AND-BOUND AND A∗ APPROACHESIIE Transactions, 1993
- Algorithms for grouping machine groups in group technologyOmega, 1992
- A close neighbour algorithm for designing cellular manufacturing systemsInternational Journal of Production Research, 1991
- GROUPABIL1TY: an analysis of the properties of binary data matrices for group technologyInternational Journal of Production Research, 1989
- Efficient solving of the group technology problemJournal of Manufacturing Systems, 1987
- Application of the Similarity Coefficient Method in Group TechnologyIIE Transactions, 1986
- Machine-component group formation in group technology: review and extensionInternational Journal of Production Research, 1982
- Machine-component grouping in production flow analysis: an approach using a rank order clustering algorithmInternational Journal of Production Research, 1980
- Numerical taxonomy applied to group technology and plant layoutInternational Journal of Production Research, 1973
- Problem Decomposition and Data Reorganization by a Clustering TechniqueOperations Research, 1972