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 |
id |
ndltd-TW-092DYU00030013 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-092DYU000300132016-01-04T04:08:54Z http://ndltd.ncl.edu.tw/handle/94987076023113335181 An Efficient Approach for Cell Formation Problems and its Variants 製造單元形成問題之啟發式求解研究 Yi-Ming Yang 楊鎰銘 碩士 大葉大學 工業工程學系碩士班 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. Tai-Hsi Wu 吳泰熙 2004 學位論文 ; thesis 59 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 大葉大學 === 工業工程學系碩士班 === 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.
|
author2 |
Tai-Hsi Wu |
author_facet |
Tai-Hsi Wu Yi-Ming Yang 楊鎰銘 |
author |
Yi-Ming Yang 楊鎰銘 |
spellingShingle |
Yi-Ming Yang 楊鎰銘 An Efficient Approach for Cell Formation Problems and its Variants |
author_sort |
Yi-Ming Yang |
title |
An Efficient Approach for Cell Formation Problems and its Variants |
title_short |
An Efficient Approach for Cell Formation Problems and its Variants |
title_full |
An Efficient Approach for Cell Formation Problems and its Variants |
title_fullStr |
An Efficient Approach for Cell Formation Problems and its Variants |
title_full_unstemmed |
An Efficient Approach for Cell Formation Problems and its Variants |
title_sort |
efficient approach for cell formation problems and its variants |
publishDate |
2004 |
url |
http://ndltd.ncl.edu.tw/handle/94987076023113335181 |
work_keys_str_mv |
AT yimingyang anefficientapproachforcellformationproblemsanditsvariants AT yángyìmíng anefficientapproachforcellformationproblemsanditsvariants AT yimingyang zhìzàodānyuánxíngchéngwèntízhīqǐfāshìqiújiěyánjiū AT yángyìmíng zhìzàodānyuánxíngchéngwèntízhīqǐfāshìqiújiěyánjiū AT yimingyang efficientapproachforcellformationproblemsanditsvariants AT yángyìmíng efficientapproachforcellformationproblemsanditsvariants |
_version_ |
1718159336096661504 |