| 2007 |
|---|
| 24 | EE | Philippe Baptiste,
Peter Brucker,
Marek Chrobak,
Christoph Dürr,
Svetlana A. Kravchenko,
Francis Sourd:
The complexity of mean flow time scheduling problems with release times.
J. Scheduling 10(2): 139-146 (2007) |
| 2006 |
|---|
| 23 | EE | Philippe Baptiste,
Peter Brucker,
Marek Chrobak,
Christoph Dürr,
Svetlana A. Kravchenko,
Francis Sourd:
The Complexity of Mean Flow Time Scheduling Problems with Release Times
CoRR abs/cs/0605078: (2006) |
| 2005 |
|---|
| 22 | EE | Peter Brucker,
Svetlana A. Kravchenko:
Polynomial Algorithm for Parallel Machine Mean Flow Time Scheduling Problem with Release Dates.
ICCSA (4) 2005: 182-191 |
| 21 | EE | Wolfgang W. Bein,
Peter Brucker,
Lawrence L. Larmore,
James K. Park:
The algebraic Monge property and path problems.
Discrete Applied Mathematics 145(3): 455-464 (2005) |
| 20 | 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) |
| 19 | EE | Peter Brucker,
Thomas Kampmeyer:
Tabu Search Algorithms for Cyclic Machine Scheduling Problems.
J. Scheduling 8(4): 303-322 (2005) |
| 2004 |
|---|
| 18 | EE | Philippe Baptiste,
Peter Brucker,
Sigrid Knust,
Vadim G. Timkovsky:
Ten notes on equal-processing-time scheduling.
4OR 2(2): 111-127 (2004) |
| 2003 |
|---|
| 17 | EE | Peter Brucker,
Sigrid Knust:
Sequencing and scheduling.
European Journal of Operational Research 149(2): 247-248 (2003) |
| 16 | EE | Peter Brucker,
Sigrid Knust:
Lower bounds for resource-constrained project scheduling problems.
European Journal of Operational Research 149(2): 302-313 (2003) |
| 15 | EE | Peter Brucker,
Silvia Heitmann,
Johann Hurink:
How useful are preemptive schedules?
Oper. Res. Lett. 31(2): 129-136 (2003) |
| 2002 |
|---|
| 14 | EE | Wolfgang W. Bein,
Peter Brucker,
Lawrence L. Larmore,
James K. Park:
Fast Algorithms with Algebraic Monge Properties.
MFCS 2002: 104-117 |
| 13 | | Peter Brucker:
Scheduling and constraint propagation.
Discrete Applied Mathematics 123(1-3): 227-256 (2002) |
| 2000 |
|---|
| 12 | EE | Peter Brucker,
Sigrid Knust:
Resource-Constrained Project Scheduling and Timetabling.
PATAT 2000: 277-293 |
| 1999 |
|---|
| 11 | EE | Peter Brucker,
Sigrid Knust:
Complexity Results for Single-Machine Problems with Positive Finish-Start Time-Lags.
Computing 63(4): 299-316 (1999) |
| 10 | EE | Peter Brucker,
Thomas Hilbig,
Johann Hurink:
A Branch and Bound Algorithm for a Single-machine Scheduling Problem with Positive, Negative Time-lags.
Discrete Applied Mathematics 94(1-3): 77-99 (1999) |
| 1997 |
|---|
| 9 | EE | Peter Brucker,
Johann Hurink,
Frank Werner:
Improving Local Search Heuristics for some Scheduling Problems. Part II.
Discrete Applied Mathematics 72(1-2): 47-69 (1997) |
| 8 | EE | Peter Brucker,
Johann Hurink,
Bernd Jurisch,
Birgit Wöstmann:
A Branch & Bound Algorithm for the Open-shop Problem.
Discrete Applied Mathematics 76(1-3): 43-59 (1997) |
| 1996 |
|---|
| 7 | EE | Peter Brucker,
Johann Hurink,
Frank Werner:
Improving Local Search Heuristics for Some Scheduling Problems-I.
Discrete Applied Mathematics 65(1-3): 97-122 (1996) |
| 1995 |
|---|
| 6 | EE | Wolfgang W. Bein,
Peter Brucker,
James K. Park,
Pramod K. Pathak:
A Monge Property for the D-dimensional Transportation Problem.
Discrete Applied Mathematics 58(2): 97-109 (1995) |
| 5 | EE | Peter Brucker:
Efficient Algorithms for Some Path Partitioning Problems.
Discrete Applied Mathematics 62(1-3): 77-85 (1995) |
| 1994 |
|---|
| 4 | | Peter Brucker,
Bernd Jurisch,
Bernd Sievers:
A Branch and Bound Algorithm for the Job-Shop Scheduling Problem.
Discrete Applied Mathematics 49(1-3): 107-127 (1994) |
| 1993 |
|---|
| 3 | EE | Susanne Albers,
Peter Brucker:
The Complexity of One-Machine Batching Problems.
Discrete Applied Mathematics 47(2): 87-107 (1993) |
| 2 | | Wolfgang W. Bein,
Peter Brucker,
Alan J. Hoffman:
Series parallel composition of greedy linear programming problems.
Math. Program. 62: 1-14 (1993) |
| 1980 |
|---|
| 1 | | Peter Brucker:
The Chinese Postman Problem for Mixed Graphs.
WG 1980: 354-366 |
