建構資源限制下雙邊生產線平衡最佳解之數學規劃模式

顏伯蒼(Yen, Potsang)

指導教授 ： 葉丁鴻

國立中正大學/管理學院/企業管理學系/博士(2012年)

摘要

摘 要
雙邊生產線平衡問題(TALBP)被廣泛的應用在大型產品的裝配工業上面，例如汽車、公車以及卡車的裝配線上都可以看的到。雙邊生產線與傳統的生產線不同的地方是：組裝的工作必須要符合雙邊生產線的要求，就是要把工作任務分派到工作站的雙邊。目前探討雙邊生產線平衡與資源限制理論下生產線平衡問題的相關文獻非常的有限。
在本篇文章中，我們首先考慮當任務增加雙邊須同時任務的第一型雙邊生產線問題(TALBP-I)，目標是要透過數學規劃找出第一型雙邊生產線平衡的最佳解，之後探討當雙邊任務非同時進行時期最佳解為何。而後再將模式推展到第二型雙邊生產線平衡問題(TALBP-II)，即是在工作站數目已知的情形下，找出最少的週期時間。
最後考量在資源限制的條件下，找出最適資源配置的狀況，以及當資源使用數量與工作站配置數量為已知的情形下，找出最少的週期時間，並透過例題印證說明本研究的有效性。

關鍵字：第一型生產線平衡、第二型生產線平衡、雙邊、數學規劃、資源限制生產線平衡問題

關鍵字

第一型生產線平衡 ； 第二型生產線平衡 ； 雙邊 ； 數學規劃 ； 資源限制生產線平衡問題

並列摘要

Abstract
Two-sided assembly line balancing problem (TALBP)is commonly seen in the industries of assembling large-size products, like automobiles, buses, and trucks. Assembly tasks in TALBP must be processed on both side of assembly line. There are few papers discuss with TALBP and resource constrain assembly line balancing problems (RCALBP).
In this thesis we first consider the type-I TALBP (TALBP-I) with two-sided task which need to operate with both side in the same time, and the objective is to find the minimal workstations by using mathematics programming model. The second, we consider the same problem with the both side tasks which can operate in the different time. The third, as the maximum of the workstations is given, find the minimum of the cycle time which calls type-II TALBP (TALBP-II).
Finally, we consider with the resource constrain of the two-sided assembly balancing problem (RCTALBP), and as the maximum of the resource and workstations are given, find the minimum cycle time of the problem. An illustrative example is given to show the effectiveness of the model.

Keywords: Type-I assembly line balancing, Type-II assembly line balancing, Two-sided, Mathematical programming, Resource constrain assembly line balancing problem,

並列關鍵字

Type-I assembly line balancing ； Type-II assembly line balancing ； Two-sided ； Mathematical programming ； Resource constrain assembly line balancing problem

參考文獻

Ağpak & Gőken (2005), Assembly line balancing: two resource constrained case, International Journal of Production Economics, Vol.96, pp.129-140.

Bartholdi J. (1993), Balancing two-sided assembly lines: a case study, International Journal of Production Research, Vol.31, pp.2447-2461.

Baybars, I. (1986), An efficient heuristic method for the simple assembly line balancing problem, International Journal of Production Research, Vol.24, No.1, pp.149-166.

Baykasoglu, A. & Dereli, T. (2006), Two-sided assembly line balancing using an ant-colony-based heuristic, International Journal of Advanced Manufacturing Technology, Vol.36, No.3, pp.582-588.

Hu, X.F., Wu, E.F., Bao,J.S., & Jin, Y. (2010), A branch-and-bound algorithm to minimize the line length of a two-sided assembly line. European Journal of Operational Research, Vol.206, pp.703-707.