Image de couverture de livre

Tighter Bounds on Non-clairvoyant Parallel Machine Scheduling with Prediction to Minimize Makespan

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Chen, Tianqi, Tan, Zhiyi
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Non-clairvoyant Scheduling with Partial Predictions
par: Benomar, Ziyad, et autres
Publié: (2024)

ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines
par: Rohwedder, Lars
Publié: (2025)

Online Makespan Scheduling under Scenarios
par: Ergen, Ekin
Publié: (2025)

Smoothed Analysis of the k-Swap Neighborhood for Makespan Scheduling
par: Rohwedder, Lars, et autres
Publié: (2024)

A k-swap Local Search for Makespan Scheduling
par: Rohwedder, Lars, et autres
Publié: (2024)

Online Makespan Minimization: Beat LPT by Dynamic Locking
par: Wang, Zhaozi, et autres
Publié: (2023)

Minimizing Makespan in Sublinear Time via Weighted Random Sampling
par: Fu, Bin, et autres
Publié: (2026)

Minimizing the Weighted Makespan with Restarts on a Single Machine
par: Amouzandeh, Aflatoun, et autres
Publié: (2025)

Fast Makespan Minimization via Short ILPs
par: Hermelin, Danny, et autres
Publié: (2026)

Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks
par: Chen, Chi-Yeh
Publié: (2025)

Approximate Graph Propagation Revisited: Dynamic Parameterized Queries, Tighter Bounds and Dynamic Updates
par: Zhao, Zhuowei, et autres
Publié: (2025)

Maximum Unique Coverage on Streams: Improved FPT Approximation Scheme and Tighter Space Lower Bound
par: Cervenjak, Philip, et autres
Publié: (2024)

Faster Minimization of Total Weighted Completion Time on Parallel Machines
par: Hermelin, Danny, et autres
Publié: (2025)

Minimizing the Number of Tardy Jobs with Uniform Processing Times on Parallel Machines
par: Heeger, Klaus, et autres
Publié: (2024)

Tight Bounds for Online Scheduling in the One-Fast-Many-Slow Machines Setting
par: Jeang, John, et autres
Publié: (2026)

Engineering Optimal Parallel Task Scheduling
par: Akram, Matthew, et autres
Publié: (2024)

Tighter Bounds for Local Differentially Private Core Decomposition and Densest Subgraph
par: Henzinger, Monika, et autres
Publié: (2024)

Online Flow Time Minimization: Tight Bounds for Non-Preemptive Algorithms
par: Geng, Yutong, et autres
Publié: (2025)

Scheduling Jobs with Work-Inefficient Parallel Solutions
par: Kuszmaul, William, et autres
Publié: (2024)

Tight (S)ETH-based Lower Bounds for Pseudopolynomial Algorithms for Bin Packing and Multi-Machine Scheduling
par: Bringmann, Karl, et autres
Publié: (2026)

Online Scheduling via Gradient Descent for Weighted Flow Time Minimization
par: Chen, Qingyun, et autres
Publié: (2024)

Tighter relaxations for MAP-MRF optimization via Singleton Arc Consistency
par: Lev-Ran, Asaf, et autres
Publié: (2026)

The Buffer Minimization Problem for Scheduling Flow Jobs with Conflicts
par: Haas, Niklas, et autres
Publié: (2025)

Scheduling on a Stochastic Number of Machines
par: Buchem, Moritz, et autres
Publié: (2024)

Kidney Exchange: Faster Parameterized Algorithms and Tighter Lower Bounds
par: Banik, Aritra, et autres
Publié: (2025)

Lower Bounds on $0$-Extension with Steiner Nodes
par: Chen, Yu, et autres
Publié: (2024)

Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates
par: Kaul, Matthias, et autres
Publié: (2024)

Non-Clairvoyant Scheduling with Progress Bars
par: Benomar, Ziyad, et autres
Publié: (2025)

Simplified Tight Bounds for Monotone Minimal Perfect Hashing
par: Kosolobov, Dmitry
Publié: (2024)

Optimal Stopping with a Predicted Prior
par: Bai, Tian, et autres
Publié: (2025)

Lower Bounds on Flow Sparsifiers with Steiner Nodes
par: Chen, Yu, et autres
Publié: (2026)

Min-Sum Set Cover on Parallel Machines
par: Szyfelbein, Michał
Publié: (2026)

Online Flexible Busy Time Scheduling on Heterogeneous Machines
par: Calinescu, Gruia, et autres
Publié: (2024)

Structural Results for High-Multiplicity Scheduling on Uniform Machines
par: Brinkop, Hauke, et autres
Publié: (2022)

Lower Bound Techniques in the Comparison-Query Model and Inversion Minimization on Trees
par: Hu, Ivan, et autres
Publié: (2022)

Scheduling on Identical Machines with Setup Time and Unknown Execution Time
par: Kawase, Yasushi, et autres
Publié: (2025)

Competitive Kill-and-Restart and Preemptive Strategies for Non-Clairvoyant Scheduling
par: Jäger, Sven, et autres
Publié: (2022)

Competitive Non-Clairvoyant KV-Cache Scheduling for LLM Inference
par: Feng, Yiding, et autres
Publié: (2026)

Robust Max Selection
par: Dang, Trung, et autres
Publié: (2024)

The Power of Proportional Fairness for Non-Clairvoyant Scheduling under Polyhedral Constraints
par: Jäger, Sven, et autres
Publié: (2024)