| Erscheinungsdatum | Titel | Autor(en) |
| 1998 | Batch scheduling with deadlines on parallel machines | Brucker, P; Kovalyov, MY; Shafransky, YM; Werner, F |
| 1997 | Complexity of scheduling problems with multi-purpose machines | Brucker, P; Jurisch, B; Kramer, A |
| 2004 | Complexity results for flow-shop and open-shop scheduling problems with transportation delays | Brucker, P; Knust, S ; Cheng, TCE; Shakhlevich, NV |
| 2005 | Complexity results for flow-shop problems with a single server | Brucker, P; Knust, S ; Wang, GQ |
| 2002 | Complexity results for parallel machine problems with a single server | Brucker, P; Dhaenens-Flipo, C; Knust, S ; Kravchenko, SA; Werner, F |
| 1999 | Complexity results for single-machine problems with positive finish-start time-lags | Brucker, P; Knust, S |
| 2000 | Editors' preface | Brucker, P; Drexl, A; Mohring, RH; Neumann, E; Pesch, E |
| 2002 | Fast algorithms with algebraic monge properties | Bein, WW; Brucker, P; Larmore, LL; Park, JK |
| 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 |
| 2003 | Lower bounds for resource-constrained project scheduling problems | Brucker, P; Knust, S |
| 2002 | Lower bounds for scheduling a single robot in a job-shop environment | Brucker, P; Knust, S |
| 1997 | On the complexity of two machine job-shop scheduling with regular objective functions | Brucker, P; Kravchenko, SA; Sotskov, YN |
| 2005 | Polynomial algorithm for parallel machine mean flow time scheduling problem with release dates | Brucker, P; Kravchenko, SA |
| 1996 | Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems | Brucker, P; Kramer, A |
| 1999 | Preemptive job-shop scheduling problems with a fixed number of jobs | Brucker, P; Kravchenko, SA; Sotskov, YN |
| 2001 | Resource-constrained project scheduling and timetabling | Brucker, P; Knust, S |
HOCHSCHULBIBLIOGRAPHIE