Please use this identifier to cite or link to this item:
Title: Effective clustering method for group technology problems
Alternative title / Subtitle: a short communication
Authors: Ghosh, Tamal
Dan, Pranab K.
Item type: Conference publication
Keywords: Cell formation;Σχηματισμός κυττάρων;Group technology;Τεχνολογία Ομάδας;Machine part grouping;Μηχανή μέρους ομαδοποίησης;Hybrid clustering technique;Υβριδική τεχνική ομαδοποίησης;Correlation coefficient;Συντελεστής συσχέτισης
Subjects: Technology
Issue Date: 2-Feb-2015
Date of availability: 2-Feb-2015
Publisher: Νερατζής, Ηλίας
Σιανούδης, Ιωάννης
Abstract: Cellular manufacturing (CM) has acquired an upward interest of researchers in recent era. The most important problem in designing cellular manufacturing systems is the cell formation (CF), which constructs part families with similar processing requirements and designates machines into machine cells to optimize the production process. This article presents a short research report based on hybrid approach to the CF problem in CM. The proposed approach exploits Pearson’s correlation coefficient and weighted average linkage clustering technique. Thereafter a modified part grouping method is introduced to improve the quality of solutions. The proposed technique is tested on 12 published datasets and the experimental results signify that the proposed method is quite effective for small to medium size problems.
Language: English
Citation: Ghosh, T. and Dan, P.K. (2011). Effective clustering method for group technology problems: a short communication. "e-Journal of Science & Technology". [Online] 6(4): 23-28. Available from:
Journal: e-Περιοδικό Επιστήμης & Τεχνολογίας
e-Journal of Science & Technology
Type of Journal: With a review process (peer review)
Access scheme: Publicly accessible
License: Αναφορά Δημιουργού-Μη Εμπορική Χρήση-Όχι Παράγωγα Έργα 3.0 Ηνωμένες Πολιτείες
Appears in Collections:Τόμος 06, τεύχος 4 (2011)

Files in This Item:
File Description SizeFormat 
Ghosh_22.pdf448.22 kBAdobe PDFView/Open

This item is licensed under a Creative Commons License Creative Commons