Fetching the paper…
Reading the bibliography…
In light of recent work on scheduling with predicted job sizes, we consider the effect of the cost of predictions in queueing systems, removing the assumption in prior research that predictions are external to the system's resources and/or cost-free.
Stochastic programming
Viacheslav Viktorovich Kolbin. 1977 · 1977
Earlier work this paper cites.
Stochastic optimization is (almost) as easy as deterministic optimization. In 45th Annual IEEE Symposium on Foundations of Computer Science . IEEE, 228–237
David B Shmoys and Chaitanya Swamy. 2004 · 2004
Earlier work this paper cites.
Approximation algorithms for 2-stage stochastic optimization problems
Chaitanya Swamy and David B Shmoys. 2006 · 2006
Earlier work this paper cites.
Scheduling despite inexact job-size information. In Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems . 25–36
Adam Wierman and Misja Nuyens. 2008 · 2008
Earlier work this paper cites.
Performance modeling and design of computer systems: queueing theory in action
Mor Harchol-Balter. 2013 · 2013
Earlier work this paper cites.
PSBS: Practical size-based scheduling
Matteo Dell’Amico, Damiano Carra, and Pietro Michiardi. 2015 · 2015
Earlier work this paper cites.
Two-stage stochastic programming in disaster management: A literature survey
Emilia Grass and Kathrin Fischer. 2016 · 2016
Cited alongside, same era.
SOAP bubbles: Robust scheduling under adversarial noise. In 2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) . 144–154
Ziv Scully and Mor Harchol-Balter. 2018 · 2018
Cited alongside, same era.
Scheduling with inexact job sizes: The merits of shortest processing time first
Matteo Dell’Amico. 2019 · 2019
Cited alongside, same era.
Scheduling with predictions and the price of misprediction
Michael Mitzenmacher. 2019 · 2019
Cited alongside, same era.
Algorithms with Predictions
Michael Mitzenmacher and Sergei Vassilvitskii. 2020 · 2020
Cited alongside, same era.
Flow time scheduling with uncertain processing time. In STOC . 1070–1080
Yossi Azar, Stefano Leonardi, and Noam Touitou. 2021 · 2021
Later among the works it cites.
Queues with small advice. In SIAM Conference on Applied and Computational Discrete Algorithms (ACDA21) . SIAM, 1–12
Michael Mitzenmacher. 2021 · 2021
Later among the works it cites.
Distortion-Oblivious Algorithms for Minimizing Flow Time. In ACM-SIAM . 252–274
Yossi Azar, Stefano Leonardi, and Noam Touitou. 2022 · 2022
Later among the works it cites.
Algorithms with predictions
Michael Mitzenmacher and Sergei Vassilvitskii. 2022 · 2022
Later among the works it cites.
Uniform Bounds for Scheduling with Job Size Estimates. In ITCS . 114:1–114:30
Ziv Scully, Isaac Grosof, and Michael Mitzenmacher. 2022 · 2022
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Algorithms with Predictions Paper List
[n.d.]
Cited in the paper.
Scheduling firm real-time applications on the edge with single-bit execution time prediction. In ISORC . 207–213
Shaik Mohammed Salman, Van-Lan Dao, Alessandro Vittorio Papadopoulos, Saad Mubeen, and Thomas Nolte. 2023a
Cited in the paper.
Evaluating Dispatching and Scheduling Strategies for Firm Real-Time Jobs in Edge Computing. In IECON . 1–6
Shaik Mohammed Salman, Alessandro Vittorio Papadopoulos, Saad Mubeen, and Thomas Nolte. 2023b
Cited in the paper.