A novel approach for part family formation using K-means algorithm
Source abstract
Abstract
The reconfigurable manufacturing system (RMS) is the next step in manufacturing, allowing the production of any quantity of highly customized and complex parts together with the benefits of mass production. In RMSs, parts are grouped into families, each of which requires a specific system configuration. Initially system is configured to produce the first family of parts. Once it is finished, the system will be reconfigured in order to produce the second family, and so forth. The effectiveness of a RMS depends on the formation of the optimum set of part families addressing various reconfigurability issues. The aim of this work is to establish a methodology for grouping parts into families for effective working of RMS. The methodology carried out in two phases. In the first phase, the correlation matrix is used as similarity coefficient matrix. In the second phase, agglomerative hierarchical K-means algorithm is used for the parts family formation resulting in an optimum set of part families for reconfigurable manufacturing system.
Source: openaire · Quality: candidate unverified · Source record ↗
Research context
OpenAlex topics: Advanced Manufacturing and Logistics Optimization · Manufacturing Process and Optimization · Flexible and Reconfigurable Manufacturing Systems
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
References (15)
Show source-provided references
1. Koren Y, Jovane F, Heisel U et al (1999) Reconfigurable manufacturing systems. Ann CIRP 48(2):527–54010.1016/S0007-8506(07)63232-6 ↗
2. Lokesh K, Jain PK (2011) A model and optimization approach for reconfigurable manufacturing system configuration design. Int J Prod Res 50(12):3359–3381
3. Abdi MR, Labib AW (2004) Grouping and selecting products: the design key of reconfigurable manufacturing systems (RMSs). Int J Prod Res 42(3):521–54610.1080/00207540310001613665 ↗
4. Galan R, Racero J, Eguia I et al (2007) A systematic approach for product families formation in reconfigurable manufacturing systems. Robot Comp Integr Manuf 23(5):489–50210.1016/j.rcim.2006.06.001 ↗
5. Mahesh O, Srinivasan G (2002) Incremental cell formation considering alternative machines. Int J Prod Res 40(14):3291–331010.1080/00207540210146189 ↗
6. McAuley J (1972) Machine grouping for efficient production. Prod Eng 51(2):53–5710.1049/tpe.1972.0006 ↗
7. Mosier CT, Taube L (1985) Weighted similarity measure heuristics for the group technology machine clustering problem. Int J Manag Sci 13:577–583
8. Wei JC, Kern GM (1989) Commonality analysis: a linear clustering algorithm for group technology. Int J Prod Res 12:2053–2062
9. Sarker BR, Islam KM (1999) Relative performances of similarity and dissimilarity measures. Comp Ind Eng 37:769–80710.1016/S0360-8352(00)00011-5 ↗
10. Vakharia AJ, Wemmerlöv U (1995) A comparative investigation of hierarchical clustering techniques and dissimilarity measures applied to the cell formation problem. J Oper Manag 13:117–13810.1016/0272-6963(95)00017-M ↗
11. Zalik KR (2008) An efficient K-means clustering algorithm. Pattern Recognit Lett 29:1385–139110.1016/j.patrec.2008.02.014 ↗
12. Jain AK (2010) Data clustering: 50 years beyond K-means. Pattern Recognit Lett 31:651–66610.1016/j.patrec.2009.09.011 ↗
13. Tsai CF, Hsu YF, Lin CY et al (2009) Intrusion detection by machine learning: a review. Expert Syst Appl 36:11994–1200010.1016/j.eswa.2009.05.029 ↗
14. Al-Sultan KS (1997) A hard clustering approach to the part family formation problem. Prod Plann Control 8(3):231–23610.1080/095372897235280 ↗
15. Shehroz SK, Ahmad A (2004) Cluster centre initialization algorithm for K-means clustering. Pattern Recogni Letter 25:1293–130210.1016/j.patrec.2004.04.007 ↗