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...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2006 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/6059 |
| Acceso en línea: | https://hdl.handle.net/2117/6059 |
| Access Level: | acceso abierto |
| Palabra clave: | Assembly-line methods Assembly Line Balancing Problem Mathematical programming model MILP Problema de equilibrado de líneas de montaje Problema d'equilibrat de línies de muntatge Programación matemática -- Modelos Programació matemàtica -- Models Producció -- Planificació Àrees temàtiques de la UPC::Economia i organització d'empreses::Direcció d'operacions |
| Sumario: | 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 subprocesses 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. |
|---|