{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T02:10:59Z","timestamp":1771035059267,"version":"3.50.1"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031498145","type":"print"},{"value":"9783031498152","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-49815-2_6","type":"book-chapter","created":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T07:02:28Z","timestamp":1703142148000},"page":"74-89","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Scheduling with\u00a0Speed Predictions"],"prefix":"10.1007","author":[{"given":"Eric","family":"Balkanski","sequence":"first","affiliation":[]},{"given":"Tingting","family":"Ou","sequence":"additional","affiliation":[]},{"given":"Clifford","family":"Stein","sequence":"additional","affiliation":[]},{"given":"Hao-Ting","family":"Wei","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,22]]},"reference":[{"issue":"2\u20133","key":"6_CR1","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/S0166-218X(00)00266-3","volume":"110","author":"S Albers","year":"2001","unstructured":"Albers, S., Schmidt, G.: Scheduling with unexpected machine breakdowns. Discret. Appl. Math. 110(2\u20133), 85\u201399 (2001)","journal-title":"Discret. Appl. Math."},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Azar, Y., Leonardi, S., Touitou, N.: Flow time scheduling with uncertain processing time. In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pp. 1070\u20131080 (2021)","DOI":"10.1145\/3406325.3451023"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Azar, Y., Leonardi, S., Touitou, N.: Distortion-oblivious algorithms for minimizing flow time. In: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 252\u2013274. SIAM (2022)","DOI":"10.1137\/1.9781611977073.13"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Azar, Y., Panigrahi, D., Touitou, N.: Online graph algorithms with predictions. In: Proceedings of the Thirty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (2022)","DOI":"10.1137\/1.9781611977073.3"},{"key":"6_CR5","unstructured":"Bamas, E., Maggiori, A., Rohwedder, L., Svensson, O.: Learning augmented energy minimization via speed scaling. In: Larochelle, H., Ranzato, M., Hadsell, R., Balcan, M.F., Lin, H. (eds.) Advances in Neural Information Processing Systems, vol. 33, pp. 15350\u201315359. Curran Associates, Inc. (2020)"},{"key":"6_CR6","unstructured":"Bamas, E., Maggiori, A., Svensson, O.: The primal-dual method for learning augmented algorithms. In: Larochelle, H., Ranzato, M., Hadsell, R., Balcan, M.F., Lin, H. (eds.) Advances in Neural Information Processing Systems, pp. 20083\u201320094 (2020)"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Banerjee, S., Gkatzelis, V., Gorokh, A., Jin, B.: Online nash social welfare maximization with predictions. In: Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022. SIAM (2022)","DOI":"10.1137\/1.9781611977073.1"},{"key":"6_CR8","first-page":"10393","volume":"34","author":"M Dinitz","year":"2021","unstructured":"Dinitz, M., Im, S., Lavastida, T., Moseley, B., Vassilvitskii, S.: Faster matchings via learned duals. Adv. Neural. Inf. Process. Syst. 34, 10393\u201310406 (2021)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"6_CR9","unstructured":"Dinitz, M., Im, S., Lavastida, T., Moseley, B., Vassilvitskii, S.: Algorithms with prediction portfolios. arXiv preprint arXiv:2210.12438 (2022)"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"D\u00fctting, P., Lattanzi, S., Paes Leme, R., Vassilvitskii, S.: Secretaries with advice. In: Proceedings of the 22nd ACM Conference on Economics and Computation, pp. 409\u2013429 (2021)","DOI":"10.1145\/3465456.3467623"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Eberle, F., Hoeksma, R., Megow, N., N\u00f6lke, L., Schewior, K., Simon, B.: Speed-robust scheduling - sand, bricks, and rocks. In: Integer Programming and Combinatorial Optimization - 22nd International Conference, IPCO 2021, Atlanta, GA, USA, 19\u201321 May 2021, Proceedings, pp. 283\u2013296 (2021)","DOI":"10.1007\/978-3-030-73879-2_20"},{"issue":"3","key":"6_CR12","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1137\/110844210","volume":"41","author":"L Epstein","year":"2012","unstructured":"Epstein, L., et al.: Universal sequencing on an unreliable machine. SIAM J. Comput. 41(3), 565\u2013586 (2012)","journal-title":"SIAM J. Comput."},{"key":"6_CR13","unstructured":"Fotakis, D., Gergatsouli, E., Gouleakis, T., Patris, N.: Learning augmented online facility location. CoRR abs\/2107.08277 (2021). https:\/\/arxiv.org\/abs\/2107.08277"},{"issue":"3","key":"6_CR14","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1137\/0217033","volume":"17","author":"DS Hochbaum","year":"1988","unstructured":"Hochbaum, D.S., Shmoys, D.B.: A polynomial approximation scheme for scheduling on uniform processors: using the dual approximation approach. SIAM J. Comput. 17(3), 539\u2013551 (1988)","journal-title":"SIAM J. Comput."},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Im, S., Kumar, R., Montazer Qaem, M., Purohit, M.: Non-clairvoyant scheduling with predictions. In: Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures, pp. 285\u2013294 (2021)","DOI":"10.1145\/3409964.3461790"},{"key":"6_CR16","unstructured":"Im, S., Kumar, R., Montazer Qaem, M., Purohit, M.: Online knapsack with frequency predictions. In: Advances in Neural Information Processing Systems, vol. 34 (2021)"},{"key":"6_CR17","unstructured":"Jin, B., Ma, W.: Online bipartite matching with advice: Tight robustness-consistency tradeoffs for the two-stage model. arXiv preprint arXiv:2206.11397 (2022)"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Lattanzi, S., Lavastida, T., Moseley, B., Vassilvitskii, S.: Online scheduling via learned weights. In: Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1859\u20131877 (2020)","DOI":"10.1137\/1.9781611975994.114"},{"key":"6_CR19","unstructured":"Lindermayr, A., Megow, N., Rapp, M.: Speed-oblivious online scheduling: knowing (precise) speeds is not necessary. arXiv preprint arXiv:2302.00985 (2023)"},{"key":"6_CR20","unstructured":"Lykouris, T., Vassilvtiskii, S.: Competitive caching with machine learned advice. In: International Conference on Machine Learning, pp. 3296\u20133305. PMLR (2018)"},{"key":"6_CR21","unstructured":"Mitzenmacher, M.: Scheduling with Predictions and the Price of Misprediction. In: 11th Innovations in Theoretical Computer Science Conference (ITCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), vol. 151, pp. 14:1\u201314:18 (2020)"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M., Vassilvitskii, S.: Algorithms with predictions. arXiv preprint arXiv:2006.09123 (2020)","DOI":"10.1017\/9781108637435.037"},{"key":"6_CR23","unstructured":"Purohit, M., Svitkina, Z., Kumar, R.: Improving online algorithms via ml predictions. In: Bengio, S., Wallach, H., Larochelle, H., Grauman, K., Cesa-Bianchi, N., Garnett, R. (eds.) Advances in Neural Information Processing Systems. Curran Associates, Inc. (2018)"},{"key":"6_CR24","doi-asserted-by":"crossref","unstructured":"Stein, C., Zhong, M.: Scheduling when you do not know the number of machines. ACM Trans. Algorithms (2019)","DOI":"10.1137\/1.9781611975031.82"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49815-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T07:03:11Z","timestamp":1703142191000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49815-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031498145","9783031498152"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49815-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"22 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Approximation and Online Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Amsterdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waoa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo-conference.org\/2023\/waoa\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.05","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7.7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}