2 papers
cs.DS2026
From Estimates to Schedules: Learning-Augmented Restricted Assignment
Michalis Xefteris
In this work, we study Restricted Assignment scheduling on multiple machines, where each job can be processed only on a specified subset of machines and the objective is to minimiz…
cs.DS2025
Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems
Evripidis Bampis, Bruno Escoffier, Dimitris Fotakis +2
We consider a learning-augmented framework for NP-hard permutation problems. The algorithm has access to predictions telling, given a pair of elements, whether is before…