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...
محفوظ في:
| المؤلف الرئيسي: | AlSultan, K.S. (author) |
|---|---|
| مؤلفون آخرون: | unknown (author) |
| التنسيق: | article |
| منشور في: |
2020
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://eprints.kfupm.edu.sa/id/eprint/2544/1/a_hard_clustering_approach_to_the_part_f_alsultan_isi_a1997wv66000005.pdf |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
مواد مشابهة
-
A Genetic Algorithm For The Part Family Formation Problem
حسب: AlSultan, K.S.
منشور في: (2020) -
Computational Experience On Four Algorithms For The Hard Clustering Problem
حسب: AlSultan, K.S.
منشور في: (2020) -
A TABU SEARCH APPROACH TO THE CLUSTERING PROBLEM
حسب: AlSultan, K.S.
منشور في: (2020) -
A Tabu Search-Based Algorithm For The Fuzzy Clustering Problem
حسب: AlSultan, K.S.
منشور في: (2020) -
A SIMULATED ANNEALING ALGORITHM FOR THE CLUSTERING PROBLEM
حسب: Selim, S.Z.
منشور في: (2020)