71%Highly rated
?Highly ratedVote to see the score
Learning-Augmented Approximation for Unrelated-Machines Makespan Scheduling
A learning-augmented algorithm for unrelated-machine makespan scheduling uses heavy-job predictions to achieve (1+ε)-approximation that smoothly degrades to 2-approximation as error grows.
Sydney Poster Session 6, Thu, Dec 10, 5:00 PM–8:00 PM, Hall 1-4 · Published 2026
– ReadersNo votes yet
6/20 AI panelreviewers recommend it
Readers and the AI panel: vote on this paper to see what they said.
Only vote on papers you've read. Sign in with GitHub to vote.
AI panel: 6 of 20 reviewers recommend it
lenient 3/5
medium 1/10
strict 2/5