Two-sided assembly line balancing problem (TALBP) is commonly seen in the industries of assembling large-size products; typical examples include automobiles, buses, trucks, etc. Unlike the traditional assembly lines, assembly tasks in TALBP must be processed on both sides of the assembly line. Only limited researches discuss the issues of TALBP. We consider in this study the so-called type-I TALBP (TALBP-I), and the objective of this study is to propose a mathematical programming model to find the optimal task assignment 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). Two-sided assembly line balancing problem (TALBP) is commonly seen in the industries of assembling large-size products; typical examples include automobiles, buses, trucks, etc. Unlike the traditional assembly lines, assembly tasks in TALBP must be processed on both sides of the assembly line. Only limited researches discuss the issues of TALBP. We consider in this study the so-called type-I TALBP (TALBP-I), and the objective of this study is to propose a mathematical programming model to find the optimal task assignment 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).
Relation:
The IEEE International Conference on Industrial Engineering and Engineering Management
