Erratum to "A new genetic algorithm for the machine/part grouping problem involving processing times and lot sizes" [Computers & Industrial Engineering 45 (4) (2003) 713-731]

This paper reports a new genetic algorithm (GA) for solving a general machine/part grouping (GMPG) problem. In the GMPG problem, processing times, lot sizes and machine capacities are all explicitly considered. To evaluate the solution quality of this type of grouping problems, a generalized grouping efficacy index is used as the performance measure and fitness function of the proposed genetic algorithm. The algorithm has been applied to solving several well-cited problems with randomly assigned processing times to all the operations. To examine the effects of the four major factors, namely parent selection, population size, mutation rate, and crossover points, a large grouping problem with 50 machines and 150 parts has been generated. A multi-factor (34) experimental analysis has been earned out based on 324 GA solutions. The multi-factor ANOVA test results clearly indicate that all the four factors have a significant effect on the grouping output. It is also shown that the interactions between most of the four factors are significant and hence their cross effects on the solution should be also considered in solving GMPG problems.

[1]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[2]  Richard Shell,et al.  Manufacturing system cell formation and evaluation using a new inter-cell flow reduction heuristic , 1992 .

[3]  J. C. Wei,et al.  A capacity constrained multiobjective cell formation method , 1990 .

[4]  Peihua Gu,et al.  A multi-constraint neural network for the pragmatic design of cellular manufacturing systems , 1995 .

[5]  Rakesh Nagi,et al.  Multiple routeings and capacity considerations in group technology applications , 1990 .

[6]  M. Chandrasekharan,et al.  An ideal seed non-hierarchical clustering algorithm for cellular manufacturing , 1986 .

[7]  M. Chandrasekharan,et al.  GROUPABIL1TY: an analysis of the properties of binary data matrices for group technology , 1989 .

[8]  J. King.  Machine-component grouping in production flow analysis: an approach using a rank order clustering algorithm , 1980 .

[9]  Ming Liang,et al.  Machine cell/part family formation considering processing times and machine capacities: a simulated annealing approach , 1998 .

[10]  F. Boctor.  The minimum-cost, machine-part cell formation problem , 1996 .

[11]  M. Chandrasekharan,et al.  Grouping efficacy: a quantitative criterion for goodness of block diagonal forms of binary matrices in group technology , 1990 .

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

[13]  R. Logendran,et al.  Manufacturing cell formation in the presence of lot splitting and multiple units of the same machine , 1995 .

[14]  T. Narendran,et al.  A genetic algorithm approach to the machine-component grouping problem with multiple objectives , 1992 .

[15]  Dileep R. Sule,et al.  Machine capacity planning in group technology , 1991 .