English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 92721/123073 (75%)
Visitors : 26952138      Online Users : 337
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    政大機構典藏 > 商學院 > 資訊管理學系 > 期刊論文 >  Item 140.119/73497
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/73497

    Title: A tabu search approach to the cell formation problem
    Authors: 陳春龍
    Aljaber, Nasser;Baek, Wonjang;Chen, Chuen-Lung
    Contributors: 資管系
    Date: 1997-01
    Issue Date: 2015-02-12 14:19:25 (UTC+8)
    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.
    Relation: Computers & Industrial Engineering,32(1),169-185
    Data Type: article
    DOI 連結: http://dx.doi.org/10.1016/S0360-8352(96)00208-2
    DOI: 10.1016/S0360-8352(96)00208-2
    Appears in Collections:[資訊管理學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    169-185.pdf1166KbAdobe PDF1166View/Open

    All items in 政大典藏 are protected by copyright, with all rights reserved.

    社群 sharing

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback