Combinatorial Optimization & Graph Algorithms

Approximation in Stochastic Scheduling

Project description:
sorry, this page is currently under construction...

References

• Scheduling Precedence-Constrained Jobs with Stochastic Processing Times on Parallel Machines,
  Martin Skutella and Marc Uetz, extended abstract. Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'01), Washington, DC, 2001, pp. 589-590.
• Approximation in Stochastic Scheduling: The Power of LP-based Priority Policies,
  Rolf H. Möhring, Andreas S. Schulz, and Marc Uetz, Journal of the ACM 46(6), November 1999, pp. 924-942.
• Stochastic Machine Scheduling: Performance Guarantees for LP-based Priority Policies,
  Rolf H. Möhring, Andreas S. Schulz, and Marc Uetz, extended abstract, in: Proceedings of the 2nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX'99), Berkeley, Dorit Hochbaum, Klaus Jansen, Jose D. P. Rolim, Alistair Sinclair (eds.), Lecture Notes in Computer Science 1671, Springer, Berlin, 1999, pp. 144-155.

• Approximation Algorithms for Machine Scheduling
• Stochastic Project Scheduling