Johann Hurink, Sigrid Knust Makespan minimization for flow-shop problems with transportation times and a single robot. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2001, v:112, n:1-3, pp:199-216 [Journal]
Johann Hurink, Sigrid Knust A tabu search algorithm for scheduling a single robot in a job-shop environment. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2002, v:119, n:1-2, pp:181-203 [Journal]
Johann Hurink, Sigrid Knust List scheduling in a parallel machine environment with precedence constraints and setup times. [Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2001, v:29, n:5, pp:231-239 [Journal]
Johann Hurink, Sigrid Knust Tabu search algorithms for job-shop problems with a single transport robot. [Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2005, v:162, n:1, pp:99-111 [Journal]