On the public citation graph

Non-clairvoyant Scheduling with Predictions

0 signed · 22 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1016/0304-3975(94)90151-1openalex-snapshot
Nonclairvoyant scheduling
inferredcites →https://doi.org/10.1016/j.jnca.2017.01.016openalex-snapshot
Survey on prediction models of applications for resources provisioning in cloud
inferredcites →https://doi.org/10.1017/9781108637435openalex-snapshot
Beyond the Worst-Case Analysis of Algorithms
inferredcites →https://doi.org/10.1109/works15941.2006openalex-snapshot
2006 Workshop on Workflows in Support of Large-Scale Science
inferredcites →https://doi.org/10.1145/3136754openalex-snapshot
Competitive Algorithms from Competitive Equilibria
inferredcites →https://doi.org/10.1145/3428336openalex-snapshot
Competitive Algorithms for the Online Multiple Knapsack Problem with Application to Electric Vehicle Charging
inferredcites →https://doi.org/10.1145/347476.347479openalex-snapshot
Speed is as powerful as clairvoyance

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-031-83885-9_3openalex-snapshot
Online Machine Learning for the Estimation of Process Times in Dynamic Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-032-15579-5_7openalex-snapshot
When Machines Fail: Online Scheduling Under Bounded Failures
inferred← citeshttps://doi.org/10.1007/s00224-024-10200-zopenalex-snapshot
Scheduling with Speed Predictions
inferred← citeshttps://doi.org/10.1007/s00453-024-01239-yopenalex-snapshot
Online Unit Profit Knapsack with Predictions
inferred← citeshttps://doi.org/10.1016/j.ejor.2025.01.034openalex-snapshot
Fifty years of research in scheduling — Theory and applications
inferred← citeshttps://doi.org/10.1016/j.ipl.2025.106598openalex-snapshot
Tighter bounds on non-clairvoyant parallel machine scheduling with prediction to minimize makespan
inferred← citeshttps://doi.org/10.1016/j.jcss.2026.103795openalex-snapshot
Online interval scheduling with predictions
inferred← citeshttps://doi.org/10.1109/rtcsa66114.2025.00031openalex-snapshot
The Cost of Accurate Predictions in Learning-Augmented Scheduling
inferred← citeshttps://doi.org/10.1137/1.9781611977073.4openalex-snapshot
Learning-Augmented Weighted Paging
inferred← citeshttps://doi.org/10.1145/3711872openalex-snapshot
Permutation Predictions for Non-Clairvoyant Scheduling
inferred← citeshttps://doi.org/10.1609/aaai.v36i8.20854openalex-snapshot
Learning-Augmented Algorithms for Online Steiner Tree
inferred← citeshttps://doi.org/10.1609/aaai.v36i9.21208openalex-snapshot
Robustification of Online Graph Exploration Methods
inferred← citeshttps://doi.org/10.1609/icaps.v32i1.19827openalex-snapshot
Uniform Machine Scheduling with Predictions
inferred← citeshttps://doi.org/10.24963/ijcai.2022/636openalex-snapshot
Scheduling with Untrusted Predictions
inferred← citeshttps://doi.org/10.24963/ijcai.2022/81openalex-snapshot
Mechanism Design with Predictions
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.