Summary: | 碩士 === 國立中正大學 === 企業管理研究所 === 99 === Two-sided assembly line balancing problem (TALBP) is commonly seen in the industries of assembling large-size products; typical examples include automobiles, buses, and trucks. Unlike the traditional assembly line, assembly tasks in TALBP must be processed on both sides of the assembly line. Only limited researches discuss the issues of TALBP. In this thesis we consider the so-called type-I TALBP (TALBP-I), and the objective is to propose an exact approach in which a mathematical programming model is developed to find the optimal solution of TALBP-I. An illustrative example is given to show the effectiveness of the model. We also show that, through numerical experiments, the model can be extended to solve type-II TALBP (TALBP-II).
Keywords: Type-I assembly line balancing, Two-sided, Mathematical programming
|