| Publication | Date of Publication | Type |
|---|
Scheduling with assignable due dates, two competing agents and late work related criteria
Computers & Operations Research | 2025-09-10 | Paper |
Reactive scheduling of uncertain jobs with maximum time lags
European Journal of Operational Research | 2025-09-10 | Paper |
Facet separation for disjunctive constraints with network flow representation
Annals of Operations Research | 2024-11-27 | Paper |
An online joint replenishment problem combined with single machine scheduling
Journal of Combinatorial Optimization | 2023-08-02 | Paper |
Robust facility location in reverse logistics
Annals of Operations Research | 2023-07-13 | Paper |
Joint replenishment meets scheduling
Journal of Scheduling | 2023-06-23 | Paper |
Ideal, non-extended formulations for disjunctive constraints admitting a network representation
Mathematical Programming. Series A. Series B | 2022-06-29 | Paper |
Assembly planning by disjunctive programming and geometrical reasoning
Computers & Operations Research | 2022-03-09 | Paper |
A project scheduling problem with periodically aggregated resource-constraints
Computers & Operations Research | 2022-03-09 | Paper |
New complexity and approximability results for minimizing the total weighted completion time on a single machine subject to non-renewable resource constraints
Discrete Applied Mathematics | 2022-03-04 | Paper |
Strong cuts from compatibility relations for the dial-a-ride problem
Discrete Applied Mathematics | 2022-01-13 | Paper |
Polyhedral results and branch-and-cut for the resource loading problem
INFORMS Journal on Computing | 2021-06-23 | Paper |
A common approximation framework for early work, late work, and resource leveling problems
European Journal of Operational Research | 2020-05-27 | Paper |
Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints
Journal of Scheduling | 2020-02-12 | Paper |
Polyhedral results for position-based scheduling of chains on a single machine
Annals of Operations Research | 2020-01-20 | Paper |
Polyhedral results and valid inequalities for the continuous energy-constrained scheduling problem
Discrete Applied Mathematics | 2019-03-22 | Paper |
Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price
CEJOR. Central European Journal of Operations Research | 2019-02-15 | Paper |
A probabilistic approach to pickup and delivery problems with time window uncertainty
European Journal of Operational Research | 2019-01-09 | Paper |
Approximability of total weighted completion time with resource consuming jobs
Operations Research Letters | 2018-09-28 | Paper |
Erratum to ``Intersection cuts -- standard versus restricted
Discrete Optimization | 2018-08-17 | Paper |
Multi-criteria approximation schemes for the resource constrained shortest path problem
Optimization Letters | 2018-05-28 | Paper |
Intersection cuts -- standard versus restricted
Discrete Optimization | 2018-05-24 | Paper |
Approximation schemes for parallel machine scheduling with non-renewable resources
European Journal of Operational Research | 2018-02-16 | Paper |
On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts
Mathematical Programming. Series A. Series B | 2016-11-25 | Paper |
Solving resource constrained shortest path problems with LP-based methods
Computers & Operations Research | 2016-11-17 | Paper |
Approximability of scheduling problems with resource consuming jobs
Annals of Operations Research | 2016-03-09 | Paper |
Lift-and-project for general two-term disjunctions
Discrete Optimization | 2015-04-09 | Paper |
Reductions between scheduling problems with non-renewable resources and knapsack problems
Theoretical Computer Science | 2014-12-22 | Paper |
Approximation schemes for single machine scheduling with non-renewable resource constraints
Journal of Scheduling | 2014-08-18 | Paper |
Exact solution approaches for bilevel lot-sizing
European Journal of Operational Research | 2014-07-27 | Paper |
Scheduling of inventory releasing jobs to minimize a regular objective function of delivery times
Journal of Scheduling | 2014-02-05 | Paper |
Lifting Gomory cuts with bounded variables
Operations Research Letters | 2013-05-14 | Paper |
A cutting plane approach for integrated planning and scheduling
Computers & Operations Research | 2012-11-15 | Paper |
On bilevel machine scheduling problems
OR Spectrum | 2012-05-23 | Paper |
Resource leveling in a machine environment
European Journal of Operational Research | 2012-05-14 | Paper |
Constraint programming approach to a bilevel scheduling problem
Constraints | 2011-11-23 | Paper |
A projective algorithm for preemptive open shop scheduling with two multiprocessor groups
Operations Research Letters | 2010-05-07 | Paper |
Scheduling multiprocessor UET tasks of two sizes
Theoretical Computer Science | 2009-11-06 | Paper |
Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications
Journal of Scheduling | 2009-08-28 | Paper |
Partitioning of trees for minimizing height and cardinality
Information Processing Letters | 2009-07-09 | Paper |
Computing lower and upper bounds for a large-scale industrial job shop scheduling problem
European Journal of Operational Research | 2009-04-08 | Paper |
Computing Tight Time Windows for RCPSPWET with the Primal-Dual Method
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems | 2009-03-10 | Paper |
Approximations and auctions for scheduling batches on related machines
Operations Research Letters | 2007-08-27 | Paper |
| RCPS with variable intensity activities and feeding precedence constraints | 2007-03-09 | Paper |
Polyhedral results on single node variable upper-bound flow models with allowed configurations
Discrete Optimization | 2007-02-20 | Paper |
A branch-and-cut algorithm for scheduling of projects with variable-intensity activities
Mathematical Programming. Series A. Series B | 2005-08-08 | Paper |
A review of exact solution methods for the non-preemptive multiprocessor flowshop problem
European Journal of Operational Research | 2005-03-08 | Paper |
On the complexity of the car sequencing problem.
Operations Research Letters | 2005-01-11 | Paper |
Job-shop scheduling with processing alternatives.
European Journal of Operational Research | 2003-10-14 | Paper |
A lower bound for the job insertion problem.
Discrete Applied Mathematics | 2003-06-10 | Paper |
Modelling and evaluating product end-of-life options
International Journal of Production Research | 2003-04-22 | Paper |
On the complexity of non-preemptive shop scheduling with two jobs
Computing | 2002-12-01 | Paper |
A cost function approximation method for dynamic vehicle routing with docking and LIFO constraints
(available as arXiv preprint) | N/A | Paper |
