EEMCS

Hurink, J.L. and Knust, S. (2005) Tabu search algorithms for job-shop problems with a single transport robot. European journal of operational research, 162 (1). pp. 99-111. ISSN 0377-2217 *** ISI Impact 2,158 ***

Brucker, P. and Hurink, J.L. and Knust, S. (2003) A polynomial algorithm for . Mathematical methods of operations research, 56 (3). pp. 407-412. ISSN 1432-2994 *** ISI Impact 0,848 ***

Hurink, J.L. and Knust, S. (2002) A tabu search algorithm for scheduling a single robot in a job-shop environment. Discrete applied mathematics, 119 (1-2). pp. 181-203. ISSN 0166-218X *** ISI Impact 0,822 ***

Brucker, P. and Hurink, J.L. and Knust, S. (2001) A polynomial algorithm for and . Memorandum 1566, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690

Hurink, J.L. and Knust, S. (2001)
Tabu search algorithms for job-shop problems with a single transport robot. Memorandum 1579, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690

Hurink, J.L. and Knust, S. (2001) List scheduling in a parallel machine environment with precedence constraints and setup times. Operations Research Letters, 29 (5). pp. 231-239. ISSN 0167-6377 *** ISI Impact 0,739 ***

Hurink, J.L. and Knust, S. (2001) Makespan minimization for flow-shop problems with transportation times and a single robot. Discrete Applied Mathematics, 112 (1-3). pp. 199-216. ISSN 0166-218X *** ISI Impact 0,822 ***

Hurink, J.L. and Knust, S. (2000)
List scheduling in a parallel machine environment with precedence constraints and setup times. Memorandum 1525, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690

Hurink, J.L. and Knust, S. (1999)
A tabu search algorithm for scheduling a single robot in a job-shop environment. Memorandum 1496, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690