Research map / Bandits and online learning / Online convex optimization and games
Competitive Fair Scheduling with Predictions
Tianming Zhao, Chunqiu xia, Xiaomin Chang, Chunhao Li, Wei Li, Albert Zomaya
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Studies online non-clairvoyant scheduling to minimize max-stretch in the learning-augmented setting, using possibly imperfect job size predictions.
Problem
Online non-clairvoyant scheduling to minimize max-stretch when the scheduler has access to imperfect job size predictions.
Approach
A family of learning-augmented algorithms (Relaxed-fair-style scheduling) that uses job size predictions to obtain guarantees tied to prediction quality while remaining competitive in the worst case.
Experimental setup
Metrics: max-stretch competitive ratio
Closest papers by meaning
- Minimalistic Predictions to Schedule Jobs with Online Precedence Constraints (ICML 2023 · similarity 0.90)
- Non-clairvoyant Scheduling with Partial Predictions (ICML 2024 · similarity 0.89)
- Non-Clairvoyant Scheduling with Progress Bars (NeurIPS 2025 · similarity 0.86)
- Algorithms with Calibrated Machine Learning Predictions (ICML 2025 · similarity 0.85)
- Learning Augmented Exact Exponential Algorithms (NeurIPS 2026 · similarity 0.84)
- Improved Bounds for Online Facility Location with Predictions (AAAI 2025 · similarity 0.84)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
