第1筆 /總和 1 筆
/ 1 筆
頁籤選單縮合
題名 | A CPM-Based Bidirectional Approach for Type-I Assembly Line Balancing Problem=第一類型組裝線平衡問題之雙向要徑啟發式演算法 |
---|---|
作者 | 葉丁鴻; 高秀學; | 書刊名 | 工業工程學刊 |
卷期 | 25:6 2008.11[民97.11] |
頁次 | 頁481-487 |
分類號 | 494.542 |
關鍵詞 | 組裝線平衡問題; 啟發式演算法; 要徑法; 雙向式演算法; Assembly line balancing problem; Heuristic; Critical path method; Bidirectional; |
語文 | 英文(English) |
中文摘要 | 第一類型組裝線平衡問題(ALBP-Ⅰ),其目的是在已知產出時間的條件下,求解以最少工作站來平衡組裝線的工作。ALBP-Ⅰ是作業管理領域中著名的難解問題之一。過去數十年來,雖然學者們針對此問題發展出許多具有最佳解的演算法(例如0-1整數規劃模式、分枝限定演算法、動態規劃模式等),然而其共同缺點為在求解大型問題時,計算缺乏效率性。基於實務上的需求,本研究提出一個有效的啟發式演算法,此演算法係結合專案管理的要徑法和雙向式的演算法。從本研究在文獻問題的測試結果,可以看出此演算法的效率(efficiency)與有效性(effectiveness)。 |
英文摘要 | In this paper we consider the so-called type-Ⅰ assembly line balancing problem (ALBP-I), in which the objective is to minimize the number of workstations needed for a given cycle time. ALBP-Ⅰ 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-Ⅰ. A numerical example is given for illustration, and several sample problems are solved to show the effectiveness of the proposed approach. |
本系統之摘要資訊系依該期刊論文摘要之資訊為主。