{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T12:49:16Z","timestamp":1777121356303,"version":"3.51.4"},"reference-count":40,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T00:00:00Z","timestamp":1776988800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Optimization"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.disopt.2026.100954","type":"journal-article","created":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T08:47:40Z","timestamp":1777106860000},"page":"100954","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Online speed-robust scheduling"],"prefix":"10.1016","volume":"61","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6761-8521","authenticated-orcid":false,"given":"Leah","family":"Epstein","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.disopt.2026.100954_b1","doi-asserted-by":"crossref","first-page":"9:1","DOI":"10.1145\/3340320","article-title":"Scheduling when you do not know the number of machines","volume":"16","author":"Stein","year":"2020","journal-title":"ACM Trans. Algorithms"},{"issue":"2","key":"10.1016\/j.disopt.2026.100954_b2","doi-asserted-by":"crossref","first-page":"1009","DOI":"10.1007\/s10107-022-01829-0","article-title":"Speed-robust scheduling: sand, bricks, and rocks","volume":"197","author":"Eberle","year":"2023","journal-title":"Math. Program."},{"key":"10.1016\/j.disopt.2026.100954_b3","unstructured":"J. Mina\u0159\u00edk, J. Sgall, Speed-robust scheduling revisited, in: Proc. of the 27th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX2024, 2024."},{"key":"10.1016\/j.disopt.2026.100954_b4","doi-asserted-by":"crossref","unstructured":"L. Yu, Z. Tan, A simple algorithm for scheduling unit jobs with unknown number of machines, in: Proc. of the 17th Annual International Conference on Combinatorial Optimization and Applications, COCOA2024, 2024, pp. 31\u201343.","DOI":"10.1007\/978-981-96-4445-2_3"},{"issue":"2","key":"10.1016\/j.disopt.2026.100954_b5","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/s00224-024-10200-z","article-title":"Scheduling with speed predictions","volume":"69","author":"Balkanski","year":"2025","journal-title":"Theory Comput. Syst."},{"key":"10.1016\/j.disopt.2026.100954_b6","unstructured":"M. Buchem, F. Eberle, H.K. Kasuya Rosado, K. Schewior, A. Wiese, Scheduling on a stochastic number of machines, in: Proc. of the 27th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX2024, 2024."},{"key":"10.1016\/j.disopt.2026.100954_b7","unstructured":"L. Epstein, A. Levin, Efficient approximation schemes for scheduling on a stochastic number of machines, in: Proc. of the 42nd International Symposium on Theoretical Aspects of Computer Science, STACS2025, 2025, pp. 31:1\u201331:18."},{"key":"10.1016\/j.disopt.2026.100954_b8","doi-asserted-by":"crossref","DOI":"10.1007\/s10100-025-00968-x","article-title":"Variants and objectives for ordinal scheduling","author":"Epstein","year":"2025","journal-title":"Central Eur. J. Oper. Res."},{"issue":"2","key":"10.1016\/j.disopt.2026.100954_b9","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1137\/0222026","article-title":"An on-line scheduling heuristic with better worst case ratio than Graham\u2019s list scheduling","volume":"22","author":"Galambos","year":"1993","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/j.disopt.2026.100954_b10","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0020-0190(94)00026-3","article-title":"A better lower bound for on-line scheduling","volume":"50","author":"Bartal","year":"1994","journal-title":"Inform. Process. Lett."},{"issue":"4","key":"10.1016\/j.disopt.2026.100954_b11","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0167-6377(94)90071-X","article-title":"New lower and upper bounds for on-line scheduling","volume":"16","author":"Chen","year":"1994","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"10.1016\/j.disopt.2026.100954_b12","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1006\/jcss.1995.1074","article-title":"New algorithms for an ancient scheduling problem","volume":"51","author":"Bartal","year":"1995","journal-title":"J. Comput. System Sci."},{"issue":"2","key":"10.1016\/j.disopt.2026.100954_b13","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1006\/jagm.1996.0019","article-title":"A better algorithm for an ancient scheduling problem","volume":"20","author":"Karger","year":"1996","journal-title":"J. Algorithms"},{"issue":"2","key":"10.1016\/j.disopt.2026.100954_b14","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1137\/S0097539797324874","article-title":"Better bounds for online scheduling","volume":"29","author":"Albers","year":"1999","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.disopt.2026.100954_b15","unstructured":"T. Gormley, N. Reingold, E. Torng, J. Westbrook, Generating adversaries for request-answer games, in: Proc. of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA2000, 2000, pp. 564\u2013565."},{"issue":"6","key":"10.1016\/j.disopt.2026.100954_b16","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1002\/1099-1425(200011\/12)3:6<343::AID-JOS54>3.0.CO;2-2","article-title":"Online scheduling revisited","volume":"3","author":"Fleischer","year":"2000","journal-title":"J. Sched."},{"key":"10.1016\/j.disopt.2026.100954_b17","series-title":"Improved bounds for the on-line scheduling problem","author":"Rudin III","year":"2001"},{"issue":"3","key":"10.1016\/j.disopt.2026.100954_b18","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1137\/S0097539702403438","article-title":"Improved bounds for the online scheduling problem","volume":"32","author":"Rudin III","year":"2003","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/j.disopt.2026.100954_b19","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1137\/0209007","article-title":"Bounds for list schedules on uniform processors","volume":"9","author":"Cho","year":"1980","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/j.disopt.2026.100954_b20","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1145\/258128.258201","article-title":"On-line routing of virtual circuits with applications to load balancing and machine scheduling","volume":"44","author":"Aspnes","year":"1997","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/j.disopt.2026.100954_b21","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1137\/S0097539799527969","article-title":"An on-line algorithm for some uniform processor scheduling","volume":"27","author":"Li","year":"1998","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/j.disopt.2026.100954_b22","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1006\/jagm.1999.1070","article-title":"On-line load balancing for related machines","volume":"35","author":"Berman","year":"2000","journal-title":"J. Algorithms"},{"issue":"2","key":"10.1016\/j.disopt.2026.100954_b23","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1002\/jos.60","article-title":"Randomized on-line scheduling on two uniform machines","volume":"4","author":"Epstein","year":"2001","journal-title":"J. Sched."},{"issue":"3","key":"10.1016\/j.disopt.2026.100954_b24","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/j.dam.2011.10.001","article-title":"Online scheduling on three uniform machines","volume":"160","author":"Cai","year":"2012","journal-title":"Discrete Appl. Math."},{"issue":"7","key":"10.1016\/j.disopt.2026.100954_b25","doi-asserted-by":"crossref","first-page":"1551","DOI":"10.1007\/s11590-011-0335-x","article-title":"On the optimality of list scheduling for online uniform machines scheduling","volume":"6","author":"Han","year":"2012","journal-title":"Optim. Lett."},{"issue":"5","key":"10.1016\/j.disopt.2026.100954_b26","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1007\/s10951-012-0288-7","article-title":"Lower bounds for online makespan minimization on a small number of related machines","volume":"16","author":"Je\u017c","year":"2013","journal-title":"J. Sched."},{"issue":"1","key":"10.1016\/j.disopt.2026.100954_b27","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/s00224-013-9451-6","article-title":"A lower bound on deterministic online algorithms for scheduling on related machines without preemption","volume":"56","author":"Ebenlendr","year":"2015","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"10.1016\/j.disopt.2026.100954_b28","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1287\/moor.6.1.74","article-title":"Analysis of greedy solutions for a replacement part sequencing problem","volume":"6","author":"Friesen","year":"1981","journal-title":"Math. Oper. Res."},{"issue":"2","key":"10.1016\/j.disopt.2026.100954_b29","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1137\/0603019","article-title":"Scheduling to maximize the minimum processor finish time in a multiprocessor system","volume":"3","author":"Deuermeyer","year":"1982","journal-title":"SIAM J. Discrete Math."},{"issue":"5","key":"10.1016\/j.disopt.2026.100954_b30","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0167-6377(92)90004-M","article-title":"The exact LPT-bound for maximizing the minimum completion time","volume":"11","author":"Csirik","year":"1992","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"10.1016\/j.disopt.2026.100954_b31","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0167-6377(96)00055-7","article-title":"A polynomial time approximation scheme for maximizing the minimum machine completion time","volume":"20","author":"Woeginger","year":"1997","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/j.disopt.2026.100954_b32","doi-asserted-by":"crossref","unstructured":"Y. Azar, L. Epstein, On-line machine covering, in: Proc. of the 5th Annual European Symposium, ESA1997, 1997, pp. 23\u201336.","DOI":"10.1007\/3-540-63397-9_3"},{"issue":"2","key":"10.1016\/j.disopt.2026.100954_b33","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1002\/(SICI)1099-1425(199808)1:2<67::AID-JOS6>3.0.CO;2-Y","article-title":"On-line machine covering","volume":"1","author":"Azar","year":"1998","journal-title":"J. Sched."},{"issue":"2","key":"10.1016\/j.disopt.2026.100954_b34","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/j.dam.2005.02.002","article-title":"Tight bounds for bandwidth allocation on two links","volume":"148","author":"Epstein","year":"2005","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.disopt.2026.100954_b35","doi-asserted-by":"crossref","unstructured":"N. Bansal, M. Sviridenko, The Santa Claus problem, in: Proc. of the 38th Annual ACM Symposium on Theory of Computing, STOC2006, 2006, pp. 31\u201340.","DOI":"10.1145\/1132516.1132522"},{"issue":"9","key":"10.1016\/j.disopt.2026.100954_b36","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","article-title":"Bounds for certain multiprocessing anomalies","volume":"45","author":"Graham","year":"1966","journal-title":"Bell Syst. Tech. J."},{"issue":"2","key":"10.1016\/j.disopt.2026.100954_b37","first-page":"107","article-title":"On the performance of online algorithms for partition problems","volume":"9","author":"Faigle","year":"1989","journal-title":"Acta Cybernet."},{"key":"10.1016\/j.disopt.2026.100954_b38","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1007\/s10951-025-00843-2","article-title":"Lower bounds for online scheduling on four processors","volume":"28","author":"Braun","year":"2025","journal-title":"J. Sched."},{"key":"10.1016\/j.disopt.2026.100954_b39","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1137\/0217033","article-title":"A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach","volume":"17","author":"Hochbaum","year":"1988","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/j.disopt.2026.100954_b40","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0167-6377(99)00076-0","article-title":"A comment on scheduling on uniform machines under chain-type precedence constraints","volume":"26","author":"Woeginger","year":"2000","journal-title":"Oper. Res. Lett."}],"container-title":["Discrete Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1572528626000277?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1572528626000277?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T12:25:39Z","timestamp":1777119939000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1572528626000277"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":40,"alternative-id":["S1572528626000277"],"URL":"https:\/\/doi.org\/10.1016\/j.disopt.2026.100954","relation":{},"ISSN":["1572-5286"],"issn-type":[{"value":"1572-5286","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Online speed-robust scheduling","name":"articletitle","label":"Article Title"},{"value":"Discrete Optimization","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disopt.2026.100954","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author. Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"100954"}}