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.
Uetz, M. J. (2003). When greediness fails: examples from stochastic scheduling. Operations research letters, 31(6), 413-419. [10.1016/S0167-6377(03)00047-6]. https://doi.org/10.1016/S0167-6377(03)00047-6