Browse by Author Schulz, Andreas S.
Showing results 7 to 19 of 19
Preview | Issue Date | Title | Author(s) | Editor(s) |
 | 2000 | On Project Scheduling with Irregular Starting Time Costs | Möhring, Rolf H.; Schulz, Andreas S.; Stork, Frederik; Uetz, Marc | - |
 | 2003 | On-line scheduling to minimize average completion time revisited | Megow, Nicole; Schulz, Andreas S. | - |
 | 1999 | Optimal Routing of Traffic Flows with Length Restrictions in Networks with Congestion | Jahn, Olaf; Möhring, Rolf H.; Schulz, Andreas S. | - |
 | 1999 | The Power of α-Points in Preemptive Single Machine Scheduling | Schulz, Andreas S.; Skutella, Martin | - |
 | 1997 | Random-Based Scheduling: New Approximations and LP Lower Bounds | Schulz, Andreas S.; Skutella, Martin | - |
 | 1998 | Resource Constrained Project Scheduling: Computing Lower Bounds by Solving Minimum Cut Problems | Möhring, Rolf H.; Schulz, Andreas S.; Stork, Frederik; Uetz, Marc | - |
 | 1996 | Scheduling to Minimize Average Completion Time: Off-line and On-line Approximation Algorithms | Hall, Leslie A.; Schulz, Andreas S.; Shmoys, David B.; Wein, Joel | - |
 | 1999 | Scheduling unrelated machines by randomized rounding | Schulz, Andreas S.; Skutella, Martin | - |
 | 1996 | Scheduling-LPs Bear Probabilities: Randomized Approximations for Min-Sum Criteria | Schulz, Andreas S.; Skutella, Martin | - |
 | 1999 | Single Machine Scheduling with Release Dates | Goemans, Michel X.; Queyranne, Maurice; Schulz, Andreas S.; Skutella, Martin; Wang, Yaoguang | - |
 | 2000 | Solving Project Scheduling Problems by Minimum Cut Computations | Möhring, Rolf H.; Schulz, Andreas S.; Stork, Frederik; Uetz, Marc | - |
 | 1996 | Switchbox Routing in VLSI Design: Closing the Complexity Gap | Hartmann, Stephan; Schäffter, Markus W.; Schulz, Andreas S. | - |
 | 2002 | System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion | Jahn, Olaf; Möhring, Rolf H.; Schulz, Andreas S.; Moses, Nicols E. Stier | - |