頁籤選單縮合
題名 | 結合二元整數規劃模式與二分搜尋法求解混合型裝配線平衡問題研究=Using Binary Integer Programming Model and Binary Search for Solving Mixed-model Assembly Line Balancing Problem |
---|---|
作者 | 廖麗滿; 顧維鈞; Liao, Li-man; Gu, Wei-juan; |
期刊 | 創新與經營管理學刊 |
出版日期 | 20130700 |
卷期 | 4:1 2013.07[民102.07] |
頁次 | 頁1-13 |
分類號 | 494.542 |
語文 | chi |
關鍵詞 | 混合型裝配線平衡; 二分整數規劃; 二分搜尋法; 生產排程; Mixed-model assembly line balancing; Binary integer programming; Binary search; Scheduling; |
中文摘要 | 滿足顧客對產品差異性的需求,裝配線必須從單一產品裝配線轉變成生產多種產品的裝配線,特別是同時生產多種產品的混合型裝配線,因此混合型裝配線平衡的問題成為重要的議題。本研究首先發展改善Gökcen and Erel所提出的二元整數規劃模式(binary integer programming, BIP)模式,並運用二分搜尋法(binary search)的技術,求解混合型裝配線平衡問題。本研究在機器數為3的情況下,求得比較例子的最佳的週期時間,而其演算績效的改善率為10%。 |
英文摘要 | In order to respond to the diversified customer needs, the assembly line model has to change from single type to multiple types simultaneously on the same assembly line. The mixed-model assembly line balancing (MMALB) problem becomes an important issue. This research develops an improved binary integer programming (BIP) model based on Gökcen and Erel, and then applies binary search structure to solve mixed-model assembly line balancing problems. The proposed algorithm obtains optimal cycle time given three workstations. The percentage improvement is 10% for the comparative mixed-model assembly line example. |
本系統之摘要資訊系依該期刊論文摘要之資訊為主。