A Hard Clustering Approach To The Part Family Formation Problem

A Hard Clustering Approach To The Part Family Formation Problem. PRODUCTION PLANNING CONTROL, 8. pp. 231-236.

[img]
Preview
PDF
a_hard_clustering_approach_to_the_part_f_alsultan_isi_a1997wv66000005.pdf

Download (29kB) | Preview

Abstract

The part family problem in group technology can be stated as the problem of finding the best grouping of parts into families such that the parts within each family are as similar to each other as possible. In this paper, the part family formation problem is considered. The problem is cast into a hard clustering model, and the K-means algorithm is proposed for solving it. Preliminary computational experience on the algorithm is very encouraging and it shows that real-life problems of large sizes can efficiently be handled by this approach.

Item Type: Article
Subjects: Computer
Divisions: College Of Computer Sciences and Engineering > Systems Engineering Dept
Depositing User: SHAIKH ARIFUSALAM
Date Deposited: 14 Jun 2008 13:39
Last Modified: 01 Nov 2019 16:44
URI: http://eprints.kfupm.edu.sa/id/eprint/2544