| Erscheinungsdatum | Titel | Autor(en) |
| 1999 | 2 Solving Large-Sized Resource-Constrained Project Scheduling Problems | Brucker, Peter; Knust, Sigrid |
| 1998 | A branch and bound algorithm for the resource-constrained project scheduling problem | Brucker, P; Knust, S ; Schoo, A; Thiele, O |
| 2000 | A branch-and-bound algorithm for the resource-constrained project scheduling problem | Brucker, P.; Knust, S. ; Schoo, A.; Thiele, O. |
| 2015 | A CLASSIFICATION SCHEME FOR INTEGRATED STAFF ROSTERING AND SCHEDULING PROBLEMS | Paul, Mareike; Knust, Sigrid |
| 2016 | A flow-based tabu search algorithm for the RCPSP with transfer times | Poppenborg, Jens; Knust, Sigrid |
| 2000 | A linear programming and constraint propagation-based lower bound for the RCPSP | Brucker, P; Knust, S |
| 2019 | A neutrality-based iterated local search for shift scheduling optimization and interactive reoptimization | Meignan, David ; Knust, Sigrid |
| 2013 | A note on ``event-based MILP models for resource-constrained project scheduling problems'' | Artigues, Christian; Brucker, Peter; Knust, Sigrid ; Kone, Oumar; Lopez, Pierre; Mongeau, Marcel |
| 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 |
| 2015 | A Review and Taxonomy of Interactive Optimization Methods in Operations Research | Meignan, David ; Knust, Sigrid ; Frayret, Jean-Marc ; Pesant, Gilles ; Gaud, Nicolas |
| 1999 | A tabu search algorithm for scheduling a single robot in a job-shop environment | Hurink, Johann L.; Knust, Sigrid |
| 2002 | A tabu search algorithm for scheduling a single robot in a job-shop environment | Hurink, J; Knust, S |
| 2012 | Algorithms and Complexity | Brucker, Peter; Knust, Sigrid |
| 2006 | Balanced home-away assignments | Knust, Sigrid ; von Thaden, Michael |
| 2012 | Complex Job-Shop Scheduling | Brucker, Peter; Knust, Sigrid |
| 2012 | Complex scheduling, second edition | Brucker, P.; Knust, S. |
| 2015 | Complexity results for flow shop problems with synchronous movement | Waldherr, Stefan ; Knust, Sigrid |
| 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 |
HOCHSCHULBIBLIOGRAPHIE