Débora P. Ronconi

According to our database1, Débora P. Ronconi authored at least 24 papers between 1999 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 


Online presence:

On csauthors.net:


The multiperiod two-dimensional non-guillotine cutting stock problem with usable leftovers.
Int. Trans. Oper. Res., 2020

Metaheuristics for the Online Printing Shop Scheduling Problem.
CoRR, 2020

Mixed Integer linear programming and constraint programming models for the online printing shop scheduling problem.
Comput. Oper. Res., 2020

A filtered beam search method for the <i>m</i>-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs.
Comput. Oper. Res., 2020

Mixed Integer Linear Programming Models for Scheduling Elective Surgical Procedures.
Proceedings of the Computational Science and Its Applications - ICCSA 2020, 2020

Optimization of the Use of Critical Resources in the Development of Offshore Oil Fields.
Proceedings of the Computational Science and Its Applications - ICCSA 2020, 2020

Metaheuristic Approaches for the Fleet Size and Mix Vehicle Routing Problem with Time Windows and Step Cost Functions.
Proceedings of the Computational Logistics - 11th International Conference, 2020

A biased random key genetic algorithm for the field technician scheduling problem.
Comput. Oper. Res., 2016

Metaheuristics for large-scale instances of the linear ordering problem.
Expert Syst. Appl., 2015

List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility.
Eur. J. Oper. Res., 2015

A MILP model for an extended version of the Flexible Job Shop Problem.
Optim. Lett., 2014

MIP models for two-dimensional non-guillotine cutting problems with usable leftovers.
J. Oper. Res. Soc., 2014

New heuristics for total tardiness minimization in a flexible flowshop.
Optim. Lett., 2013

Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming.
J. Sched., 2010

Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date.
Comput. Oper. Res., 2009

Method of sentinels for packing items within arbitrary convex regions.
J. Oper. Res. Soc., 2006

Optimizing transportation and storage of final products in the sugar and ethanol industry: a case study.
Int. Trans. Oper. Res., 2006

Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization.
Comput. Oper. Res., 2006

Minimizing earliness and tardiness penalties in a single-machine problem with a common due date.
Eur. J. Oper. Res., 2005

Optimizing the packing of cylinders into a rectangular container: A nonlinear approach.
Eur. J. Oper. Res., 2005

A Branch-and-Bound Algorithm to Minimize the Makespan in a Flowshop with Blocking.
Ann. Oper. Res., 2005

Minimization subproblems and heuristics for an applied clustering problem.
Eur. J. Oper. Res., 2003

Lower bounding schemes for flowshops with blocking in-process.
J. Oper. Res. Soc., 2001

Tabu search for total tardiness minimization in flowshop scheduling problems.
Comput. Oper. Res., 1999