Sigrid Knust

Alessandro Condotta, Sigrid Knust, Dimitri Meier, Natalia V. Shakhlevich: Tabu search and lower bounds for a combined production-transportation problem. Computers & OR 40(3): 886-900 (2013)

Christian Artigues, Peter Brucker, Sigrid Knust, Oumar Koné, Pierre Lopez, Marcel Mongeau: A note on "event-based MILP models for resource-constrained project scheduling problems". Computers & OR 40(4): 1060-1063 (2013)

Sigrid Knust: Scheduling of Tournaments or Sports Leagues. Algorithms Unplugged 2011: 267-275

Graham Kendall, Sigrid Knust, Celso C. Ribeiro, Sebastián Urrutia: Scheduling in sports: An annotated bibliography. Computers & OR 37(1): 1-19 (2010)

Dirk Briskorn, Sigrid Knust: Constructing fair sports league schedules with regard to strength groups. Discrete Applied Mathematics 158(2): 123-135 (2010)

Sigrid Knust: Scheduling non-professional table-tennis leagues. European Journal of Operational Research 200(2): 358-367 (2010)

Alessandro Condotta, Sigrid Knust, Natalia V. Shakhlevich: Parallel batch scheduling of equal-length jobs with release and due dates. J. Scheduling 13(5): 463-477 (2010)

Sigrid Knust, Daniel Lücking: Minimizing costs in round robin tournaments with place constraints. Computers & OR 36(11): 2937-2943 (2009)

Sigrid Knust: Scheduling sports tournaments on a single court minimizing waiting times. Oper. Res. Lett. 36(4): 471-476 (2008)

Sigrid Knust: Turnier- und Sportligaplanung. Taschenbuch der Algorithmen 2008: 275-284

Sigrid Knust, Michael von Thaden: Balanced home-away assignments. Discrete Optimization 3(4): 354-365 (2006)

Peter Brucker, Sigrid Knust, Ceyda Oguz: Scheduling chains with identical jobs and constant delays on a single machine. Math. Meth. of OR 63(1): 63-75 (2006)

Johann Hurink, Sigrid Knust: Tabu search algorithms for job-shop problems with a single transport robot. European Journal of Operational Research 162(1): 99-111 (2005)

Peter Brucker, Sigrid Knust, Guoqing Wang: Complexity results for flow-shop problems with a single server. European Journal of Operational Research 165(2): 398-407 (2005)

Philippe Baptiste, Peter Brucker, Sigrid Knust, Vadim G. Timkovsky: Ten notes on equal-processing-time scheduling. 4OR 2(2): 111-127 (2004)

Peter Brucker, Sigrid Knust, T. C. Edwin Cheng, Natalia V. Shakhlevich: Complexity Results for Flow-Shop and Open-Shop Scheduling Problems with Transportation Delays. Annals OR 129(1-4): 81-106 (2004)

Peter Brucker, Sigrid Knust: Sequencing and scheduling. European Journal of Operational Research 149(2): 247-248 (2003)

Peter Brucker, Sigrid Knust: Lower bounds for resource-constrained project scheduling problems. European Journal of Operational Research 149(2): 302-313 (2003)

Peter Brucker, Johann Hurink, Sigrid Knust: A polynomial algorithm for P | p_j=1, r_j, outtree | ∑ C_j. Math. Meth. of OR 56(3): 407-412 (2003)

Peter Brucker, Sigrid Knust: Lower Bounds for Scheduling a Single Robot in a Job-Shop Environment. Annals OR 115(1-4): 147-172 (2002)

Johann Hurink, Sigrid Knust: A tabu search algorithm for scheduling a single robot in a job-shop environment. Discrete Applied Mathematics 119(1-2): 181-203 (2002)

Johann Hurink, Sigrid Knust: Makespan minimization for flow-shop problems with transportation times and a single robot. Discrete Applied Mathematics 112(1-3): 199-216 (2001)

Johann Hurink, Sigrid Knust: List scheduling in a parallel machine environment with precedence constraints and setup times. Oper. Res. Lett. 29(5): 231-239 (2001)

Peter Brucker, Sigrid Knust: A linear programming and constraint propagation-based lower bound for the RCPSP. European Journal of Operational Research 127(2): 355-362 (2000)

Peter Brucker, Sigrid Knust, Duncan Roper, Yakov Zinder: Scheduling UET task systems with concurrency on two parallel identical processors. Math. Meth. of OR 52(3): 369-387 (2000)

Peter Brucker, Sigrid Knust: Resource-Constrained Project Scheduling and Timetabling. PATAT 2000: 277-293

Peter Brucker, Sigrid Knust: Complexity Results for Single-Machine Problems with Positive Finish-Start Time-Lags. Computing 63(4): 299-316 (1999)