1. Yossi Azar Stefano Leonardi and Noam Touitou. 2021 a. Distortion-oblivious algorithms for minimizing flow time. https://arxiv.org/abs/2109.08424 Yossi Azar Stefano Leonardi and Noam Touitou. 2021 a. Distortion-oblivious algorithms for minimizing flow time. https://arxiv.org/abs/2109.08424
2. Flow time scheduling with uncertain processing time
3. Allan Borodin and Ran El-Yaniv . 1998. Online Computation and Competitive Analysis . Cambridge University Press , USA. Allan Borodin and Ran El-Yaniv. 1998. Online Computation and Competitive Analysis .Cambridge University Press, USA.
4. R.L. Graham , E.L. Lawler , J.K. Lenstra , and A.H.G. Rinnooy Kan . 1979. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey . In Discrete Optimization II , , P.L. Hammer, E.L. Johnson, and B.H. Korte (Eds.). Annals of Discrete Mathematics, Vol . 5. Elsevier , 287--326. R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.H.G.Rinnooy Kan. 1979. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey. In Discrete Optimization II , , P.L. Hammer, E.L. Johnson, and B.H. Korte (Eds.). Annals of Discrete Mathematics, Vol. 5. Elsevier, 287--326.
5. Nonclairvoyant scheduling