Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleJanuary 2025JUST ACCEPTED
Permutation Predictions for Non-Clairvoyant Scheduling
In non-clairvoyant scheduling, the task is to schedule jobs with a priori unknown processing requirements. We revisit this well-studied problem with the objective of minimizing the total (weighted) completion time in a recently popular learning-augmented ...
- research-articleDecember 2023
Non-clairvoyant Scheduling with Predictions
ACM Transactions on Parallel Computing (TOPC), Volume 10, Issue 4Article No.: 19, Pages 1–26https://doi.org/10.1145/3593969In the single-machine non-clairvoyant scheduling problem, the goal is to minimize the total completion time of jobs whose processing times are unknown a priori. We revisit this well-studied problem and consider the question of how to effectively use (...
- research-articleJuly 2021
Non-Clairvoyant Scheduling with Predictions
SPAA '21: Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and ArchitecturesPages 285–294https://doi.org/10.1145/3409964.3461790In the single-machine non-clairvoyant scheduling problem, the goal is to minimize the total completion time of jobs whose processing times are unknown a priori. We revisit this well-studied problem and consider the question of how to effectively use (...
- abstractJune 2018
Non-clairvoyant Dynamic Mechanism Design
EC '18: Proceedings of the 2018 ACM Conference on Economics and ComputationPage 169https://doi.org/10.1145/3219166.3219224Despite their better revenue and welfare guarantees for repeated auctions, dynamic mechanisms have not been widely adopted in practice. This is partly due to the complexity of their implementation as well as their unrealistic use of forecasting for ...
- ArticleOctober 2014
SelfishMigrate: A Scalable Algorithm for Non-clairvoyantly Scheduling Heterogeneous Processors
FOCS '14: Proceedings of the 2014 IEEE 55th Annual Symposium on Foundations of Computer SciencePages 531–540https://doi.org/10.1109/FOCS.2014.63We consider the classical problem of minimizing the total weighted flow-time for unrelated machines in the online non-clairvoyant setting. In this problem, a set of jobs J arrive over time to be scheduled on a set of M machines. Each job J has ...
- research-articleMay 2014
Competitive algorithms from competitive equilibria: non-clairvoyant scheduling under polyhedral constraints
STOC '14: Proceedings of the forty-sixth annual ACM symposium on Theory of computingPages 313–322https://doi.org/10.1145/2591796.2591814We introduce and study a general scheduling problem that we term the Packing Scheduling problem (PSP). In this problem, jobs can have different arrival times and sizes; a scheduler can process job j at rate xj, subject to arbitrary packing constraints ...
- articleJuly 2003
Non-clairvoyant scheduling for weighted flow time
Information Processing Letters (IPRL), Volume 87, Issue 1Pages 31–37https://doi.org/10.1016/S0020-0190(03)00231-XA non-clairvoyant scheduler makes decisions having no knowledge of jobs. It does not know when the jobs will arrive in the future, that is, it is online, and how long the jobs will be executed after they arrive. For non-clairvoyant scheduling, we first ...
