Raf Jans

Orcid: 0000-0001-8510-5677

According to our database1, Raf Jans authored at least 37 papers between 2002 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A heuristic algorithm to solve the one-warehouse multiretailer problem with an emission constraint.
Int. Trans. Oper. Res., March, 2024

Service-level-driven procurement and production lot-sizing problem with demand fulfilment.
Int. J. Prod. Res., March, 2024

A heuristic approach for the integrated production-transportation problem with process flexibility.
Comput. Oper. Res., March, 2024

Split demand and deliveries in an integrated three-level lot sizing and replenishment problem.
Comput. Oper. Res., January, 2024

A progressive hedging-based matheuristic for the stochastic production routing problem with adaptive routing.
Comput. Oper. Res., 2024

2022
The consistent production routing problem.
Networks, 2022

Logic-Based Benders Decomposition for Integrated Process Configuration and Production Planning Problems.
INFORMS J. Comput., 2022

2021
Benders decomposition for a stochastic three-level lot sizing and replenishment problem with a distribution structure.
Eur. J. Oper. Res., 2021

Integrated lot sizing and blending problems.
Comput. Oper. Res., 2021

2020
A branch-and-cut algorithm for an assembly routing problem.
Eur. J. Oper. Res., 2020

Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products.
Eur. J. Oper. Res., 2020

2019
A Unified Decomposition Matheuristic for Assembly, Production, and Inventory Routing.
INFORMS J. Comput., 2019

A capacitated lot sizing problem with stochastic setup times and overtime.
Eur. J. Oper. Res., 2019

An exact optimization approach for an integrated process configuration, lot-sizing, and scheduling problem.
Comput. Oper. Res., 2019

A comparison of formulations for a three-level lot sizing and replenishment problem with a distribution structure.
Comput. Oper. Res., 2019

2018
Classification and literature review of integrated lot-sizing and cutting stock problems.
Eur. J. Oper. Res., 2018

Symmetry breaking in mixed integer linear programming formulations for blocking two-level orthogonal experimental designs.
Comput. Oper. Res., 2018

A decomposition heuristic for a rich production routing problem.
Comput. Oper. Res., 2018

2017
Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem.
INFORMS J. Comput., 2017

An analysis of formulations for the capacitated lot sizing problem with setup crossover.
Comput. Ind. Eng., 2017

2015
Benders Decomposition for Production Routing Under Demand Uncertainty.
Oper. Res., 2015

Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times.
INFORMS J. Comput., 2015

The economic lot-sizing problem with an emission capacity constraint.
Eur. J. Oper. Res., 2015

Hybrid methods for lot sizing on parallel machines.
Comput. Oper. Res., 2015

The production routing problem: A review of formulations and solution algorithms.
Comput. Oper. Res., 2015

2014
Optimization-Based Adaptive Large Neighborhood Search for the Production Routing Problem.
Transp. Sci., 2014

Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems.
INFORMS J. Comput., 2014

2013
Efficient symmetry breaking formulations for the job grouping problem.
Comput. Oper. Res., 2013

2010
A review of applications of genetic algorithms in lot sizing.
J. Intell. Manuf., 2010

Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems.
Eur. J. Oper. Res., 2010

2009
Solving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints.
INFORMS J. Comput., 2009

2008
Analysis of an industrial component commonality problem.
Eur. J. Oper. Res., 2008

A note on a symmetrical set covering problem: The lottery problem.
Eur. J. Oper. Res., 2008

2007
A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times.
Oper. Res., 2007

Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches.
Eur. J. Oper. Res., 2007

2004
Improved lower bounds for the capacitated lot sizing problem with setup times.
Oper. Res. Lett., 2004

2002
Alternative formulations for a layout problem in the fashion industry.
Eur. J. Oper. Res., 2002


  Loading...