Heuristic and metaheuristic procedures for the parallel assembly lines balancing problem with multi-line workstations and buffer sizing
This paper addresses the parallel assembly lines balancing problem (PALBP) with multi-line workstations, lines with different cycle times and buffer sizing. When a PALB system works with lines with different cycle times, the lines with multi-line workstations have to produce in batches; thus, the us...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2024 |
| 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/423598 |
| Acceso en línea: | https://hdl.handle.net/2117/423598 https://dx.doi.org/10.1016/j.cor.2024.106596 |
| Access Level: | acceso embargado |
| Palabra clave: | Assembly line balancing Parallel assembly lines Buffer sizing Heuristics Metaheuristics Àrees temàtiques de la UPC::Economia i organització d'empreses |
| Sumario: | This paper addresses the parallel assembly lines balancing problem (PALBP) with multi-line workstations, lines with different cycle times and buffer sizing. When a PALB system works with lines with different cycle times, the lines with multi-line workstations have to produce in batches; thus, the use of buffers may be needed. For the first time in the literature, this study jointly solved the PALBP and the buffer sizing problem (PALBP-B). Due to the multi-objective nature of the problem (minimising the number of workstations and the total buffer size in the multi-line workstations), several multi-objective heuristics and metaheuristics are proposed to solve the PALBP-B. Finally, an extensive computational experiment is carried out to analyse all the procedures presented. |
|---|