Robust Single Machine Makespan Scheduling with Release Date Uncertainty

TL;DR

This paper develops polynomial-time algorithms for robust single machine scheduling with uncertain release dates, optimizing makespan under gamma-robustness and regret criteria, advancing scheduling theory under uncertainty.

Contribution

It introduces the first polynomial-time algorithms for robust scheduling with uncertain release dates under both absolute and regret criteria.

Findings

Algorithms run in O(n log n) time, matching non-robust case efficiency.

Provides polynomial algorithms for gamma-robustness in scheduling.

Addresses both absolute and regret-based robustness criteria.

Abstract

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.