Jose Eduardo Pécora Jr

Dr. Jose Eduardo Pécora Jr

orcid

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 March 2019 in Computers & Industrial Engineering
Verified
Journal Article
Closed access
NSNathália Cristina Ortiz da Silva
Nathália Cristina Ortiz da Silva
CSCassius Tadeu Scarpin
Cassius Tadeu Scarpin
JJJose Eduardo Pécora Jr
Jose Eduardo Pécora Jr
Angel RuizAngel Ruiz
Angel Ruiz

1 September 2020 in Computers & Operations Research
Verified
Journal Article
Closed access
CSCleder M. Schenekemberg
Cleder M. Schenekemberg
CSCassius T. Scarpin
Cassius T. Scarpin
JJJose Eduardo Pécora Jr
Jose Eduardo Pécora Jr
TGThiago André Guimarães
Thiago André Guimarães
LCLeandro C. Coelho
Leandro C. Coelho

1 January 2021 in Omega
Verified
Journal Article
Closed access
TSTamires de Almeida Sfeir
Tamires de Almeida Sfeir
JJJose Eduardo Pécora Jr
Jose Eduardo Pécora Jr
Angel RuizAngel Ruiz
Angel Ruiz
LLLuc LeBel
Luc LeBel

1 January 2019 in Mathematical Problems in Engineering
Verified
Journal Article
Open access
PDF file
GBGuilherme V. Batista
Guilherme V. Batista
CSCassius T. Scarpin
Cassius T. Scarpin
JJJose Eduardo Pécora Jr
Jose Eduardo Pécora Jr
Angel RuizAngel Ruiz
Angel Ruiz
This paper describes a variant of the Periodic Capacitated Arc Routing Problem for inspections in a railroad network. Inspections are performed by vehicles over a time horizon on which some stretches need evaluation more frequently than others due to its use. Each car can evaluate one stretch per day without being attached to a depot; at each day, the shift may start and end at different locations. This characterizes the problem as the Periodic Capacitated Arc Routing Problem with Continuous Moves in which firstly the delays on attendances are minimized and, second, the displacement costs. We present a mathematical model and an Ant Colony Optimization algorithm to solve the problem. The use of a local search procedure and some principles of Granular Tabu Search is crucial for the algorithm’s performance. The numerical results are promising, especially for critical situations where the arcs’ needs are close to the total vehicles’ capacity.

13 March 2024 in Sustainability
Verified
Journal Article
Open access
PDF file
LRLeticya Hilario Raddi-Mira
Leticya Hilario Raddi-Mira
JJJose Eduardo Pécora Jr
Jose Eduardo Pécora Jr
FDFernando Deschamps
Fernando Deschamps
This paper presents a structured framework for implementing Industry 4.0 projects. The framework is developed through an extensive review of the existing literature, wherein potential challenges and success factors related to adopting disruptive technologies in such projects are systematically analyzed and categorized. Additionally, the authors introduce a semi-structured questionnaire tailored for interviews with key decision-makers in companies strategically pursuing digital transformation. This questionnaire is designed to elicit valuable insights based on the experiences and perspectives of these decision-makers. The resulting framework is synthesized from the interviews and literature review. It delineates the essential steps necessary for the effective implementation of Industry 4.0 projects, focusing on establishing strategic priorities as the foundational stage of the entire process.

6 February 2023 in Journal of the Operational Research Society
Verified
Journal Article
Closed access
TGThiago André Guimarães
Thiago André Guimarães
CSCleder M. Schenekemberg
Cleder M. Schenekemberg
LCLeandro C. Coelho
Leandro C. Coelho
CSCassius T. Scarpin
Cassius T. Scarpin
JJJose Eduardo Pécora Jr
Jose Eduardo Pécora Jr
Inventory-routing problems (IRPs) define a class of combinatorial optimization problems, encompassing inventory management and vehicle routing decisions into the same framework. In this article, we propose a new modular mechanism capable of recovering feasibility and improving even partial solutions by reorganizing delivery routes and optimizing inventory flows. It can be embedded into different optimization algorithms, either heuristic or exact ones. We exploit the use of this mechanism to improve a traditional branch-and-cut scheme and evaluate it by solving the multi-vehicle IRP (MIRP) and the multi-depot IRP (MDIRP). The results show that our method is very effective; outperforming other approaches on well-known benchmark instances from the literature. Regarding the MIRP, our algorithm obtains 417 optimal solutions for 638 small instances, the best result among all exact algorithms, with nine new ones. On a large data set, our method finds all optimal solutions for instances with up to 50 customers for the single-vehicle, besides providing 90% of new best-known solutions (BKS) for 100 customers. On the MDIRP, our approach finds 27 new optimal solutions and 73% of new BKS, improving previous BKS by more than 7% on average.