The robust (minmax regret) assembly line worker assignment and balancing problem
COMPUTERS & OPERATIONS RESEARCH
| dc.creator | Pereira, Jordi | |
| dc.date | 2021-08-23T22:59:31Z | |
| dc.date | 2022-07-07T14:56:46Z | |
| dc.date | 2021-08-23T22:59:31Z | |
| dc.date | 2022-07-07T14:56:46Z | |
| dc.date | 2018 | |
| dc.date.accessioned | 2023-08-22T07:15:23Z | |
| dc.date.available | 2023-08-22T07:15:23Z | |
| dc.identifier | 1150306 | |
| dc.identifier | 1150306 | |
| dc.identifier | https://hdl.handle.net/10533/252630 | |
| dc.identifier.uri | https://repositorioslatinoamericanos.uchile.cl/handle/2250/8331031 | |
| dc.description | Line balancing aims to assign the assembly tasks to the stations that compose the assembly line. A recent body of literature has been devoted to heterogeneity in the assembly process introduced by different workers. In such an environment, task times depend on the worker performing the operation and the problem aims at assigning tasks and workers to stations in order to maximize the throughput of the line. In this work, we consider an interval data version of the assembly line worker assignment and balancing problem (ALWABP) in which it is assumed that lower and upper bounds for the task times are known, and the objective is to find an assignment of tasks and workers to the workstations such that the absolute maximum regret among all of the possible scenarios is minimized. The relationship with other interval data minmax regret (IDMR) problems is investigated, the inapplicability of previous approximation methods is studied, regret evaluation is considered, and exact and heuristic solution methods are proposed and analyzed. The results of the proposed methods are compared in a computational experiment, showing the applicability of the method and the theoretical results to solve the problem under study. Additionally, these results are not only applicable to the problem in hand, but also to a more general class of problems. (C) 2018 Elsevier Ltd. All rights reserved. | |
| dc.description | Regular 2015 | |
| dc.description | FONDECYT | |
| dc.description | FONDECYT | |
| dc.language | eng | |
| dc.relation | handle/10533/111557 | |
| dc.relation | handle/10533/111541 | |
| dc.relation | handle/10533/108045 | |
| dc.relation | https://doi.org/10.1016/j.cor.2018.01.009 | |
| dc.rights | Atribución-NoComercial-SinDerivadas 3.0 Chile | |
| dc.rights | http://creativecommons.org/licenses/by-nc-nd/3.0/cl/ | |
| dc.rights | info:eu-repo/semantics/article | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.title | The robust (minmax regret) assembly line worker assignment and balancing problem | |
| dc.title | COMPUTERS & OPERATIONS RESEARCH | |
| dc.type | Articulo | |
| dc.type | info:eu-repo/semantics/publishedVersion |