Gabriel Gazzinelli Guimarães
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Gabriel Gazzinelli Guimarães has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Kelly Cristina Poldi
Universidade Estadual de Campinas
4 shared publications - Mateus Martin
Universidade Federal de São Carlos
2 shared publications Gabriel Gazzinelli Guimarães
1 shared publication- Horacio Hideki Yanasse
Universidade Federal de São Paulo - UNIFESP
1 shared publication Sebastião Antonio Alves Rodrigues
1 shared publication
Latest Publications
- Open Access
- 12 October 2026
- Published by Springer Nature in TOP
- p. 1-40
Optimizing ergonomics and productivity in automotive assembly lines: a bi-objective integer linear programming approach
The automotive industry’s operations face a critical dilemma: achieving high productivity while maintaining adequate ergonomic standards. High-volume production amplifies this condition, because the frequency of task execution keeps ergonomic risk ever-present. This work presents a real case from an automotive body parts assembly line. The objectives are to minimize the maximum individual ergonomic risk throughout job-rotation periods along a daily journey, and to optimize productivity by determining the optimal worker-to-workstation assignments. The Occupational Repetitive Action (OCRA) index is used to assess the risk of upper extremity musculoskeletal disorders. To solve this bi-objective problem, two algorithms are proposed: an $$\varepsilon $$ -constraint approach and a Tchebychev method. Both are grounded in a novel Integer Linear Programming (ILP) model tailored to integrate ergonomic and productivity considerations. The algorithms generated a complete Pareto front of 16 efficient solutions within a reasonable computational time. Managerial insights are derived, highlighting the inherent trade-off between the makespan and ergonomic risk, providing valuable guidelines for balancing worker well-being and productivity in assembly-line operations.- 12 October 2026
- Published by Springer Nature in TOP
- p. 1-40
Open AccessOptimizing ergonomics and productivity in automotive assembly lines: a bi-objective integer linear programming approach
The automotive industry’s operations face a critical dilemma: achieving high productivity while maintaining adequate ergonomic standards. High-volume production amplifies this condition, because the frequency of task execution keeps ergonomic risk ever-present. This work presents a real case from an automotive body parts assembly line. The objectives are to minimize the maximum individual ergonomic risk throughout job-rotation periods along a daily journey, and to optimize productivity by determining the optimal worker-to-workstation assignments. The Occupational Repetitive Action (OCRA) index is used to assess the risk of upper extremity musculoskeletal disorders. To solve this bi-objective problem, two algorithms are proposed: an $$\varepsilon $$ -constraint approach and a Tchebychev method. Both are grounded in a novel Integer Linear Programming (ILP) model tailored to integrate ergonomic and productivity considerations. The algorithms generated a complete Pareto front of 16 efficient solutions within a reasonable computational time. Managerial insights are derived, highlighting the inherent trade-off between the makespan and ergonomic risk, providing valuable guidelines for balancing worker well-being and productivity in assembly-line operations. - Open Access
- 10 April 2026
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 217
Exact approaches for the pattern minimization problem
- 10 April 2026
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 217
Open AccessExact approaches for the pattern minimization problem
- Open Access
- 1 January 2026
- Published by FapUNIFESP (SciELO) in Pesquisa Operacional
- Vol. 46, e303022
EMPIRICAL STUDY ON ONE-DIMENSIONAL CUTTING STOCK PROBLEM SOLUTIONS USING ONLY CUTTING PATTERNS WITH A LIMITED NUMBER OF DISTINCT ITEM TYPES
In this study we focus on the approximate solution of the one-dimensional Cutting Stock Problem (CSP) by leveraging insights from studies on the Cutting Stock Problem with a Limited Number of Open Stacks (CS-LOSP). The CS-LOSP, a variant of the classical CSP, imposes a limit on the number of open stacks during production, reflecting constraints observed in many industrial environments. Em-pirical findings from CS-LOSP studies have shown that high-quality CSP solutions can be achieved with low values of C (the permitted number of open stacks). Inspired by these observations, we investigate a matheuristic pattern screening strategy that discards all cutting patterns generating more than C distinct item types to solve the CSP. The work is empirical in nature, supported by extensive computational tests designed to verify whether the promising results observed in CS-LOSP can be replicated in the classical one-dimensional CSP. Our experiments identify the conditions under which the matheuristic produces optimal or near-optimal solutions, particularly under medium to high demand levels, while its effectiveness tends to decrease in low-demand scenarios. Beyond demonstrating significant reductions in the size of the feasible pattern set to be considered when solving the CSP, our results underline the practical relevance of our approach. This is especially pertinent for sequential optimization systems in industrial applications.
- 1 January 2026
- Published by FapUNIFESP (SciELO) in Pesquisa Operacional
- Vol. 46, e303022
Open AccessEMPIRICAL STUDY ON ONE-DIMENSIONAL CUTTING STOCK PROBLEM SOLUTIONS USING ONLY CUTTING PATTERNS WITH A LIMITED NUMBER OF DISTINCT ITEM TYPES
In this study we focus on the approximate solution of the one-dimensional Cutting Stock Problem (CSP) by leveraging insights from studies on the Cutting Stock Problem with a Limited Number of Open Stacks (CS-LOSP). The CS-LOSP, a variant of the classical CSP, imposes a limit on the number of open stacks during production, reflecting constraints observed in many industrial environments. Em-pirical findings from CS-LOSP studies have shown that high-quality CSP solutions can be achieved with low values of C (the permitted number of open stacks). Inspired by these observations, we investigate a matheuristic pattern screening strategy that discards all cutting patterns generating more than C distinct item types to solve the CSP. The work is empirical in nature, supported by extensive computational tests designed to verify whether the promising results observed in CS-LOSP can be replicated in the classical one-dimensional CSP. Our experiments identify the conditions under which the matheuristic produces optimal or near-optimal solutions, particularly under medium to high demand levels, while its effectiveness tends to decrease in low-demand scenarios. Beyond demonstrating significant reductions in the size of the feasible pattern set to be considered when solving the CSP, our results underline the practical relevance of our approach. This is especially pertinent for sequential optimization systems in industrial applications.
- Open Access
- 6 October 2025
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 64 (4) , 1358-1385
On formulations for the one-dimensional cutting stock with a limited number of open stacks problem
- 6 October 2025
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 64 (4) , 1358-1385
Open AccessOn formulations for the one-dimensional cutting stock with a limited number of open stacks problem
- 5 April 2025
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 49 (3) , 1-35
Mathematical models for the one-dimensional cutting stock problem with setups and open stacks
- 5 April 2025
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 49 (3) , 1-35
Mathematical models for the one-dimensional cutting stock problem with setups and open stacks