An Efficient Approach for Cell Formation Problems and its Variants
碩士 === 大葉大學 === 工業工程學系碩士班 === 92 === Group technology (GT) has been attracting attention from practitioners and researchers. Cellular manufacturing system (CMS) is an application of GT. Cell formation is one of the core for the CMS. Due to its characteristic of NP-Complete, it often consumes too mu...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2004
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/94987076023113335181 |
| Summary: | 碩士 === 大葉大學 === 工業工程學系碩士班 === 92 === Group technology (GT) has been attracting attention from practitioners and researchers. Cellular manufacturing system (CMS) is an application of GT. Cell formation is one of the core for the CMS. Due to its characteristic of NP-Complete, it often consumes too much time in obtaining optimal solutions or even good solutions.
This research proposes solution algorithms for the cell formation problem and its variant. The proposed algorithm is developed on the basis of an SA based algorithm from the literature. We embed a new idea which aims at reducing the number of exceptional element so that a good parts formation can be found during the generation of neighborhood solution.
Computational results obtained by running test instances (benchmarking problems) were compared with those from the literature show the proposed algorithms perform well in terms of the grouping efficiency and efficacy.
|
|---|