| Erscheinungsdatum | Titel | Autor(en) |
| 2000 | A branch-and-bound algorithm for the resource-constrained project scheduling problem | Brucker, P.; Knust, S. ; Schoo, A.; Thiele, O. |
| 1991 | A characterization of network representable polymatroids | Bein, W.W.; Brucker, P.; Stallmann, M.F.M. |
| 1984 | A Dual Optimality Criterion for Algebraic Linear Programs | Brucker, P.; Zimmermann, U. |
| 1984 | A Greedy Algorithm for Solving Network Flow Problems in Trees | Brucker, P. |
| 1982 | A linear time algorithm to minimize maximum lateness for the two-machine, unit-time, job-shop, scheduling problem | Brucker, P. |
| 1999 | A new tabu search procedure for an audit-scheduling problem | Brucker, P.; Schumacher, D. |
| 2013 | A note on reverse scheduling with maximum lateness objective | Li, S. S.; Brucker, P.; Ng, C. T.; Cheng, T. C. E.; Shakhlevich, N. V.; Yuan, J. J. |
| 1986 | A railway scheduling problem | Brucker, P.; Hurink, J. |
| 1984 | An O (n)-algorithm for LP-knapsacks with a fixed number of GUB constraints | Brucker, P. |
| 2012 | Complex scheduling, second edition | Brucker, P.; Knust, S. |
| 2009 | On the complexity of scheduling | Brucker, P.; Knust, S. |
| 1993 | Open shop problems with unit time operations | Brucker, P.; Jurisch, B.; Jurisch, M. |
| 1990 | Pattern scheduling | Brucker, P.; Kathmann, U. |
| 1998 | Scheduling a batching machine | Brucker, P.; Gladky, A.; Hoogeveen, H.; Kovalyov, M.Y.; Potts, C.N.; Tautenhahn, T.; Van De Velde, S.L. |
| 2007 | Scheduling algorithms | Brucker, P. |
| 2004 | Scheduling equal processing time jobs | Baptiste, P.; Brucker, P. |
| 2006 | Scheduling equal processing time jobs to minimize the weighted number of late jobs | Brucker, P.; Kravchenko, S.A. |
| 2004 | Ten notes on equal-processing-time scheduling: At the frontiers of solvability in polynomial time | Baptiste, P.; Brucker, P.; Knust, S. ; Timkovsky, V.G. |
HOCHSCHULBIBLIOGRAPHIE