The ASALB Problem with Processing Alternatives Involving Different Tasks: Definition, Formalization and Resolution
The Alternative Subgraphs Assembly Line Balancing Problem (ASALBP) considers assembly alternatives that determine task processing times and/or precedence relations among the tasks. Capacho and Pastor  formalized this problem and developed a mathematical programming model (MILP) in which the assembly alternatives are determined by combining all available processing alternatives of each existing sub-assembly. In this paper an extended definition of the ASALBP is presented in which assembly sub-processes involving different tasks are also considered. Additionally, a mathematical programming model is proposed to formalize and solve the extended version of the ASALBP, which also improves the performance of the former MILP model. Some computational results are included.
KeywordsPrecedence Relation Total Processing Time Assembly Line Balance Mathematical Programming Model Assembly Line Balance Problem
Unable to display preview. Download preview PDF.
- 3.Capacho, L., Pastor, R.: ASALBP: the Alternative Subgraphs Assembly Line Balancing Problem. Technical Report IOC-DT-P-2005-5. UPC. Spain (Jan. 2005)Google Scholar
- 7.Lapierre, S.D., Ruiz, A.B.: Balancing assembly lines: an industrial case study. J. of the Operational Research Society 55, 559–597 (2004)Google Scholar