We will give some examples of scheduling problems for which a randomized algorithm has been derandomized like scheduling with release dates, the job shop problem and the resource constrained scheduling problem. Starting with a brief introduction to the relevant derandomization techniques we will focus on the interplay between randomization and derandomization for these problems. Improved approximation algorithms for scheduling with release dates. L. M. Goldberg, M. Paterson, A. Srinivasan, E. Sweedyk. Better approximation guarantees for job-shop scheduling.
Approximation algorithms for scheduling.
A. Srivastav, P. Stangier. Tight aproximations for resource constrained scheduling and bin packing.