Please use this identifier to cite or link to this item:
https://ah.lib.nccu.edu.tw/handle/140.119/73497
DC Field | Value | Language |
---|---|---|
dc.contributor | 資管系 | - |
dc.creator | 陳春龍 | - |
dc.creator | Aljaber, Nasser;Baek, Wonjang;Chen, Chuen-Lung | - |
dc.date | 1997-01 | - |
dc.date.accessioned | 2015-02-12T06:19:25Z | - |
dc.date.available | 2015-02-12T06:19:25Z | - |
dc.date.issued | 2015-02-12T06:19:25Z | - |
dc.identifier.uri | http://nccur.lib.nccu.edu.tw/handle/140.119/73497 | - |
dc.description.abstract | The 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.extent | 1194027 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.relation | Computers & Industrial Engineering,32(1),169-185 | - |
dc.title | A tabu search approach to the cell formation problem | - |
dc.type | article | en |
dc.identifier.doi | 10.1016/S0360-8352(96)00208-2 | en_US |
dc.doi.uri | http://dx.doi.org/10.1016/S0360-8352(96)00208-2 | en_US |
item.fulltext | With Fulltext | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.grantfulltext | restricted | - |
item.cerifentitytype | Publications | - |
item.openairetype | article | - |
Appears in Collections: | 期刊論文 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
169-185.pdf | 1.17 MB | Adobe PDF2 | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.