A spectral clustering algorithm for manufacturing cell formation |
| |
Authors: | S. Oliveira J.F.F. Ribeiro S.C. Seok |
| |
Affiliation: | aComputer Science Dept., University of Iowa, Iowa City, IA, USA;bICMC, Universidade de Sao Paulo, Sao Carlos, Brazil |
| |
Abstract: | 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. |
| |
Keywords: | Manufacturing cell formation Spectral clustering Bipartite graph modeling |
本文献已被 ScienceDirect 等数据库收录! |
|