Records |
Author |
Alvarez-Miranda, E.; Chace, S.; Pereira, J. |
Title |
Assembly line balancing with parallel workstations |
Type |
|
Year |
2021 |
Publication |
International Journal Of Production Research |
Abbreviated Journal |
Int. J. Prod. Res. |
Volume |
59 |
Issue |
21 |
Pages |
6486-6506 |
Keywords |
Line balancing; parallel stations; dynamic programming; hybrid metaheuristic; matheuristic |
Abstract |
The simple assembly line balancing problem (SALBP) considers work division among different workstations of a serially arranged assembly process to maximise its efficiency under workload (cumulative) and technological (precedence) constraints. In this work, we consider a variant of the SALBP which allows parallel workstations. To study the effect of parallel stations, we propose a new problem (the parallel station assembly line balancing problem or PSALBP) in which the objective is to minimise the number of parallel stations required to obtain the maximum theoretical efficiency of the assembly process. We study the complexity of the problem and identify a polynomially solvable case. This result is then used as a building block for the development of a heuristic solution procedure. Finally, we carry out a computational experiment to identify the characteristics of assembly lines that may benefit from station paralleling and to evaluate the performance of the proposed heuristic. |
Address |
[alvarez-Miranda, Eduardo] Univ Talca, Fac Engn, Dept Ind Engn, Curico, Chile, Email: jorge.pereira@uai.cl |
Corporate Author |
|
Thesis |
|
Publisher |
Taylor & Francis Ltd |
Place of Publication |
|
Editor |
|
Language |
English |
Summary Language |
|
Original Title |
|
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
Series Volume |
|
Series Issue |
|
Edition |
|
ISSN |
0020-7543 |
ISBN |
|
Medium |
|
Area |
|
Expedition |
|
Conference |
|
Notes |
WOS:000569837900001 |
Approved |
|
Call Number |
UAI @ alexi.delcanto @ |
Serial |
1243 |
Permanent link to this record |
|
|
|
Author |
Alvarez-Miranda, E.; Pereira, J.; Vargas, C.; Vila, M. |
Title |
Variable-depth local search heuristic for assembly line balancing problems |
Type |
|
Year |
2022 |
Publication |
International Journal Of Production Research |
Abbreviated Journal |
Int. J. Prod. Res. |
Volume |
61 |
Issue |
9 |
Pages |
3103-3121 |
Keywords |
Assembly lines; Manufacturing; simple assembly line balancing; local search; variable-depth local search |
Abstract |
Assembly lines are production flow systems wherein activities are organised around a line consisting of various workstations through which the product flows. At each station, the product is assembled through a subset of operations. The assembly line balancing problem (ALBP) consists of allocating operations between stations to maximise the system efficiency. In this study, a variable-depth local search algorithm is proposed for solving simple assembly line balancing problems (SALBPs), which are the most widely studied versions of the ALBP. Although the state-of-the-art techniques for solving the SALBP consist of exact enumeration-based methods or heuristics, this paper proposes a local search-based heuristic using variable-length sequences that allow the solution space to be efficiently explored. The proposed algorithm improves the best solution known for multiple instances reported in the literature, indicating that its efficiency is comparable to those of the state-of-the-art method for solving the SALBP. Moreover, the characteristics of the instances for which the proposed procedure provides a better solution than previously reported construction procedures are investigated. |
Address |
|
Corporate Author |
|
Thesis |
|
Publisher |
|
Place of Publication |
|
Editor |
|
Language |
|
Summary Language |
|
Original Title |
|
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
Series Volume |
|
Series Issue |
|
Edition |
|
ISSN |
0020-7543 |
ISBN |
|
Medium |
|
Area |
|
Expedition |
|
Conference |
|
Notes |
WOS:000800928700001 |
Approved |
|
Call Number |
UAI @ alexi.delcanto @ |
Serial |
1578 |
Permanent link to this record |
|
|
|
Author |
Pereira, J. |
Title |
Modelling and solving a cost-oriented resource-constrained multi-model assembly line balancing problem |
Type |
|
Year |
2018 |
Publication |
International Journal Of Production Research |
Abbreviated Journal |
Int. J. Prod. Res. |
Volume |
56 |
Issue |
11 |
Pages |
3994-4016 |
Keywords |
assembly line balancing; combinatorial optimisation; lower bound; heuristics; estimation of distribution algorithm |
Abstract |
A line balancing problem considers the assignment of operations to workstations in an assembly line. While assembly lines are usually associated to mass production of standardised goods, their advantages have led to their widespread use whenever a product-oriented production system is applicable and the benefits of the labour division and specialisation are significant, even when some of its characteristics may deviate from classical assembly lines. In this work, we study a line balancing problem found in the textile industry in which the line must be balanced for multiple types of goods taking into account resource requirements. In order to solve the problem, a hybrid method that combines classical methods for line balancing with an Estimation of Distribution Algorithm is proposed. Computational experiments show that the new procedure improves upon the state of the art when compared using a benchmark set derived from the literature, as well as when compared using data from the manufacturer that originated this research work. |
Address |
[Pereira, Jordi] Univ Adolfo Ibanez, Fac Engn & Sci, Vina Del Mar, Chile, Email: jorge.pereira@uai.cl |
Corporate Author |
|
Thesis |
|
Publisher |
Taylor & Francis Ltd |
Place of Publication |
|
Editor |
|
Language |
English |
Summary Language |
|
Original Title |
|
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
Series Volume |
|
Series Issue |
|
Edition |
|
ISSN |
0020-7543 |
ISBN |
|
Medium |
|
Area |
|
Expedition |
|
Conference |
|
Notes |
WOS:000438403800013 |
Approved |
|
Call Number |
UAI @ eduardo.moreno @ |
Serial |
889 |
Permanent link to this record |
|
|
|
Author |
Pereira, J.; Vila, M. |
Title |
A new model for supply chain network design with integrated assembly line balancing decisions |
Type |
|
Year |
2016 |
Publication |
International Journal Of Production Research |
Abbreviated Journal |
Int. J. Prod. Res. |
Volume |
54 |
Issue |
9 |
Pages |
2653-2669 |
Keywords |
decomposition; mixed integer linear programming; supply chain design; line balancing; SALBP-1 |
Abstract |
Supply chain network design aims at the integration of the different actors of a supply chain within a single framework in order to optimise the total profit of the system. In this paper, we consider the integration of line balancing issues within the tactical decisions of the supply chain, and we offer a novel model and a solution approach for the problem. The new approach decomposes the problem into multiple line balancing problems and a mixed integer linear model, which is easier to solve than the previously available non-linear mixed integer formulation. The results show that the new method is able to solve previously studied models within a fraction of the reported running times, and also allows us to solve larger instances than those reported in earlier works. Finally, we also provide some analysis on the influence of the cost structure, the demand and the structure of the assembly process on the final configuration of the assemblies and the distribution network. |
Address |
[Pereira, Jordi] Univ Adolfo Ibanez, Fac Sci & Engn, Vina Del Mar, Chile, Email: jorge.pereira@uai.cl |
Corporate Author |
|
Thesis |
|
Publisher |
Taylor & Francis Ltd |
Place of Publication |
|
Editor |
|
Language |
English |
Summary Language |
|
Original Title |
|
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
Series Volume |
|
Series Issue |
|
Edition |
|
ISSN |
0020-7543 |
ISBN |
|
Medium |
|
Area |
|
Expedition |
|
Conference |
|
Notes |
WOS:000373632300009 |
Approved |
|
Call Number |
UAI @ eduardo.moreno @ |
Serial |
608 |
Permanent link to this record |