Abstract
The design and production planning of cellular manufacturing systems requires the decomposition of a company’s manufacturing assets into cells. The set of machines has to be partitioned into machine-groups and the products have to be partitioned into part-families. Finding the machine-groups and their corresponding part-families leads to the combinatorial problem of simultaneously partitioning those two sets with respect to technological requirements represented by the part-machine incidence matrix. This article presents a new solution approach based on a grouping genetic algorithm enhanced by a heuristic motivated by cluster analysis methods.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S.S. Heragu. Group technology and cellular manufacturing. IEEE Transactions on Systems, Man, and Cybernetics, 24(2):203–215, February 1994.
W.H. Chen and B. Srivastava. Simulated annealing procedures for forming machine cells in group technology. European Journal of Operational Reasearch, 74:100–111, 1994.
Y. Gupta, M. Gupta, A. Kumar, and C. Sundaram. A genetic algorithm-based approach to cell composition and layout design problems. International Journal of Production Research, 34(2):447–482, 1996.
J.A. Joines, C.T. Culbreth, and R.E. King. Manufacturing cell design: an integer programming model employing genetic algorithms. IIE Transactions, 28(1), 1996.
V. Venugopal and T.T. Narendran. A genetic algorithm approach to the machine-component grouping problem with multiple objectives. Computers and Industrial Engineering, 22(4):469–480, 1992.
C. Zaho and Z. Wu. A genetic algorithm for manufacturing cell formation with multiple routes and multiple objectives. International Journal of Production Research, 38(2):385–395, 2000.
S.A. Mansouri, S.M. Moattar Husseini, and S.T. Newman. A review of modern approaches to multi-criteria cell design. International Journal of Production Research, 38(5):1201–1218, 2000.
I. Meents. Genetic algorithms for the group technology problem. Master’s thesis, Technical University of Clausthal, 1997. (in German).
E. Falkenauer. Genetic Algorithms and Grouping Problems. John Wiley & Sons Ltd., Baffins Lane, Chichester, West Sussex PO19 1UD, England, 1998.
Z. Michalewicz. Genetic Algorithms + Data Structures = evolution programs. Springer, Berlin, Heidelberg, New York, 3.edition, 1996.
M.P. Chandrasekharan and R. Rajagopalan. An ideal seed non-hierarchical clustering algorithm for cellular manufacturing. International Journal of Production Research, 24(2):451–464, 1986.
E. Falkenauer. A new representation and operator for genetic algorithms applied to grouping problems. Evolutionary Computation, 2(2):123–144, 1994.
S.M. Taboun, S. Sankaran, and S. Bhole. Comparison and evaluation of similarity measures in group technology. Computers and Ind. Eng., 20(3):343–353, 1991.
M.P. Chandrasekharan and R. Rajagopalan. ZODIAC-An algorithm for concurrent formation of part-families and machine-cells. International Journal of Production Research, 25(6):835–85, 1987.
A. Ballakur and H.J. Steudel. A within-cell utilization based heuristic for designing cellular manufacturing systems. International Journal of Production Research, 25(5):639–665, 1987.
M.P. Chandrasekharan and R. Rajagopalan. MODROC: An extension of rank order clustering for group technology. International Journal of Production Research, 24(5):1221–1233, 1986.
W.S. Chow and O. Hawaleshka. An efficient algorithm for solving the machine chaining problem in cellular manufacturing. Computers and Industrial Engineering, 22(1):95–100, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Meents, I. (2001). A Genetic Algorithm for the Group-Technology Problem. In: Boers, E.J.W. (eds) Applications of Evolutionary Computing. EvoWorkshops 2001. Lecture Notes in Computer Science, vol 2037. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45365-2_10
Download citation
DOI: https://doi.org/10.1007/3-540-45365-2_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41920-4
Online ISBN: 978-3-540-45365-9
eBook Packages: Springer Book Archive