default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRaf Jans
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j37]Matthieu Gruson
, Jean-François Cordeau, Raf Jans:
Split demand and deliveries in an integrated three-level lot sizing and replenishment problem. Comput. Oper. Res. 161: 106434 (2024)- [j36]Desiree Maldonado Carvalho, Raf Jans, Silvio A. de Araujo, Diego Jacinto Fiorotto:
A heuristic approach for the integrated production-transportation problem with process flexibility. Comput. Oper. Res. 163: 106502 (2024) - [j35]Ali Kermani, Jean-François Cordeau, Raf Jans:
A progressive hedging-based matheuristic for the stochastic production routing problem with adaptive routing. Comput. Oper. Res. 169: 106745 (2024) - [j34]Caio Paziani Tomazella, Maristela Oliveira Santos, Douglas José Alem, Raf Jans:
Service-level-driven procurement and production lot-sizing problem with demand fulfilment. Int. J. Prod. Res. 62(6): 1977-1998 (2024) - [j33]Matthieu Gruson, Qihua Zhong, Ola Jabali, Raf Jans:
A heuristic algorithm to solve the one-warehouse multiretailer problem with an emission constraint. Int. Trans. Oper. Res. 31(2): 629-657 (2024) - 2022
- [j32]Karim Y. P. Martínez, Yossiri Adulyasak, Raf Jans:
Logic-Based Benders Decomposition for Integrated Process Configuration and Production Planning Problems. INFORMS J. Comput. 34(4): 2177-2191 (2022) - [j31]Aldair Alvarez, Jean-François Cordeau, Raf Jans:
The consistent production routing problem. Networks 80(3): 356-381 (2022) - 2021
- [j30]Diego Jacinto Fiorotto, Raf Jans, Silvio Alexandre de Araujo:
Integrated lot sizing and blending problems. Comput. Oper. Res. 131: 105255 (2021) - [j29]Matthieu Gruson, Jean-François Cordeau, Raf Jans:
Benders decomposition for a stochastic three-level lot sizing and replenishment problem with a distribution structure. Eur. J. Oper. Res. 291(1): 206-217 (2021) - 2020
- [j28]Masoud Chitsaz, Jean-François Cordeau, Raf Jans:
A branch-and-cut algorithm for an assembly routing problem. Eur. J. Oper. Res. 282(3): 896-910 (2020) - [j27]Aldair Alvarez, Jean-François Cordeau, Raf Jans, Pedro Munari, Reinaldo Morabito:
Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products. Eur. J. Oper. Res. 283(2): 511-529 (2020)
2010 – 2019
- 2019
- [j26]Karim Y. P. Martínez, Yossiri Adulyasak, Raf Jans, Reinaldo Morabito, Eli Angela V. Toso:
An exact optimization approach for an integrated process configuration, lot-sizing, and scheduling problem. Comput. Oper. Res. 103: 310-323 (2019) - [j25]Matthieu Gruson, Majid Bazrafshan, Jean-François Cordeau, Raf Jans:
A comparison of formulations for a three-level lot sizing and replenishment problem with a distribution structure. Comput. Oper. Res. 111: 297-310 (2019) - [j24]Duygu Tas, Michel Gendreau, Ola Jabali, Raf Jans:
A capacitated lot sizing problem with stochastic setup times and overtime. Eur. J. Oper. Res. 273(1): 146-159 (2019) - [j23]Masoud Chitsaz, Jean-François Cordeau, Raf Jans:
A Unified Decomposition Matheuristic for Assembly, Production, and Inventory Routing. INFORMS J. Comput. 31(1): 134-152 (2019) - 2018
- [j22]Nha Vo-Thanh, Raf Jans, Eric D. Schoen, Peter Goos:
Symmetry breaking in mixed integer linear programming formulations for blocking two-level orthogonal experimental designs. Comput. Oper. Res. 97: 96-110 (2018) - [j21]Pedro L. Miranda, Jean-François Cordeau, Deisemara Ferreira, Raf Jans, Reinaldo Morabito:
A decomposition heuristic for a rich production routing problem. Comput. Oper. Res. 98: 211-230 (2018) - [j20]Gislaine Mara Melega, Silvio Alexandre de Araujo, Raf Jans:
Classification and literature review of integrated lot-sizing and cutting stock problems. Eur. J. Oper. Res. 271(1): 1-19 (2018) - 2017
- [j19]Diego Jacinto Fiorotto, Raf Jans, Silvio Alexandre de Araujo:
An analysis of formulations for the capacitated lot sizing problem with setup crossover. Comput. Ind. Eng. 106: 338-350 (2017) - [j18]Tao Wu, Kerem Akartunali, Raf Jans, Zhe Liang:
Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem. INFORMS J. Comput. 29(3): 523-543 (2017) - 2015
- [j17]Yossiri Adulyasak, Jean-François Cordeau, Raf Jans:
The production routing problem: A review of formulations and solution algorithms. Comput. Oper. Res. 55: 141-152 (2015) - [j16]Diego Jacinto Fiorotto, Silvio Alexandre de Araujo, Raf Jans:
Hybrid methods for lot sizing on parallel machines. Comput. Oper. Res. 63: 136-148 (2015) - [j15]Mathijn J. Retel Helmrich, Raf Jans, Wilco van den Heuvel, Albert P. M. Wagelmans:
The economic lot-sizing problem with an emission capacity constraint. Eur. J. Oper. Res. 241(1): 50-62 (2015) - [j14]Silvio Alexandre de Araujo, Bert De Reyck, Zeger Degraeve, Ioannis Fragkos, Raf Jans:
Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times. INFORMS J. Comput. 27(3): 431-448 (2015) - [j13]Yossiri Adulyasak, Jean-François Cordeau, Raf Jans:
Benders Decomposition for Production Routing Under Demand Uncertainty. Oper. Res. 63(4): 851-867 (2015) - 2014
- [j12]Yossiri Adulyasak, Jean-François Cordeau, Raf Jans:
Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems. INFORMS J. Comput. 26(1): 103-120 (2014) - [j11]Yossiri Adulyasak, Jean-François Cordeau, Raf Jans:
Optimization-Based Adaptive Large Neighborhood Search for the Production Routing Problem. Transp. Sci. 48(1): 20-45 (2014) - 2013
- [j10]Raf Jans, Jacques Desrosiers:
Efficient symmetry breaking formulations for the job grouping problem. Comput. Oper. Res. 40(4): 1132-1142 (2013) - 2010
- [j9]Raf Jans:
Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems. Eur. J. Oper. Res. 204(2): 251-254 (2010) - [j8]Hacer Güner Gören, Semra Tunali, Raf Jans:
A review of applications of genetic algorithms in lot sizing. J. Intell. Manuf. 21(4): 575-590 (2010)
2000 – 2009
- 2009
- [j7]Raf Jans:
Solving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints. INFORMS J. Comput. 21(1): 123-136 (2009) - 2008
- [j6]Raf Jans, Zeger Degraeve:
A note on a symmetrical set covering problem: The lottery problem. Eur. J. Oper. Res. 186(1): 104-110 (2008) - [j5]Raf Jans, Zeger Degraeve, Luc Schepens:
Analysis of an industrial component commonality problem. Eur. J. Oper. Res. 186(2): 801-811 (2008) - 2007
- [j4]Raf Jans, Zeger Degraeve:
Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches. Eur. J. Oper. Res. 177(3): 1855-1875 (2007) - [j3]Zeger Degraeve, Raf Jans:
A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times. Oper. Res. 55(5): 909-920 (2007) - 2004
- [j2]Raf Jans, Zeger Degraeve:
Improved lower bounds for the capacitated lot sizing problem with setup times. Oper. Res. Lett. 32(2): 185-195 (2004) - 2002
- [j1]Zeger Degraeve, Willy Gochet, Raf Jans:
Alternative formulations for a layout problem in the fashion industry. Eur. J. Oper. Res. 143(1): 80-93 (2002)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:15 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
