Earticle

초록

영어

The machine-part cell formation problem explains the topics surrounding the creation of part families based on the processing needs of the components, and the classification of machine groups based on their capacity to process exact part families in manufacturing. Allocate the specified machines and parts into cells so that the grouping efficiency is maximized. The objective of the paper is to cluster the parts based upon self-organizing map (SOM). After clustering, Minkowski distance is used to sort the machines and some bottlenecks are introduced during the clustering process which can be removed manually by rearranging. We are going to implement self-organizing map (SOM) which is a type of artificial neural network technique to solve this problem. The proposed Minkowski distance approach produced solution with a good group efficiency.

목차

Abstract
 1. Introduction
 2. Literature Survey
 3. Methodology
  3.1. Form Initial Machine-part Matrix
  3.2. Clustering Parts using Self Organizing Map Technique
  3.3. Calculate Minkowski Distance for Machines
  3.4. Sorted by Minkowski distance
  3.5. Group Efficiency
 4. Conclusion
 References

키워드

저자

• Tribikram Pradhan [ Assistant Professor, Department Of Information and Communication Technology (ICT) Manipal University, Manipal - 576014, Karnataka, India ]
• Satya Ranjan Mishra [ School Of Information technology and Engineering (SITE), VIT University, Vellore, Tamilnadu, India ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Hybrid Information Technology

• 간기

  격월간

• pISSN

  1738-9968

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605