A CPM-Based bidirectional approach for Type-I assembly line balancing problem
學年 97
學期 1
出版（發表）日期 2008-11-01
作品名稱 A CPM-Based bidirectional approach for Type-I assembly line balancing problem
作品名稱（其他語言） 第一類型組裝線平衡問題之雙向要徑啟發式演算法
著者 高秀學; 葉丁鴻
單位 淡江大學企業管理學系
出版者 中國工業工程學會
著錄名稱、卷期、頁數 Journal of the Chinese Institute of Industrial Engineers=工業工程學刊 25(6), pp.481-487
摘要 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.
關鍵字 assembly line balancing problem;heuristic;critical path method;bidirectional
語言 en
ISSN 1017-0669
期刊性質 國外
收錄於
產學合作
通訊作者
審稿制度 否
國別 SGP
公開徵稿
出版型式 ,紙本
相關連結

機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/55557 )

機構典藏連結