Bruno A. Prata

Orcid: 0000-0002-3920-089X

According to our database1, Bruno A. Prata authored at least 21 papers between 2008 and 2025.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

2008
2010
2012
2014
2016
2018
2020
2022
2024
0
1
2
3
4
5
6
7
2
2
5
6
3
2
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
A speed-up procedure and new heuristics for the classical job shop scheduling problem: A computational evaluation.
Eur. J. Oper. Res., 2025

A systematic review of permutation flow shop scheduling with due-date-related objectives.
Comput. Oper. Res., 2025

2024
A genetic iterated greedy algorithm for the blocking flowshop to minimize total earliness and tardiness.
J. Intell. Manuf., June, 2024

A Scheduler for Smart Home Appliances Based on a Novel Concept of Tariff Space.
Sensors, March, 2024

2023
The Seeds of the NEH Algorithm: An Overview Using Bibliometric Analysis.
Oper. Res. Forum, December, 2023

A new two-stage constraint programming approach for open shop scheduling problem with machine blocking.
Int. J. Prod. Res., December, 2023

A constraint programming-based iterated greedy algorithm for the open shop with sequence-dependent processing times and makespan minimization.
Comput. Oper. Res., December, 2023

Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window.
Comput. Oper. Res., May, 2023

Demand response application in industrial scenarios: A systematic mapping of practical implementation.
Expert Syst. Appl., April, 2023

2022
A novel BRKGA for the customer order scheduling with missing operations to minimize total tardiness.
Swarm Evol. Comput., 2022

Hybrid matheuristics for the multi-capacitated clustering problem.
RAIRO Oper. Res., 2022

A differential evolution algorithm for the customer order scheduling problem with sequence-dependent setup times.
Expert Syst. Appl., 2022

Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness.
Comput. Oper. Res., 2022

New efficient heuristics for scheduling open shops with makespan minimization.
Comput. Oper. Res., 2022

A critical-path based iterated local search for the green permutation flowshop problem.
Comput. Ind. Eng., 2022

2021
The integrated cutting and packing heterogeneous precast beams multiperiod production planning problem.
RAIRO Oper. Res., 2021

Variable fixing heuristics for solving multiple depot vehicle scheduling problem with heterogeneous fleet and time windows.
Optim. Lett., 2021

Customer order scheduling problem to minimize makespan with sequence-dependent setup times.
Comput. Ind. Eng., 2021

2020
Integrated Cutting and Packing Heterogeneous Precast Beams Multiperiod Production Planning Problem.
CoRR, 2020

A genetic algorithm for scheduling open shops with sequence-dependent setup times.
Comput. Oper. Res., 2020

2008
A stochastic colored petri net model to allocate equipments for earth moving operations.
J. Inf. Technol. Constr., 2008


  Loading...