  This paper addresses the robust single machine makespan scheduling with
uncertain release dates of the jobs. The release dates take values within know
intervals. We use the concept of gamma-robustness in two different settings and
address both the robust absolute and robust regret criteria. Our main results
are polynomial time algorithms which have the same running time (O(n log n)) as
the best algorithms for the non-robust case.
