Manufacturing cell formation using similarity coefficients and a parallel genetic TSP algorithm: Formulation and comparison

Authors:
J. Balakrishnan;P. D. Jog
Affiliations:
Finance and Operations Management Area, Faculty of Management University of Calgary, Calgary, Alberta T2N 1N4, Canada;Department of Computer Science, DePaul University Chicago, IL 60604, U.S.A.
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
1995

Citing 2
Cited 3

Large-scale 0-1 linear programming on distributed workstations

Annals of Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Applying simulated annealing for designing cellular manufacturing systems using MDmTSP

Computers and Industrial Engineering
Solving a two-agent single-machine scheduling problem considering learning effect

Computers and Operations Research
Neuro-genetic impact on cell formation methods of Cellular Manufacturing System design: A quantitative review and analysis

Computers and Industrial Engineering

Quantified Score

Hi-index	0.98

Visualization

Abstract

Many algorithms have been proposed to form manufacturing cells from component routings. However, many of these do not have the capability of solving large problems. We propose a procedure using similarity coefficients and a parallel genetic implementation of a TSP algorithm that is capable of solving large problems of up to 1000 parts and 1000 machines. In addition, we also compare our procedure with many existing procedures using nine well-known problems from the literature. The results show that the proposed procedure compares well with the existing procedures and should be useful to practitioners and researchers.