GT cell formation for minimizing the intercell parts flow
- 1 December 1992
- journal article
- research article
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 30 (12) , 2737-2753
- https://doi.org/10.1080/00207549208948188
Abstract
A methodology is proposed to design a GT cell by considering the intercell parts flow in GT cellular manufacturing systems. The problem of GT cell formation is described in a graph using the quantities to be produced in the specified time period and the process routes for producing the products. The objective of this paper is to minimize the total number of parts produced in more than one cell. The problem, formulated as a quadratic assignment problem (QAP), is solved using both Lagrangean relaxation technique and the optimality conditions of quadratic program. Furthermore, in order to obtain the giobal optimal solution rather than the local optimal solution, a branch-and-bound algorithm is employed. Finally, numerical examples are used to show the effectiveness of the solution techniques and GT cell formation procedure. Moreover, a computer simulation is presented, showing the effectiveness of cellular manufacturing systemsKeywords
This publication has 19 references indexed in Scilit:
- A Hamiltonian path approach to reordering the part-machine matrix for cellular manufacturingInternational Journal of Production Research, 1991
- Duplication Process in Machine Cells Formation in Group TechnologyIIE Transactions, 1989
- A framework for the design of cellular manufacturing systemsInternational Journal of Production Research, 1988
- The generalized group technology conceptInternational Journal of Production Research, 1987
- Research issues in cellular manufacturingInternational Journal of Production Research, 1987
- A cost-based heuristic for group technology configurationInternational Journal of Production Research, 1987
- Polyhedral dynamics as a tool for machine-part group formationInternational Journal of Production Research, 1986
- Mathematical Programming: Structures and AlgorithmsJournal of the Operational Research Society, 1981
- An exact branch‐and‐bound procedure for the quadratic‐assignment problemNaval Research Logistics Quarterly, 1979
- Production flow analysisProduction Engineer, 1971