English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 57075/90742 (63%)
造訪人次 : 12504136      線上人數 : 122
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/55558

    題名: A New Bidirectional Heuristic for Assembly Line Balancing Problem
    作者: 高秀學;Kao, Hsiu-hsueh;Yeh, Din-horng
    貢獻者: 淡江大學企業管理學系
    日期: 2009-11
    上傳時間: 2011-08-23 01:06:28 (UTC+8)
    出版者: Elsevier
    摘要: Assembly line balancing problem (ALBP) is one of the well-known NP-hard layout planning problems for mass production systems. Many exact solution approaches have been developed, including 0–1 integer programming model, branch and bound algorithm, dynamic programming model, etc.; however, all optimal approaches are computationally inefficient in solving large-scale problems, which makes heuristic approaches a necessity in practice. In this paper we propose a new efficient heuristic, based on a recent bidirectional approach and the famous critical path method (CPM) widely used in project management, to resolve the issue of task assignment for ALBP. An example is given for illustration, and numerical results of sample problems selected from the literature are also given to show the effectiveness of the proposed heuristic.
    關聯: Computers & Industrial Engineering Journal 57(4), pp.1155-1160
    DOI: 10.1016/j.cie.2009.05.004
    顯示於類別:[企業管理學系暨研究所] 期刊論文


    檔案 描述 大小格式瀏覽次數
    A New Bidirectional Heuristic for Assembly Line Balancing Problem.pdf231KbAdobe PDF0檢視/開啟



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