| 2005 |
|---|
| 10 | EE | 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) |
| 9 | EE | 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) |
| 2004 |
|---|
| 8 | EE | Philippe Baptiste,
Peter Brucker,
Sigrid Knust,
Vadim G. Timkovsky:
Ten notes on equal-processing-time scheduling.
4OR 2(2): 111-127 (2004) |
| 2003 |
|---|
| 7 | EE | Peter Brucker,
Sigrid Knust:
Sequencing and scheduling.
European Journal of Operational Research 149(2): 247-248 (2003) |
| 6 | EE | Peter Brucker,
Sigrid Knust:
Lower bounds for resource-constrained project scheduling problems.
European Journal of Operational Research 149(2): 302-313 (2003) |
| 2002 |
|---|
| 5 | | 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) |
| 2001 |
|---|
| 4 | | 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) |
| 3 | EE | 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) |
| 2000 |
|---|
| 2 | EE | Peter Brucker,
Sigrid Knust:
Resource-Constrained Project Scheduling and Timetabling.
PATAT 2000: 277-293 |
| 1999 |
|---|
| 1 | EE | Peter Brucker,
Sigrid Knust:
Complexity Results for Single-Machine Problems with Positive Finish-Start Time-Lags.
Computing 63(4): 299-316 (1999) |
