| Summary: | 博士 === 國立中正大學 === 企業管理研究所 === 100 === 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,
|
|---|
