A Hard Clustering Approach To The Part Family Formation Problem
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 har...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| مؤلفون آخرون: | |
| التنسيق: | article |
| منشور في: |
2020
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://eprints.kfupm.edu.sa/id/eprint/2544/1/a_hard_clustering_approach_to_the_part_f_alsultan_isi_a1997wv66000005.pdf |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| _version_ | 1864513390861352960 |
|---|---|
| author | AlSultan, K.S. |
| author2 | unknown |
| author2_role | author |
| author_facet | AlSultan, K.S. unknown |
| author_role | author |
| dc.creator.none.fl_str_mv | AlSultan, K.S. unknown |
| dc.date.*.fl_str_mv | 2020 |
| dc.format.none.fl_str_mv | application/pdf |
| dc.identifier.none.fl_str_mv | https://eprints.kfupm.edu.sa/id/eprint/2544/1/a_hard_clustering_approach_to_the_part_f_alsultan_isi_a1997wv66000005.pdf A Hard Clustering Approach To The Part Family Formation Problem. PRODUCTION PLANNING CONTROL, 8. pp. 231-236. |
| dc.language.none.fl_str_mv | en |
| dc.publisher.none.fl_str_mv | TAYLOR FRANCIS LTD |
| dc.relation.none.fl_str_mv | https://eprints.kfupm.edu.sa/id/eprint/2544/ |
| dc.rights.*.fl_str_mv | info:eu-repo/semantics/openAccess |
| dc.subject.none.fl_str_mv | Computer |
| dc.title.none.fl_str_mv | A Hard Clustering Approach To The Part Family Formation Problem |
| dc.type.none.fl_str_mv | Article PeerReviewed info:eu-repo/semantics/publishedVersion info:eu-repo/semantics/article |
| description | 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. |
| eu_rights_str_mv | openAccess |
| format | article |
| id | KFUPM_55ab9f0aa67fc4840cece98ffb9a2854 |
| identifier_str_mv | A Hard Clustering Approach To The Part Family Formation Problem. PRODUCTION PLANNING CONTROL, 8. pp. 231-236. |
| language_invalid_str_mv | en |
| network_acronym_str | KFUPM |
| network_name_str | King Fahd University of Petroleum and Minerals |
| oai_identifier_str | oai::2544 |
| publishDate | 2020 |
| publisher.none.fl_str_mv | TAYLOR FRANCIS LTD |
| repository.mail.fl_str_mv | |
| repository.name.fl_str_mv | |
| repository_id_str | |
| spelling | A Hard Clustering Approach To The Part Family Formation ProblemAlSultan, K.S.unknownComputerThe 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.TAYLOR FRANCIS LTDArticlePeerReviewedinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttps://eprints.kfupm.edu.sa/id/eprint/2544/1/a_hard_clustering_approach_to_the_part_f_alsultan_isi_a1997wv66000005.pdf A Hard Clustering Approach To The Part Family Formation Problem. PRODUCTION PLANNING CONTROL, 8. pp. 231-236. enhttps://eprints.kfupm.edu.sa/id/eprint/2544/2020info:eu-repo/semantics/openAccessoai::25442019-11-01T13:44:44Z |
| spellingShingle | A Hard Clustering Approach To The Part Family Formation Problem AlSultan, K.S. Computer |
| status_str | publishedVersion |
| title | A Hard Clustering Approach To The Part Family Formation Problem |
| title_full | A Hard Clustering Approach To The Part Family Formation Problem |
| title_fullStr | A Hard Clustering Approach To The Part Family Formation Problem |
| title_full_unstemmed | A Hard Clustering Approach To The Part Family Formation Problem |
| title_short | A Hard Clustering Approach To The Part Family Formation Problem |
| title_sort | A Hard Clustering Approach To The Part Family Formation Problem |
| topic | Computer |
| url | https://eprints.kfupm.edu.sa/id/eprint/2544/1/a_hard_clustering_approach_to_the_part_f_alsultan_isi_a1997wv66000005.pdf |