Kunal Agrawal, Jing Li, Kefu Lu, Benjamin Moseley. Scheduling Parallelizable Jobs Online to Maximize Throughput. In Michael A. Bender, Martin Farach-Colton, Miguel A. Mosteiro, editors, LATIN 2018: Theoretical Informatics - 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings. Volume 10807 of Lecture Notes in Computer Science, pages 755-776, Springer, 2018. [doi]
@inproceedings{AgrawalLLM18,
title = {Scheduling Parallelizable Jobs Online to Maximize Throughput},
author = {Kunal Agrawal and Jing Li and Kefu Lu and Benjamin Moseley},
year = {2018},
doi = {10.1007/978-3-319-77404-6_55},
url = {https://doi.org/10.1007/978-3-319-77404-6_55},
researchr = {https://researchr.org/publication/AgrawalLLM18},
cites = {0},
citedby = {0},
pages = {755-776},
booktitle = {LATIN 2018: Theoretical Informatics - 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings},
editor = {Michael A. Bender and Martin Farach-Colton and Miguel A. Mosteiro},
volume = {10807},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-319-77404-6},
}