Jelke J. van Hoorn
Jelke J. van Hoorn
Ortec
Dirección de correo verificada de ortec.com
Título
Citado por
Citado por
Año
Restricted dynamic programming: a flexible framework for solving realistic VRPs
J Gromicho, JJ van Hoorn, AL Kok, JMJ Schutten
Computers & operations research 39 (5), 902-909, 2012
722012
Solving the job-shop scheduling problem optimally by dynamic programming
JAS Gromicho, JJ Van Hoorn, F Saldanha-da-Gama, GT Timmer
Computers & Operations Research 39 (12), 2968-2977, 2012
562012
The Current state of bounds on benchmark instances of the job-shop scheduling problem
JJ van Hoorn
Journal of Scheduling 21 (1), 127-128, 2018
172018
The flexibility of restricted dynamic programming for the VRP
J Gromicho, J van Hoorn, AL Kok, JMJ Schutten
Beta Working Paper Series 266, 1-20, 2008
122008
Tackling a VRP challenge to redistribute scarce equipment within time windows using metaheuristic algorithms
A Kheiri, AG Dragomir, D Mueller, J Gromicho, C Jagtenberg, ...
EURO Journal on Transportation and Logistics 8 (5), 561-595, 2019
72019
Dynamic programming for routing and scheduling: Optimizing sequences of decisions
JJ van Hoorn
Amsterdam: Vrije Universiteit, 2016
62016
Exponentially better than brute force: solving the jobshop scheduling problem optimally by dynamic programming
JAS Gromicho, JJ van Hoorn, GT Timmer
VU University Amsterdam, Faculty of Economics, Business Administration and …, 2009
62009
An corrigendum on the paper: Solving the job-shop scheduling problem optimally by dynamic programming (Computers and Operations Research (2012) 39 (12)(2968–2977 …
JJ van Hoorn, A Nogueira, I Ojea, JAG Dos Santos
Computers and Operations Research 78, 381, 2017
42017
The VeRoLog solver challenge 2016–2017
W Dullaert, J Gromicho, J van Hoorn, G Post, D Vigo
Journal on Vehicle Routing Algorithms 1 (1), 69-71, 2018
32018
Vehicle routing with restricted loading capacities
J Gromicho, JJ van Hoorn, AL Kok, JMJ Schutten
BETA working papers, 2012
32012
A note on the worst case complexity for the capacitated vehicle routing problem
JJ van Hoorn
Faculteit der Economische Wetenschappen en Bedrijfskunde, 2010
22010
A note on the paper: Solving the job-shop scheduling problem optimally by dynamic programming
JJ van Hoorn, A Nogueira, I Ojea, JAS Gromicho
Faculty of Economics and Business Administration, 2015
12015
Dynamic Programming for Routing and Scheduling
JJ van Hoorn
1
Solving the job-shop scheduling problem optimally by dynamic programming (vol 39, pg 2968, 2012)
JJ van Hoorn, A Nogueira, I Ojea, JAS Gromicho
COMPUTERS & OPERATIONS RESEARCH 78, 381-381, 2017
2017
Exponentially better than brute force: Solving the job-shop scheduling problem optimally by dynamic programming
JAG Dos Santos, JJ van Hoorn, F Saldanha-da-Gama, GT Timmer
2009
Exponentially better than brute force: Solving the job-shop scheduling problem optimally by dynamic programming
JA Gromicho Dos Santos, JJ van Hoorn, F Saldanha-da-Gama, ...
Faculteit der Economische Wetenschappen en Bedrijfskunde Research Memorandum, 2009
2009
Joaquim AS Gromicho
JJ van Hoorn, F Saldanha-da-Gama, GT Timmer
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–17