{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T20:17:03Z","timestamp":1777148223711,"version":"3.51.4"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:00:00Z","timestamp":1743033600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:00:00Z","timestamp":1743033600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-2210502"],"award-info":[{"award-number":["CCF-2210502"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-2218677"],"award-info":[{"award-number":["CCF-2218677"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-2218677"],"award-info":[{"award-number":["CCF-2218677"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["ONR-13533312"],"award-info":[{"award-number":["ONR-13533312"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["ONR-13533312"],"award-info":[{"award-number":["ONR-13533312"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1007\/s00224-024-10200-z","type":"journal-article","created":{"date-parts":[[2025,3,29]],"date-time":"2025-03-29T23:54:51Z","timestamp":1743292491000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Scheduling with Speed Predictions"],"prefix":"10.1007","volume":"69","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":[[2025,3,27]]},"reference":[{"issue":"2\u20133","key":"10200_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":"10200_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":"10200_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 pp. 252\u2013274 (2022)","DOI":"10.1137\/1.9781611977073.13"},{"key":"10200_CR4","doi-asserted-by":"crossref","unstructured":"Azar, Y., Panigrahi, D., Touitou, N.: Online graph algorithms with predictions. In proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms pp. 35\u201366 (2022)","DOI":"10.1137\/1.9781611977073.3"},{"key":"10200_CR5","first-page":"15350","volume":"33","author":"E Bamas","year":"2020","unstructured":"Bamas, E., Maggiori, A., Rohwedder, L., Svensson, O.: Learning augmented energy minimization via speed scaling. Adv. Neural. Inf. Process. Syst. 33, 15350\u201315359 (2020)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"10200_CR6","first-page":"20083","volume":"33","author":"E Bamas","year":"2020","unstructured":"Bamas, E., Maggiori, A., Svensson, O.: The primal-dual method for learning augmented algorithms. Adv. Neural. Inf. Process. Syst. 33, 20083\u201320094 (2020)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"10200_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 pp. 1\u201319 (2022)","DOI":"10.1137\/1.9781611977073.1"},{"key":"10200_CR8","unstructured":"Buchem, M., Eberle, F., Rosado, H.K.K., Schewior, K., Wiese, A.: Scheduling on a stochastic number of machines. International Conference on Approximation Algorithms for Combinatorial Optimization Problems 317, 14:1\u201314:15 (2024)"},{"key":"10200_CR9","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":"10200_CR10","first-page":"20273","volume":"35","author":"M Dinitz","year":"2022","unstructured":"Dinitz, M., Im, S., Lavastida, T., Moseley, B., Vassilvitskii, S.: Algorithms with prediction portfolios. Adv. Neural. Inf. Process. Syst. 35, 20273\u201320286 (2022)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"issue":"2","key":"10200_CR11","doi-asserted-by":"publisher","first-page":"856","DOI":"10.1287\/moor.2023.1384","volume":"49","author":"P D\u00fctting","year":"2024","unstructured":"D\u00fctting, P., Lattanzi, S., Paes Leme, R., Vassilvitskii, S.: Secretaries with advice. Math. Oper. Res. 49(2), 856\u2013879 (2024)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"10200_CR12","doi-asserted-by":"publisher","first-page":"1009","DOI":"10.1007\/s10107-022-01829-0","volume":"197","author":"F Eberle","year":"2023","unstructured":"Eberle, F., Hoeksma, R., Megow, N., N\u00f6lke, L., Schewior, K., Simon, B.: Speed-robust scheduling: sand, bricks, and rocks. Math. Program. 197(2), 1009\u20131048 (2023)","journal-title":"Math. Program."},{"key":"10200_CR13","unstructured":"Epstein, L., Levin, A.: Efficient approximation schemes for scheduling on a stochastic number of machines (2024), https:\/\/arxiv.org\/abs\/2409.10155"},{"issue":"3","key":"10200_CR14","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1137\/110844210","volume":"41","author":"L Epstein","year":"2012","unstructured":"Epstein, L., Levin, A., Marchetti-Spaccamela, A., Megow, N., Mestre, J., Skutella, M., Stougie, L.: Universal sequencing on an unreliable machine. SIAM J. Comput. 41(3), 565\u2013586 (2012)","journal-title":"SIAM J. Comput."},{"key":"10200_CR15","unstructured":"Fotakis, D., Gergatsouli, E., Gouleakis, T., Patris, N.: Improved bounds for online facility location with predictions (2024), https:\/\/arxiv.org\/abs\/2107.08277"},{"issue":"3","key":"10200_CR16","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":"10200_CR17","first-page":"2733","volume":"34","author":"S Im","year":"2021","unstructured":"Im, S., Kumar, R., Montazer Qaem, M., Purohit, M.: Online knapsack with frequency predictions. Adv. Neural. Inf. Process. Syst. 34, 2733\u20132743 (2021)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"issue":"4","key":"10200_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3593969","volume":"10","author":"S Im","year":"2023","unstructured":"Im, S., Kumar, R., Qaem, M.M., Purohit, M.: Non-clairvoyant scheduling with predictions. ACM Transactions on Parallel Computing 10(4), 1\u201326 (2023)","journal-title":"ACM Transactions on Parallel Computing"},{"key":"10200_CR19","first-page":"14555","volume":"35","author":"B Jin","year":"2022","unstructured":"Jin, B., Ma, W.: Online bipartite matching with advice: Tight robustness-consistency tradeoffs for the two-stage model. Adv. Neural. Inf. Process. Syst. 35, 14555\u201314567 (2022)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"10200_CR20","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 pp. 1859\u20131877 (2020)","DOI":"10.1137\/1.9781611975994.114"},{"key":"10200_CR21","unstructured":"Lindermayr, A., Megow, N., Rapp, M.: Speed-oblivious online scheduling: knowing (precise) speeds is not necessary. International Conference on Machine Learning pp. 21312\u201321334 (2023)"},{"issue":"4","key":"10200_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3447579","volume":"68","author":"T Lykouris","year":"2021","unstructured":"Lykouris, T., Vassilvitskii, S.: Competitive caching with machine learned advice. J. ACM 68(4), 1\u201325 (2021)","journal-title":"J. ACM"},{"key":"10200_CR23","unstructured":"Mina\u0159\u00edk, J., Sgall, J.: Speed-robust scheduling revisited. In proceedings of International Conference on Approximation Algorithms for Combinatorial Optimization Problems 317, 8:1\u20138:20 (2024)"},{"key":"10200_CR24","unstructured":"Mitzenmacher, M.: Scheduling with predictions and the price of misprediction. Innovations in Theoretical Computer Science Conference 151, 14:1\u201314:18 (2020)"},{"issue":"7","key":"10200_CR25","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1145\/3528087","volume":"65","author":"M Mitzenmacher","year":"2022","unstructured":"Mitzenmacher, M., Vassilvitskii, S.: Algorithms with predictions. Commun. ACM 65(7), 33\u201335 (2022)","journal-title":"Commun. ACM"},{"key":"10200_CR26","doi-asserted-by":"crossref","unstructured":"Pinedo, M.L.: Scheduling: Theory, Algorithms, and Systems, vol.\u00a029. Springer (2012)","DOI":"10.1007\/978-1-4614-2361-4"},{"key":"10200_CR27","first-page":"9684","volume":"31","author":"M Purohit","year":"2018","unstructured":"Purohit, M., Svitkina, Z., Kumar, R.: Improving online algorithms via ml predictions. Adv. Neural. Inf. Process. Syst. 31, 9684\u20139693 (2018)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"issue":"5","key":"10200_CR28","doi-asserted-by":"publisher","first-page":"1243","DOI":"10.1287\/opre.2013.1208","volume":"61","author":"K Rustogi","year":"2013","unstructured":"Rustogi, K., Strusevich, V.A.: Parallel machine scheduling: Impact of adding extra machines. Oper. Res. 61(5), 1243\u20131257 (2013)","journal-title":"Oper. Res."},{"issue":"1","key":"10200_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3340320","volume":"16","author":"C Stein","year":"2019","unstructured":"Stein, C., Zhong, M.: Scheduling when you do not know the number of machines. ACM Trans. Algorithms 16(1), 1\u201320 (2019)","journal-title":"ACM Trans. Algorithms"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-024-10200-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00224-024-10200-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-024-10200-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T06:27:42Z","timestamp":1751956062000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00224-024-10200-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,27]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["10200"],"URL":"https:\/\/doi.org\/10.1007\/s00224-024-10200-z","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-4345090\/v1","asserted-by":"object"}]},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,27]]},"assertion":[{"value":"15 December 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 March 2025","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"16"}}