{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:58:03Z","timestamp":1781305083953,"version":"3.54.1"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032286901","type":"print"},{"value":"9783032286918","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-28691-8_20","type":"book-chapter","created":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:34:33Z","timestamp":1781303673000},"page":"299-314","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Stochastic Load Balancing with\u00a0Machine Reservations"],"prefix":"10.1007","author":[{"given":"David","family":"Alem\u00e1n Espinosa","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Naveen","family":"Garg","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sharat","family":"Ibrahimpur","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Neil","family":"Olver","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chaitanya","family":"Swamy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,13]]},"reference":[{"key":"20_CR1","doi-asserted-by":"publisher","unstructured":"Antoniadis, A., Hoeksma, R., Schewior, K., Uetz, M.: Stochastic scheduling with Bernoulli-type jobs through policy stratification. In: Proceedings of the 66th Symposium on Foundations of Computer Science, pp. 2446\u20132469 (2025). https:\/\/doi.org\/10.1109\/FOCS63196.2025.00128","DOI":"10.1109\/FOCS63196.2025.00128"},{"issue":"1","key":"20_CR2","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1137\/S0097539795288490","volume":"29","author":"Y Azar","year":"1999","unstructured":"Azar, Y., Broder, A.Z., Karlin, A.R., Upfal, E.: Balanced allocations. SIAM J. Comput. 29(1), 180\u2013200 (1999). https:\/\/doi.org\/10.1137\/S0097539795288490","journal-title":"SIAM J. Comput."},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Birge, J.R., Louveaux, F.: Introduction to Stochastic Programming. Springer Science & Business Media (2011)","DOI":"10.1007\/978-1-4614-0237-4"},{"issue":"1","key":"20_CR4","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1145\/322234.322242","volume":"28","author":"J Bruno","year":"1981","unstructured":"Bruno, J., Downey, P., Frederickson, G.N.: Sequencing tasks with exponential service times to minimize the expected flow time or Makespan. J. ACM 28(1), 100\u2013113 (1981). https:\/\/doi.org\/10.1145\/322234.322242","journal-title":"J. ACM"},{"key":"20_CR5","doi-asserted-by":"publisher","unstructured":"Chen, L., Megow, N., Rischke, R., Stougie, L.: Stochastic and robust scheduling in the cloud. In: Proceedings of the 18th International Conference on Approximation Algorithms for Combinatorial Optimization Problems. vol. 40, pp. 175\u2013186 (2015). https:\/\/doi.org\/10.4230\/LIPIcs.APPROX-RANDOM.2015.175","DOI":"10.4230\/LIPIcs.APPROX-RANDOM.2015.175"},{"key":"20_CR6","doi-asserted-by":"publisher","unstructured":"De, A., Khanna, S., Li, H., Nikpey, H.: An efficient PTAS for stochastic load balancing with poisson jobs. In: Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, pp. 37:1\u201337:18 (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2020.37","DOI":"10.4230\/LIPIcs.ICALP.2020.37"},{"issue":"3","key":"20_CR7","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.orl.2019.03.007","volume":"47","author":"F Eberle","year":"2019","unstructured":"Eberle, F., Fischer, F., Matuschke, J., Megow, N.: On index policies for stochastic minsum scheduling. Oper. Res. Lett. 47(3), 213\u2013218 (2019). https:\/\/doi.org\/10.1016\/j.orl.2019.03.007","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"20_CR8","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/S10107-024-02132-W","volume":"210","author":"F Eberle","year":"2025","unstructured":"Eberle, F., Gupta, A., Megow, N., Moseley, B., Zhou, R.: Configuration balancing for stochastic requests. Math. Program. 210(1), 243\u2013279 (2025). https:\/\/doi.org\/10.1007\/S10107-024-02132-W","journal-title":"Math. Program."},{"key":"20_CR9","doi-asserted-by":"publisher","unstructured":"Goel, A., Indyk, P.: Stochastic load balancing and related problems. In: Proceedings of the 40th Foundations of Computer Science, pp. 579\u2013586 (1999). https:\/\/doi.org\/10.1109\/SFFCS.1999.814632","DOI":"10.1109\/SFFCS.1999.814632"},{"issue":"1","key":"20_CR10","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1287\/moor.2019.1049","volume":"46","author":"A Gupta","year":"2021","unstructured":"Gupta, A., Kumar, A., Nagarajan, V., Shen, X.: Stochastic load balancing on unrelated machines. Math. Oper. Res. 46(1), 115\u2013133 (2021). https:\/\/doi.org\/10.1287\/moor.2019.1049","journal-title":"Math. Oper. Res."},{"key":"20_CR11","doi-asserted-by":"publisher","unstructured":"Gupta, A., Moseley, B., Zhou, R.: Minimizing completion times for stochastic jobs via batched free times. In: Proceedings of the 34th Symposium on Discrete Algorithms, pp. 1905\u20131930 (2023). https:\/\/doi.org\/10.1137\/1.9781611977554.ch73","DOI":"10.1137\/1.9781611977554.ch73"},{"key":"20_CR12","doi-asserted-by":"publisher","unstructured":"Gupta, A., P\u00e1l, M., Ravi, R., Sinha, A.: Boosted sampling: approximation algorithms for stochastic optimization. In: Proceedings of the 36th Symposium on Theory of Computing, pp. 417\u2013426 (2004). https:\/\/doi.org\/10.1145\/1007352.1007419","DOI":"10.1145\/1007352.1007419"},{"issue":"2","key":"20_CR13","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1287\/moor.2019.0999","volume":"45","author":"V Gupta","year":"2020","unstructured":"Gupta, V., Moseley, B., Uetz, M., Xie, Q.: Greed works-online algorithms for unrelated machine stochastic scheduling. Math. Oper. Res. 45(2), 497\u2013516 (2020). https:\/\/doi.org\/10.1287\/moor.2019.0999","journal-title":"Math. Oper. Res."},{"key":"20_CR14","doi-asserted-by":"publisher","unstructured":"Ibrahimpur, S., Swamy, C.: Approximation algorithms for stochastic minimum-norm combinatorial optimization. In: Proceedings of the 61st Foundations of Computer Science, pp. 966\u2013977 (2020). https:\/\/doi.org\/10.1109\/FOCS46700.2020.00094","DOI":"10.1109\/FOCS46700.2020.00094"},{"key":"20_CR15","doi-asserted-by":"publisher","unstructured":"Ibrahimpur, S., Swamy, C.: Minimum-norm load balancing is (almost) as easy as minimizing Makespan. In: Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, pp. 81:1\u201381:20 (2021). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2021.81","DOI":"10.4230\/LIPIcs.ICALP.2021.81"},{"key":"20_CR16","doi-asserted-by":"publisher","unstructured":"Ibrahimpur, S., Swamy, C.: A simple approximation algorithm for vector scheduling and applications to stochastic min-norm load balancing. In: Proceedings of the 5th Symposium on Simplicity in Algorithms, pp. 247\u2013256 (2022). https:\/\/doi.org\/10.1137\/1.9781611977066.18","DOI":"10.1137\/1.9781611977066.18"},{"key":"20_CR17","doi-asserted-by":"publisher","unstructured":"Im, S., Kell, N., Panigrahi, D., Shadloo, M.: Online load balancing on related machines. In: Proceedings of the 50th Symposium on the Theory of Computing, pp. 30\u201343 (2018). https:\/\/doi.org\/10.1145\/3188745.3188966","DOI":"10.1145\/3188745.3188966"},{"key":"20_CR18","doi-asserted-by":"publisher","unstructured":"Im, S., Moseley, B., Pruhs, K.: Stochastic scheduling of heavy-tailed jobs. In: Proceedings of the 32nd Symposium on Theoretical Aspects of Computer Science, vol. 30, pp. 474\u2013486 (2015). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2015.474","DOI":"10.4230\/LIPIcs.STACS.2015.474"},{"issue":"1","key":"20_CR19","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1137\/S0097539797329142","volume":"30","author":"JM Kleinberg","year":"2000","unstructured":"Kleinberg, J.M., Rabani, Y., Tardos, \u00c9.: Allocating bandwidth for Bursty connections. SIAM J. Comput. 30(1), 191\u2013217 (2000). https:\/\/doi.org\/10.1137\/S0097539797329142","journal-title":"SIAM J. Comput."},{"key":"20_CR20","doi-asserted-by":"publisher","unstructured":"Lenstra, J.K., Shmoys, D.B., Tardos, \u00c9.: Approximation algorithms for scheduling unrelated parallel machines. Math. Program. 46, 259\u2013271 (1990). https:\/\/doi.org\/10.1007\/BF01585745","DOI":"10.1007\/BF01585745"},{"key":"20_CR21","doi-asserted-by":"publisher","unstructured":"Linhares, A., Olver, N., Swamy, C., Zenklusen, R.: Approximate multi-matroid intersection via iterative refinement. Math. Program., 397\u2013418 (2020). https:\/\/doi.org\/10.1007\/s10107-020-01524-y","DOI":"10.1007\/s10107-020-01524-y"},{"key":"20_CR22","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M., Richa, A.W., Sitaraman, R.: The power of two random choices: a survey of techniques and results. In: Handbook of Randomized Computing, Volume I-II, Chapter 9. Kluwer Academic Publishers (2001). https:\/\/www.eecs.harvard.edu\/%7Emichaelm\/postscripts\/handbook2001.pdf","DOI":"10.1007\/978-1-4615-0013-1_9"},{"issue":"6","key":"20_CR23","doi-asserted-by":"publisher","first-page":"924","DOI":"10.1145\/331524.331530","volume":"46","author":"RH M\u00f6hring","year":"1999","unstructured":"M\u00f6hring, R.H., Schulz, A.S., Uetz, M.: Approximation in stochastic scheduling: the power of LP-based priority policies. J. ACM 46(6), 924\u2013942 (1999). https:\/\/doi.org\/10.1145\/331524.331530","journal-title":"J. ACM"},{"key":"20_CR24","doi-asserted-by":"publisher","unstructured":"Molinaro, M.: Stochastic $$\\ell _p$$ load balancing and moment problems via the L-function method. In: Proceedings of the 30th Symposium on Discrete Algorithms, pp. 343\u2013354 (2019). https:\/\/doi.org\/10.5555\/3310435.3310457","DOI":"10.5555\/3310435.3310457"},{"key":"20_CR25","unstructured":"Pinedo, M.L.: Offline deterministic scheduling, stochastic scheduling, and online deterministic scheduling. In: Handbook of Scheduling - Algorithms, Models, and Performance Analysis, Chapter 38. Chapman and Hall\/CRC (2004)"},{"key":"20_CR26","doi-asserted-by":"publisher","unstructured":"Sagnol, G., Schmidt genannt Waldschmidt, D.: Restricted adaptivity in stochastic scheduling. In: Proceedings of the 29th European Symposium on Algorithms, pp. 79:1\u201379:14 (2021). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2021.79","DOI":"10.4230\/LIPIcs.ESA.2021.79"},{"issue":"6","key":"20_CR27","doi-asserted-by":"publisher","first-page":"978","DOI":"10.1145\/1217856.1217860","volume":"53","author":"DB Shmoys","year":"2006","unstructured":"Shmoys, D.B., Swamy, C.: An approximation scheme for stochastic linear programming and its application to stochastic integer programs. J. ACM 53(6), 978\u20131012 (2006). https:\/\/doi.org\/10.1145\/1217856.1217860","journal-title":"J. ACM"},{"key":"20_CR28","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/BF01585178","volume":"62","author":"DB Shmoys","year":"1993","unstructured":"Shmoys, D.B., Tardos, E.: An approximation algorithm for the generalized assignment problem. Math. Program. 62, 461\u2013474 (1993). https:\/\/doi.org\/10.1007\/BF01585178","journal-title":"Math. Program."},{"issue":"1","key":"20_CR29","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1145\/1122480.1122493","volume":"37","author":"C Swamy","year":"2006","unstructured":"Swamy, C., Shmoys, D.B.: Approximation algorithms for 2-stage stochastic optimization problems. ACM SIGACT News 37(1), 33\u201346 (2006). https:\/\/doi.org\/10.1145\/1122480.1122493","journal-title":"ACM SIGACT News"},{"key":"20_CR30","first-page":"33","volume-title":"Scheduling Theory and Its Applications","author":"G Weiss","year":"1995","unstructured":"Weiss, G.: A tutorial in stochastic scheduling. In: Chretienne, P., Coffman, E., Lenstra, J., Liu, Z. (eds.) Scheduling Theory and Its Applications, pp. 33\u201364. Wiley, New York (1995)"},{"issue":"1","key":"20_CR31","doi-asserted-by":"publisher","first-page":"187","DOI":"10.2307\/3212936","volume":"17","author":"G Weiss","year":"1980","unstructured":"Weiss, G., Pinedo, M.: Scheduling tasks with exponential service times on non-identical processors to minimize various cost functions. J. Appl. Probab. 17(1), 187\u2013202 (1980). https:\/\/doi.org\/10.2307\/3212936","journal-title":"J. Appl. Probab."}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-28691-8_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:34:36Z","timestamp":1781303676000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-28691-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032286901","9783032286918"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-28691-8_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"13 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Padua","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/events.math.unipd.it\/ipco2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}