Kelly Cristina Poldi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Kelly Cristina Poldi has a total of 23 co-authors. Here are the top co-authors by number of shared publications:
- Gabriel Gazzinelli Guimarães
Universidade Estadual de Campinas
4 shared publications - Marcos Nereu Arenales
Universidade de São Paulo
4 shared publications - Silvio Alexandre de Araujo
Universidade Estadual Paulista-UNESP
4 shared publications - Andréa Carla Gonçalves Vianna
Universidade Estadual Paulista, Brasil
2 shared publications Gabriel Gazzinelli Guimarães
2 shared publications- Livia Maria Pierini
Universidade Estadual de Campinas, Brazil
2 shared publications
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
- 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
- Open Access
- 1 July 2023
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 57 (4) , 2067-2085
Mathematical models for the cutting stock with limited open stacks problem
This research is focused on solving the Cutting Stock with Limited Open Stacks Problem (CS-LOSP). The CS-LOSP is an optimization problem which consists of the classical Cutting Stock Problem (CSP) paired with the additional constraint that the maximum number of open stacks from the sequencing of the cutting patterns obtained from the CSP solution is equal or lower than a preset limit. Despite being a problem with great practical importance, the literature lacks models for this problem, and only one-dimensional problems are addressed. In this paper, we propose two integer linear programming formulations for the CS-LOSP that are valid for solving instances of the CSP of any dimension. In order to eliminate symmetrical solutions to the problem, the proposed formulations sequence sets of cutting patterns instead of sequencing the cutting patterns individually, thus, the search space for solutions is reduced. A set of randomly generated instances for the two-dimensional problem is used to perform computational experiments in order to validate the proposed mathematical formulations.
- 1 July 2023
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 57 (4) , 2067-2085
Open AccessMathematical models for the cutting stock with limited open stacks problem
This research is focused on solving the Cutting Stock with Limited Open Stacks Problem (CS-LOSP). The CS-LOSP is an optimization problem which consists of the classical Cutting Stock Problem (CSP) paired with the additional constraint that the maximum number of open stacks from the sequencing of the cutting patterns obtained from the CSP solution is equal or lower than a preset limit. Despite being a problem with great practical importance, the literature lacks models for this problem, and only one-dimensional problems are addressed. In this paper, we propose two integer linear programming formulations for the CS-LOSP that are valid for solving instances of the CSP of any dimension. In order to eliminate symmetrical solutions to the problem, the proposed formulations sequence sets of cutting patterns instead of sequencing the cutting patterns individually, thus, the search space for solutions is reduced. A set of randomly generated instances for the two-dimensional problem is used to perform computational experiments in order to validate the proposed mathematical formulations.
- 26 January 2023
- Published by Elsevier in Computers & Operations Research
- Vol. 153
Optimization of the cutting process integrated to the lot sizing in multi-plant paper production industries
- 26 January 2023
- Published by Elsevier in Computers & Operations Research
- Vol. 153
Optimization of the cutting process integrated to the lot sizing in multi-plant paper production industries
- Open Access
- 1 January 2022
- Published by FapUNIFESP (SciELO) in Pesquisa Operacional
- Vol. 42
A BI-OBJECTIVE MULTIPERIOD ONE-DIMENSIONAL CUTTING STOCK PROBLEM
- 1 January 2022
- Published by FapUNIFESP (SciELO) in Pesquisa Operacional
- Vol. 42
Open AccessA BI-OBJECTIVE MULTIPERIOD ONE-DIMENSIONAL CUTTING STOCK PROBLEM
- Open Access
- 1 January 2021
- Published by FapUNIFESP (SciELO) in Pesquisa Operacional
- Vol. 41 (spe)
LOT SIZING AND CUTTING STOCK PROBLEMS IN A PAPER PRODUCTION PROCESS
- 1 January 2021
- Published by FapUNIFESP (SciELO) in Pesquisa Operacional
- Vol. 41 (spe)
Open AccessLOT SIZING AND CUTTING STOCK PROBLEMS IN A PAPER PRODUCTION PROCESS
- Open Access
- 20 February 2020
- Published by Brazilian Society for Computational and Applied Mathematics (SBMAC)
- Vol. 7 (1)
O problema de corte de estoque associado ao problema de minimizar o número de pilhas abertas
Problemas de corte de estoque consistem em otimizar processos de corte de objetos maiores, disponı́veis em estoque, em itens menores para a produção de determinados produtos, de forma a atender a uma demanda solicitada. Durante o processo de corte, cada item diferente cortado gera uma pilha ao redor da máquina de corte. Neste trabalho, tratamos o problema de corte de estoque associado ao problema de minimizar o número de pilhas abertas. Apresentamos um modelo matemático, implementamos e realizamos testes computacionais para validação do modelo.
- 20 February 2020
- Published by Brazilian Society for Computational and Applied Mathematics (SBMAC)
- Vol. 7 (1)
Open AccessO problema de corte de estoque associado ao problema de minimizar o número de pilhas abertas
Problemas de corte de estoque consistem em otimizar processos de corte de objetos maiores, disponı́veis em estoque, em itens menores para a produção de determinados produtos, de forma a atender a uma demanda solicitada. Durante o processo de corte, cada item diferente cortado gera uma pilha ao redor da máquina de corte. Neste trabalho, tratamos o problema de corte de estoque associado ao problema de minimizar o número de pilhas abertas. Apresentamos um modelo matemático, implementamos e realizamos testes computacionais para validação do modelo.
- Open Access
- 1 December 2019
- Published by FapUNIFESP (SciELO) in Pesquisa Operacional
- Vol. 39 (3) , 471-496
CAPACITATED LOT SIZING AND SCHEDULING WITH ORDER ACCEPTANCE AND DELIVERY TIME WINDOWS: MATHEMATICAL MODEL AND A MIP-BASED HEURISTIC
This research addresses a lot sizing and scheduling problem inspired by a real-world production environment where the customers make advanced orders and the industry need to decide which orders will be accepted with the aim of maximizing the profit respecting the production capacity constraints. Orders are composed of different types of items which must be delivered within a given time interval and, moreover, such orders cannot be split. A mixed integer programming (MIP) model is proposed to represent the problem and a MIP-based heuristic is also proposed to deliver good solutions at an acceptable computational time. The heuristic is composed of three phases (construction, deterministic improvement and stochastic improvement phases) and combines relax-and-fix, fix-and-optimize, and iterative MIP based neighborhood search procedures. Computational tests are presented in order to study the efficiency of the proposed approaches.
- 1 December 2019
- Published by FapUNIFESP (SciELO) in Pesquisa Operacional
- Vol. 39 (3) , 471-496
Open AccessCAPACITATED LOT SIZING AND SCHEDULING WITH ORDER ACCEPTANCE AND DELIVERY TIME WINDOWS: MATHEMATICAL MODEL AND A MIP-BASED HEURISTIC
This research addresses a lot sizing and scheduling problem inspired by a real-world production environment where the customers make advanced orders and the industry need to decide which orders will be accepted with the aim of maximizing the profit respecting the production capacity constraints. Orders are composed of different types of items which must be delivered within a given time interval and, moreover, such orders cannot be split. A mixed integer programming (MIP) model is proposed to represent the problem and a MIP-based heuristic is also proposed to deliver good solutions at an acceptable computational time. The heuristic is composed of three phases (construction, deterministic improvement and stochastic improvement phases) and combines relax-and-fix, fix-and-optimize, and iterative MIP based neighborhood search procedures. Computational tests are presented in order to study the efficiency of the proposed approaches.