An optimal tree search method for the manufacturing systems cell formation problem

Abstract A solution methodology producting exact solutions to the manufacturing systems cell formation problem is presented. A distance matrix representing the closeness between pairs of machines with regard to the parts they process is taken into account. The proposed approach is an optimal tree search method which empoys two different bounds; a classical bound for the Quadratic Assignment Problem and a recently proposed one for the Quadratic Transportation Problem, as well as a new heuristic for the cell formation problem. A special tree search was designed in order to reduce the size of the tree, minimize the computational effort required in time consuming calculations and exploit symmetries of the problem. Computational results indicate that the proposed algorithm is very efficient in generating optimal solutions at low computational cost.

[1]  G. Finke.  Quadratic Assignment Problems , 1987 .

[2]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[3]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..

[4]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[5]  Chun Hung Cheng,et al.  Solving the Generalized Machine Assignment Problem in Group Technology , 1996 .

[6]  Hong-chul Lee,et al.  A network flow approach to solve clustering problems in group technology , 1993 .

[7]  Rakesh Nagi,et al.  An efficient heuristic in manufacturing cell formation for group technology applications , 1990 .

[8]  Hui-Chuan Chen,et al.  A network approach to cell formation in cellular manufacturing , 1990 .

[9]  Levent Kandiller,et al.  A comparative study of cell formation in cellular manufacturing systems , 1994 .

[10]  Panos M. Pardalos,et al.  Quadratic Assignment and Related Problems , 1994 .

[11]  S. Sofianopoulou.  Application of simulated annealing to a linear model forthe formulation of machine cells ingroup technology , 1997 .

[12]  Jochem Zowe,et al.  A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results , 1992, SIAM J. Optim..

[13]  Federico Malucelli,et al.  A New Lower Bound for the Quadratic Assignment Problem , 1992, Oper. Res..

[14]  Jerry C. Wei,et al.  An Optimal Model for Cell Formation Decisions , 1990 .

[15]  C. H. Cheng,et al.  Algorithms for grouping machine groups in group technology , 1992 .

[16]  Michael M. Sørensen,et al.  The optimal graph partitioning problem , 1993 .

[17]  George L. Nemhauser,et al.  Min-cut clustering , 1993, Math. Program..

[18]  A. Kusiak.  The generalized group technology concept , 1987 .

[19]  S.,et al.  An Efficient Heuristic Procedure for Partitioning Graphs , 2022 .

[20]  Panos M. Pardalos,et al.  The Quadratic Assignment Problem: A Survey and Recent Developments , 1993, Quadratic Assignment and Related Problems.

[21]  Nancy Lea Hyer,et al.  Cellular manufacturing in the U.S. industry: a survey of users , 1989 .

[22]  P. Gilmore.  Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem , 1962 .

[23]  Daniel I. A. Cohen,et al.  Basic techniques of combinatorial theory , 1978 .

[24]  Charles M. Fiduccia,et al.  A linear-time heuristic for improving network partitions , 1988, 25 years of DAC.

[25]  A. Assad,et al.  On lower bounds for a class of quadratic 0, 1 programs , 1985 .

[26]  Franz Rendl,et al.  A projection technique for partitioning the nodes of a graph , 1995, Ann. Oper. Res..

[27]  G. Salvendy,et al.  A modified network approach for the design of cellular manufacturing systems , 1993 .

[28]  Franz Rendl,et al.  A computational study of graph partitioning , 1994, Math. Program..

[29]  Andrew Kusiak,et al.  Grouping of parts and components in flexible manufacturing systems , 1986 .