Lower bounds for smith's rule in stochastic machine scheduling
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
| Hi-index | 0.00 |
The purpose of this paper is to present examples for the sometimes surprisingly different behavior of deterministic and stochastic scheduling problems. In particular, it demonstrates some seemingly counterintuitive properties of optimal scheduling policies for stochastic machine scheduling problems.