arXiv (All)
open access
The Exact Robustness of Smith's Rule with Predicted Processing Times
Smith's rule orders jobs by their weight-to-processing-time ratios. We study the robustness of its list schedule on identical parallel machines when job $j$ is ordered using a nominal processing time $μ_j$ and its true processing time satisfies $μ_j\leq p_j\leqαμ_j$, where $α\geq1$. We determine t
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Robust Parallel Machine Scheduling: A Comparison of Robustness Measures and Local Search Approaches#1357071
- On the Decidability of Distributed Tasks with Output Sets under Asynchrony and Any Number of Crashes#2552
- Pareto-optimal Scheduling with Predictions#1447870
- How Much Does Submitting a Burst of Jobs Impact Waiting Time? An Analysis of the Jean Zay Workload Trace#1248983
- Near-Optimal Consistency-Robustness Bounds for Non-Clairvoyant Scheduling#1413278
Record · ID 1447564
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive