Integrating the grouping and layout problems in cellular manufacturing systems

Abstract In this paper, the simultaneous solution of the machine grouping and layout problems in cellular manufacturing systems is explored. A model for the combined problem is presented. Since the model is complex to solve using traditional optimization techniques, a suboptimal procedure involving the use of a simulated annealing based algorithm is suggested. Results with a numerical example are presented. An alternative formulation based on quandratic assignment problem is also presented.

[1]  Sunderesh S. Heragu A heuristic algorithm for identifying machine cells , 1992 .

[2]  T. L. Ward,et al.  Solving Quadratic Assignment Problems by ‘Simulated Annealing’ , 1987 .

[3]  Thomas E. Vollmann,et al.  An Experimental Comparison of Techniques for the Assignment of Facilities to Locations , 1968, Oper. Res..

[4]  David Connolly An improved annealing scheme for the QAP , 1990 .

[5]  E. Bonomi,et al.  The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm , 1984 .

[6]  Nancy Lea Hyer,et al.  Procedures for the part family/machine group identification problem in cellular manufacturing , 1986 .

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

[8]  A. Alfa,et al.  Experimental analysis of simulated annealing based algorithms for the layout problem , 1992 .

[9]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning , 1991, Oper. Res..

[10]  F. Rendl,et al.  A thermodynamically motivated simulation procedure for combinatorial optimization problems , 1984 .

[11]  Asoo J. Vakharia,et al.  Designing a Cellular Manufacturing System: A Materials Flow Approach Based on Operation Sequences , 1990 .

[12]  S. Heragu,et al.  Efficient models for the facility layout problem , 1991 .

[13]  J. E. Glynn,et al.  Numerical Recipes: The Art of Scientific Computing , 1989 .

[14]  Teofilo F. Gonzalez,et al.  P-Complete Approximation Problems , 1976, J. ACM.

[15]  B. Golden,et al.  Using simulated annealing to solve routing and location problems , 1986 .

[16]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.