| Publication | Date of Publication | Type |
|---|
More powerful energetic reasoning for the cumulative scheduling problem
Discrete Applied Mathematics | 2025-11-04 | Paper |
FPT implicit enumeration of active schedules
Discrete Applied Mathematics | 2025-09-16 | Paper |
Comparison of three classical lower bounds for the parallel machines scheduling problem
RAIRO. Operations Research | 2025-07-17 | Paper |
Algorithms to compute the energetic lower bounds of the cumulative scheduling problem
Annals of Operations Research | 2024-07-30 | Paper |
A data structure for efficiently managing a set of energy functions
Journal of Combinatorial Optimization | 2022-10-18 | Paper |
An O(n^2) algorithm for time-bound adjustments for the cumulative scheduling problem
European Journal of Operational Research | 2020-05-27 | Paper |
Robust routing in deterministic delay-tolerant networks
Computers & Operations Research | 2018-07-12 | Paper |
A constraint-programming-based approach for solving the data dissemination problem
Computers & Operations Research | 2018-07-11 | Paper |
Modeling elements and solving techniques for the data dissemination problem
European Journal of Operational Research | 2018-05-24 | Paper |
Macroscopic evacuation plans for natural disasters. A lexicographical approach for duration and safety criteria: \(\mathrm{Lex}((Q|S)\mathrm{Flow})\)
OR Spectrum | 2017-07-06 | Paper |
The data transfer problem in a system of systems
European Journal of Operational Research | 2016-10-06 | Paper |
Timetabling of sorting slots in a logistic warehouse
Annals of Operations Research | 2016-05-18 | Paper |
Single-machine scheduling with no idle time and release dates to~minimize a regular criterion
Journal of Scheduling | 2014-02-05 | Paper |
A multi-period renewal equipment problem
European Journal of Operational Research | 2012-08-16 | Paper |
Dominance rules in combinatorial optimization problems
European Journal of Operational Research | 2012-05-14 | Paper |
Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates
Computers & Operations Research | 2011-03-25 | Paper |
Hybrid flow-shop: a memetic algorithm using constraint-based scheduling for efficient search
JMMA. Journal of Mathematical Modelling and Algorithms | 2010-02-01 | Paper |
Lower bounds for parallel machine scheduling problems
International Journal of Operational Research | 2008-10-02 | Paper |
A new lower bound for the non-oriented two-dimensional bin-packing problem
Operations Research Letters | 2008-01-21 | Paper |
A new constraint programming approach for the orthogonal packing problem
Computers & Operations Research | 2007-10-19 | Paper |
Dominance-based heuristics for one-machine total cost scheduling problems
European Journal of Operational Research | 2007-10-10 | Paper |
A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates
European Journal of Operational Research | 2004-08-10 | Paper |
On minimizing total tardiness in a serial batching problem
RAIRO. Operations Research | 2002-08-25 | Paper |
On minimizing total tardiness in a serial batching problem
RAIRO. Operations Research | 2002-08-25 | Paper |
On minimizing total tardiness in a serial batching problem
RAIRO. Operations Research | 2002-08-25 | Paper |
