Restricted dynamic programming: A flexible framework for solving realistic VRPs. - Joaquim A. S. Gromicho; Jelke J. van Hoorn; A. L. Kok; J. M. J. Schutten (Comput. Oper. Res., 2012)

Solving the job-shop scheduling problem optimally by dynamic programming. - Joaquim A. S. Gromicho; Jelke J. van Hoorn; Francisco Saldanha-da-Gama; Gerrit T. Timmer (Comput. Oper. Res., 2012)

An corrigendum on the paper: Solving the job-shop scheduling problem optimally by dynamic programming. - Jelke J. van Hoorn; Agustín Nogueira; Ignacio Ojea; Joaquim A. S. Gromicho (Comput. Oper. Res., 2017)

The Current state of bounds on benchmark instances of the job-shop scheduling problem. - Jelke J. van Hoorn (J. Sched., 2018)

Tackling a VRP challenge to redistribute scarce equipment within time windows using metaheuristic algorithms. - Ahmed Kheiri; Alina G. Dragomir; David Mueller; Joaquim A. S. Gromicho; Caroline J. Jagtenberg; Jelke J. van Hoorn (EURO J. Transp. Logist., 2019)