Journal article
A spectral clustering algorithm for manufacturing cell formation
Computers & industrial engineering, Vol.57(3), pp.1008-1014
2009
DOI: 10.1016/j.cie.2009.04.008
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.
Details
- Title: Subtitle
- A spectral clustering algorithm for manufacturing cell formation
- Creators
- S Oliveira - Computer Science Dept., University of Iowa, Iowa City, IA, USAJ.F.F Ribeiro - ICMC, Universidade de Sao Paulo, Sao Carlos, BrazilS.C Seok - Computer Science Dept., University of Iowa, Iowa City, IA, USA
- Resource Type
- Journal article
- Publication Details
- Computers & industrial engineering, Vol.57(3), pp.1008-1014
- Publisher
- Elsevier Ltd
- DOI
- 10.1016/j.cie.2009.04.008
- ISSN
- 0360-8352
- eISSN
- 1879-0550
- Language
- English
- Date published
- 2009
- Academic Unit
- Computer Science; Mathematics
- Record Identifier
- 9984002483502771
Metrics
20 Record Views