1. Gruson, M., Cordeau, J.-F., Jans, R., 2019. Benders decomposition for a stochastic three-level lot sizing and replenishment problem with a distribution structure, Cahier du GERAD G-2019-51.
  2. Alvarez, A., Cordeau, J.-F., Jans, R., Munari, P., Morabito, R., 2018. Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products, Cahier du CIRRELT 2018-42.
  3. Chitsaz, M., Cordeau J.-F., Jans, R., 2018 A Branch-and-Cut Algorithm for an Assembly Routing Problem, Cahier du GERAD G-2018-49.
  4. Ioannis Fragkos, Jean-François Cordeau, Raf Jans, 2017. The multi-period multi-commodity network design problem, Cahier du CIRRELT 2017-63.

  1. Gruson, M., Bazrafshan, M., Cordeau, J.-F., Jans, R., 2019. A Comparison of Formulations for a Three-level Lot Sizing and Replenishment Problem with a Distribution Structure, Computers & Operations Research, 111, 297-310.
  2. Fabio Neves-Moreira, Bernardo Almada-Lobo, Jean-François Cordeau, Luis Guimaraes, Raf Jans, 2019. Solving a large multi-product production routing problem with delivery time windows, Omega, 86, 154-172.
  3. Chitsaz, M., Cordeau J.-F., Jans, R., 2019. A Unified Decomposition Matheuristic for Assembly, Production and Inventory Routing, INFORMS Journal on Computing, 31 (1), 134-142..
  4. Karim Pérez Martinez, Yossiri Adulyasak, Raf Jans, Reinaldo Morabito, Eli Angela Vitor Toso, 2019. An exact optimization approach for an integrated process configuration, lot-sizing and scheduling problem, Computers & Operations Research, 103, 310-323.
  5. Taş, D., Gendreau, M., Jabali, O., Jans, R., 2019. A Capacitated Lot Sizing Problem with Stochastic Setup Times and Overtime, European Journal of Operational Research, 273 (1), 146-159.
  6. Melega, G.M., de Araujo, S.A., Jans, R., 2018. Classification and Literature Review of Integrated Lot-Sizing and Cutting Stock Problems, European Journal of Operational Research, 271 (1), 1-19.
  7. Diego Fiorotto, Silvio de Araujo, Raf Jans, 2018. Process Flexibility and the Chaining Principle in Lot Sizing Problems, International Journal of Production Economics, 204, 244-263.
  8. Miranda, P., Cordeau, J.-F., Ferreira, D., Jans, R., Morabito, R., 2018. A decomposition heuristic for a rich production routing problem, Computers & Operations Research, 98, 211-230.
  9. Vo-Thanh, N., Jans, R., Schoen, E.D., Goos, P., 2018. Symmetry Breaking in Mixed Integer Linear Programming Formulations for Blocking Two-level Orthogonal Experimental Designs, Computers & Operations Research , 97, 96-110.
  10. Gruson, M., Cordeau, J.-F., Jans, R., 2018. The impact of service level constraints in deterministic lot sizing with backlogging Omega, 79, 91-103.
  11. Wu, T., Akartunali, K., Jans, R., Liang, Z., 2017. Progressive Selection Method for the Coupled Cutting-Stock and Lot-Sizing Problem, INFORMS Journal on Computing, 29 (3), 523-543.
  12. Fiorotto, D., Jans, R., de Araujo, S., 2017. An analysis of formulations for the lot sizing problem with setup crossover, Computers & Industrial Engineering, 106, 338-350.
  13. Melega, G.M., de Araujo, S., Jans, R., 2016. Comparison of MIP models for the integrated lot-sizing and one-dimensional cutting stock problem, Pesquisa Operacional, 36 (1), 167-196.
  14. Fiorotto, D., de Araujo, S., Jans, R., 2015. Hybrid methods for lot sizing on parallel machines, Computers & Operations Research., 63, 136-148.
  15. de Araujo, S., De Reyck, B., Degraeve, Z., Fragkos, I., Jans, R., 2015. Period Decomposition for the Capacity Constrained Lot Sizing Problem with Setup Times, INFORMS Journal on Computing, 27 (3), 431-448.
  16. Adulyasak, Y., Cordeau, J.-F., Jans, R. 2015. Benders Decomposition for Production Routing under Demand Uncertainty, Operations Research, 63 (4), 851-867.
  17. Adulyasak, Y., Cordeau, J.-F., Jans, R. 2015. The Production Routing Problem: A Review of Formulations and Solution Algorithms, Computers & Operations Research, 55, 141-152.
  18. Retel Helmrich, M., Jans, R., van den Heuvel, W., Wagelmans, A., 2015, Economic Lot Sizing with an emission capacity constraint, European Journal of Operational Research, 241 (1), 50-62.
  19. Adulyasak, Y., Cordeau, J.-F., Jans, R. 2014. Formulations and Branch-and-Cut algorithms for Multi-Vehicle Production and Inventory Routing Problems, INFORMS Journal on Computing, 26 (1), 103-120.
  20. Adulyasak, Y., Cordeau, J.F., Jans, R., 2014, Optimization Based Adaptive Large Neighborhood Search for the Production Routing Problem, Transportation Science, 48 (1), 20-45.
  21. Retel-Helmrich, M., Jans, R., van den Heuvel, W., Wagelmans, A., 2014, Economic Lot Sizing with remanufacturing: complexity and efficient reformulations, IIE Transactions, 46 (1), 67-86.
  22. Jans, R., Desrosiers, J., 2013. Efficient Symmetry-Breaking Formulations for the Job Grouping Problem, Computers & Operations Research, 40 (4), 1132-1142.
  23. Guner Goren, H., Tunali, S., Jans, R., 2012, A hybrid approach for the capacitated lot sizing problem with setup carry-over, International Journal of Production Research, 50 (6), 1582-1597.
  24. Jans, R., 2010, Classification of Dantzig-Wolfe Reformulations for Binary Mixed Integer Programming Problems, European Journal of Operational Research, 204, 251-254.
  25. Guner Goren, H., Tunali, S., Jans, R., 2010. A Review of Applications of Genetic Algorithms in Lotsizing, Journal of Intelligent Manufacturing , 21, 575-590.
  26. Jans, R., 2009, Solving Lotsizing Problems on Parallel Identical Machines Using Symmetry Breaking Constraints, INFORMS Journal on Computing 21 (1), 123-136.
  27. Jans, R., Degraeve, Z., 2008. Modeling Industrial Lot Sizing Problems: A Review, International Journal of Production Research, Vol. 46 (6), 1619-1643.
  28. Jans, R., Degraeve, Z., Schepens, L., 2008. Analysis of an Industrial Component Commonality Problem, European Journal of Operational Research, 186, 801-811.
  29. Jans, R., Degraeve, Z., 2008. Analysis of a symmetrical Set Covering problem: The lottery problem, European Journal of Operational Research, 186, 104-110.
  30. Degraeve, Z., Jans, R., 2007. A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot Sizing Problem with Set Up Times, Operations Research, Vol. 55 (5), 909-920.
  31. Jans, R., Degraeve, Z., 2007. Meta-heuristics for lot sizing problems: review and comparison of solution approaches, European Journal of Operational Research, Vol. 177, 1855-1875.
  32. Jans, R., Degraeve, Z., 2004. Improved Lower Bounds for Capacitated Lot Sizing Problems with Set Up Times. Operations Research Letters, Vol. 32, 185-195.
  33. Jans, R., Degraeve, Z., 2004. An Industrial Extension of the Discrete Lot Sizing and Scheduling Problem. IIE Transactions, Vol. 36 (1), 47-58.
  34. Degraeve, Z., Gochet, W., Jans, R., 2002. Alternative Formulations for a Layout Problem in the Fashion Industry. European Journal of Operational Research, Vol. 143, 80-93.