English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 52064/87197 (60%)
造訪人次 : 8905255      線上人數 : 313
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/55557

    題名: A CPM-Based bidirectional approach for Type-I assembly line balancing problem
    其他題名: 第一類型組裝線平衡問題之雙向要徑啟發式演算法
    作者: 高秀學;葉丁鴻
    貢獻者: 淡江大學企業管理學系
    關鍵詞: assembly line balancing problem;heuristic;critical path method;bidirectional
    日期: 2008-11
    上傳時間: 2011-08-23 01:06:18 (UTC+8)
    出版者: 中國工業工程學會
    摘要: In this paper we consider the so-called type-I assembly line balancing problem (ALBP-I), in which the objective is to minimize the number of workstations needed for a given cycle time. ALBP-I is one of the well-known NP-hard problems in operations management, and many optimal approaches (including 0-1 integer programming model, branch and bound algorithm, dynamic programming model, etc.) have been developed during the past decades. However, all optimal approaches share the disadvantage of being computationally inefficient in solving large-scale problems, and which makes heuristics a necessity in practice. We propose in this paper a new approach, based on the recently proposed bidirectional heuristic and the critical path method (CPM) of project management, to resolve the issue of task assignment for ALBP-I. A numerical example is given for illustration, and several sample problems are solved to show the effectiveness of the proposed approach.
    關聯: Journal of the Chinese Institute of Industrial Engineers=工業工程學刊 25(6), pp.481-487
    DOI: 10.1080/10170660809509110
    顯示於類別:[企業管理學系暨研究所] 期刊論文





    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回饋