ASALBP: The Alternative Subgraphs Assembly Line Balancing Problem

Liliana Capacho (1, 2) , Rafael Pastor (3)

1 Instituto de Organización y Control de Sistemas Industriales
2 Departamento de Investigación de Operaciones y Centro de Simulación y Modelos
3 Instituto de Organización y Control de Sistemas Industriales

Assembly line balancing problems basically consist in assigning a set of tasks to a group of workstations while maintaining the tasks' precedence relations, which are represented by a predetermined precedence graph. However, one or more parts of a product's assembly process may admit alternative precedence subgraphs, which represent possible assembly variants. In general, because of the great difficulty of the problem and the impossibility of representing alternative subgraphs in a precedence graph, the system designer will decide to select, a priori, one of such alternative subgraphs. This paper presents, characterizes and formulates a new general assembly line balancing problem with practical relevance: the Alternative Subgraphs Assembly Line Balancing Problem (ASALBP). Its novel characteristic is that it considers the possibility of having alternative assembly subgraphs, with the processing times and/or the precedence relations of certain tasks dependent on the assembly subgraph selected. Therefore, solving this problem implies simultaneously selecting an assembly subgraph for each part of the assembly that allows alternatives and balancing the line. The potentially positive effects of this on the solution of the problem are shown in a numerical example. Finally, a simple mathematical programming model is described and the results of a brief computational experiment are presented.

Mots clés: Physical Sciences

Liliana Capacho, Rafael Pastor. ASALBP: The Alternative Subgraphs Assembly Line Balancing Problem. International Journal of Production Research, 2008, 46 (13), pp.3503-3516. ⟨10.1080/00207540701197010⟩. ⟨hal-00512975⟩