| Erscheinungsdatum | Titel | Autor(en) |
| 1997 | A branch & bound algorithm for the open-shop problem | Brucker, P; Hurink, J; Jurisch, B; Wostmann, B |
| 1999 | A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags | Brucker, P; Hilbig, T; Hurink, J |
| 2003 | A polynomial algorithm for P vertical bar p(j)=1, r(j), outtree vertical bar Sigma C-j | Brucker, P; Hurink, J; Knust, S |
| 2002 | A tabu search algorithm for scheduling a single robot in a job-shop environment | Hurink, J; Knust, S |
| 2003 | Flow-shop problems with intermediate buffers | Brucker, P; Heitmann, S; Hurink, J |
| 2003 | How useful are preemptive schedules? | Brucker, P; Heitmann, S; Hurink, J |
| 1996 | Improving local search heuristics for some scheduling problems .1. | Brucker, P; Hurink, J; Werner, F |
| 1997 | Improving local search heuristics for some scheduling problems .2. | Brucker, P; Hurink, J; Werner, F |
| 2006 | Job-shop scheduling with limited capacity buffers | Brucker, P; Heitmann, S; Hurink, J; Nieberg, T |
| 2001 | List scheduling in a parallel machine environment with precedence constraints and setup times | Hurink, J; Knust, S |
| 2001 | Makespan minimization for flow-shop problems with transportation times and a single robot | Hurink, J; Knust, S |
| 1996 | Polygon scheduling | Hurink, J |
| 2003 | Routing of railway carriages | Brucker, P; Hurink, J; Rolfes, T |
| 1999 | Scheduling identical jobs with chain precedence constraints on two uniform machines | Brucker, P; Hurink, J; Kubiak, W |
| 2000 | Solving a chemical batch scheduling problem by local search | Brucker, P; Hurink, J |
| 2005 | Tabu search algorithms for job-shop problems with a single transport robot | Hurink, J; Knust, S |
HOCHSCHULBIBLIOGRAPHIE