论文信息 - A Lagrangian relaxation approach to machine allocation in cellular manufacturing systems

A Lagrangian relaxation approach to machine allocation in cellular manufacturing systems

Abstract The allocation of machines to part families in cellular manufacturing systems is formulated as a 0–1 integer programming model, and a solution procedure based on Lagrangean relaxation is presented. The application of the formulation is illustrated using large, randomly generated problems.

R. S. Lashkari | K. Raja Gunasingh

[1] F. Fred Choobineh,et al. A framework for the design of cellular manufacturing systems , 1988 .

[2] Andrew Kusiak,et al. The part families problem in flexible manufacturing systems , 1985 .

[3] R. S. Lashkari,et al. A heuristic procedure for determining manufacturing families from design-based grouping for flexible manufacturing systems , 1986 .

[4] Harold J. Steudel,et al. A within-cell utilization based heuristic for designing cellular manufacturing systems , 1987 .

[5] Harold J. Steudel,et al. A dynamic programming based heuristic for machine grouping in manufacturing cell formation , 1987 .

[6] R. Rajagopalan,et al. Design of cellular production systems A graph-theoretic approach , 1975 .

[7] J. King,et al. Machine-component group formation in group technology: review and extension , 1982 .

[8] R. S. Lashkari,et al. Mathematical Modeling of the Machine Grouping Problem in Cellular Manufacturing Systems , 1989 .