利用數學規劃模式找出在有雙邊同時作業任務時的雙邊生產線平衡問題最佳解

Using Mathematical Programming to Find the Optimal Solution of Type-I Two-sided Assembly Line Balancing Problem with Two-sided Tasks

雙邊生產線平衡問題（TALBP）被廣泛的應用在大型產品的裝配工業上面，例如汽車、公車以及卡車的裝配線上都可以看的到。雙邊生產線與傳統的生產線不同的地方是：組裝的工作必須要符合雙邊生產線的要求，就是要把工作任務分派到工作站的雙邊，在相關的文獻資料中探討雙邊生產線平衡問題的文獻非常有限的。所以本研究在考量當有任務需要雙邊同時作業的情境下，考慮第一型雙邊生產線問題（TALBP-I），透過數學規劃找出第一型雙邊生產線平衡的最佳解。並透過例題印證說明本研究的有效性。

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. In this thesis we consider the problem which called type-I TALBP (TALBP-I), and the objective is to find the minimal workstations by using mathematics programming model. An illustrative example is given to show the effectiveness of the model.