| Publication | Date of Publication | Type |
|---|
The multiperiod two‐dimensional non‐guillotine cutting stock problem with usable leftovers
International Transactions in Operational Research | 2023-11-17 | Paper |
Relax-and-fix heuristics applied to a real-world lot sizing and scheduling problem in the personal care consumer goods industry
SN Operations Research Forum | 2023-08-08 | Paper |
Step cost functions in a fleet size and mix vehicle routing problem with time windows
Annals of Operations Research | 2022-09-26 | Paper |
| A forward-looking matheuristic approach for the multi-period two-dimensional non-guillotine cutting stock problem with usable leftovers | 2021-07-25 | Paper |
Metaheuristics for the online printing shop scheduling problem
European Journal of Operational Research | 2021-06-07 | Paper |
Mixed integer linear programming and constraint programming models for the online printing shop scheduling problem
Computers & Operations Research | 2021-04-20 | Paper |
A filtered beam search method for the \(m\)-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs
Computers & Operations Research | 2019-11-19 | Paper |
Mixed-Integer Programming Models for Flowshop Scheduling Problems Minimizing the Total Earliness and Tardiness
Just-in-Time Systems | 2017-02-03 | Paper |
A biased random key genetic algorithm for the field Technician scheduling problem
Computers & Operations Research | 2016-11-17 | Paper |
List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility
European Journal of Operational Research | 2016-10-06 | Paper |
A MILP model for an extended version of the flexible job shop problem
Optimization Letters | 2014-04-30 | Paper |
New heuristics for total tardiness minimization in a flexible flowshop
Optimization Letters | 2013-04-23 | Paper |
Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming
Journal of Scheduling | 2011-04-01 | Paper |
The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm
Computational and Applied Mathematics | 2010-09-22 | Paper |
Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date
Computers & Operations Research | 2008-10-08 | Paper |
Optimizing transportation and storage of final products in the sugar and ethanol industry: a case study
International Transactions in Operational Research | 2007-02-13 | Paper |
Method of sentinels for packing items within arbitrary convex regions
The Journal of the Operational Research Society | 2007-01-26 | Paper |
Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization
Computers & Operations Research | 2006-06-30 | Paper |
A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking
Annals of Operations Research | 2006-03-07 | Paper |
Lower bounding schemes for flowshops with blocking in-process
The Journal of the Operational Research Society | 2005-03-16 | Paper |
Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
European Journal of Operational Research | 2004-11-22 | Paper |
Minimizing earliness and tardiness penalties in a single-machine problem with a common due date
European Journal of Operational Research | 2004-11-22 | Paper |
Minimization subproblems and heuristics for an applied clustering problem
European Journal of Operational Research | 2003-04-10 | Paper |
Minimizing Total Tardiness: A Case Study in an Autoparts Factory
International Transactions in Operational Research | 2002-09-30 | Paper |
Tabu search for total tardiness minimization in flowshop scheduling problems
Computers & Operations Research | 2000-11-08 | Paper |
Models, constructive heuristics, and benchmark instances for the flexible job shop scheduling problem with sequencing flexibility and position-based learning effect
(available as arXiv preprint) | N/A | Paper |
Local search and trajectory metaheuristics for the flexible job shop scheduling problem with sequencing flexibility and position-based learning effect
(available as arXiv preprint) | N/A | Paper |
