A Consistency-Robustness Framework for Robust Optimization: Integrating Predictions into Robust Scheduling

2026-08-01

AI Summary

Traditional robust optimization is often overly conservative due to its exclusive focus on worst-case scenarios, limiting its ability to leverage predictive information for improved scheduling performance. This work proposes the first framework that explicitly incorporates predictions as an independent benchmark in robust scheduling, achieving a principled trade-off between consistency—near-optimality under predicted scenarios—and robustness—guaranteed performance under worst-case uncertainty. By developing a consistency–robustness trade-off mechanism and employing duality theory, upper-envelope reductions, and support-function blocks, the paper systematically analyzes scheduling problems under interval, budgeted, and general uncertainty sets. Smooth $(1+1/\lambda, 1+\lambda)$ trade-offs are established for restricted assignment and related machine models, while the impossibility of constant-factor trade-offs is proven for unrelated machines; constant performance guarantees are provided for identical machines.

Abstract

Robust optimization protects against uncertainty by optimizing for the worst case over a prescribed uncertainty set. This protection can be overly conservative when forecasts, historical data, or learned predictions indicate a more likely scenario. We introduce a framework for robust optimization with predictions. The input consists of an uncertainty set together with a distinguished predicted scenario, and the goal is to compute a single solution that is both consistent, meaning near-optimal for the predicted scenario, and robust, meaning competitive with the classical min-max robust optimum. Unlike in standard learning-augmented algorithms, the prediction does not merely estimate the realized input; it creates a separate benchmark, the predicted optimum, which must be balanced against the min-max robust optimum. We study this framework for makespan scheduling with uncertain processing times and give a structural classification across standard uncertainty models and machine environments. For interval uncertainty, we obtain a smooth $(1+1/λ,1+λ)$ consistency-robustness tradeoff for restricted-assignment and related machines. Furthermore, we prove that unrelated machines admit no constant tradeoff. For budgeted uncertainty, we obtain a $(1+1/λ,2+λ)$ tradeoff for restricted assignment. Our analysis is based on a duality-based reduction to an interval-like upper envelope. We complement this with a lower bound showing that related machines admit no constant tradeoff even when only one job may deviate. For arbitrary uncertainty sets, we obtain constant tradeoffs for identical machines via a support-function block construction, and prove impossibility for restricted assignment. Our results show that the possibility of combining consistency and robustness in robust scheduling depends critically on the interaction between the uncertainty model and the machine environment.

Problem

• robust optimization
• consistency
• robustness
• scheduling
• uncertainty

Innovation

• consistency-robustness tradeoff
• robust optimization with predictions
• scheduling under uncertainty
• learning-augmented algorithms
• duality-based reduction