Please use this identifier to cite or link to this item: https://ah.lib.nccu.edu.tw/handle/140.119/73497
DC FieldValueLanguage
dc.contributor資管系-
dc.creator陳春龍-
dc.creatorAljaber, Nasser;Baek, Wonjang;Chen, Chuen-Lung-
dc.date1997-01-
dc.date.accessioned2015-02-12T06:19:25Z-
dc.date.available2015-02-12T06:19:25Z-
dc.date.issued2015-02-12T06:19:25Z-
dc.identifier.urihttp://nccur.lib.nccu.edu.tw/handle/140.119/73497-
dc.description.abstractThe formation of machine cells and part families is a central issue in the design of cellular production systems In this paper, we propose a tabu search based approach to deal with this problem by modeling it as a “Shortest Spanning Path” problem with respect to both parts and machines. A comparison of the proposed method with some of the existing methods is presented. Our results revealed that the proposed approach possesses several advantages that make it capable of handling the problem addressed in this paper as it exists in real-world situations.-
dc.format.extent1194027 bytes-
dc.format.mimetypeapplication/pdf-
dc.relationComputers & Industrial Engineering,32(1),169-185-
dc.titleA tabu search approach to the cell formation problem-
dc.typearticleen
dc.identifier.doi10.1016/S0360-8352(96)00208-2en_US
dc.doi.urihttp://dx.doi.org/10.1016/S0360-8352(96)00208-2 en_US
item.fulltextWith Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.grantfulltextrestricted-
item.cerifentitytypePublications-
item.openairetypearticle-
Appears in Collections:期刊論文
Files in This Item:
File Description SizeFormat
169-185.pdf1.17 MBAdobe PDF2View/Open
Show simple item record

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.