Partitioning sparse matrices with eigenvectors of graphs
SIAM Journal on Matrix Analysis and Applications
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
SIAM Journal on Scientific Computing
A Min-max Cut Algorithm for Graph Partitioning and Data Clustering
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
Manufacturing cell formation using a new self-organizing neural network
Computers and Industrial Engineering - 26th International conference on computers and industrial engineering
An evolutionary algorithm for manufacturing cell formation
Computers and Industrial Engineering
Design of cellular manufacturing systems with assembly considerations
Computers and Industrial Engineering - Special issue: Group technology/cellular manufacturing
Forming part families by using genetic algorithm and designing machine cells under demand changes
Computers and Operations Research
The sustainable cell formation problem: manufacturing cell creation with machine modification costs
Computers and Operations Research
A new branch-&-bound-enhanced genetic algorithm for the manufacturing cell formation problem
Computers and Operations Research
A matrix-based multilevel approach to identify functional protein modules
International Journal of Bioinformatics Research and Applications
Mining association rules for the quality improvement of the production process
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
A graph clustering algorithm constructs groups of closely related parts and machines separately. After they are matched for the least intercell moves, a refining process runs on the initial cell formation to decrease the number of intercell moves. A simple modification of this main approach can deal with some practical constraints, such as the popular constraint of bounding the maximum number of machines in a cell. Our approach makes a big improvement in the computational time. More importantly, improvement is seen in the number of intercell moves when the computational results were compared with best known solutions from the literature.