{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T04:29:38Z","timestamp":1769315378120,"version":"3.49.0"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030835071","type":"print"},{"value":"9783030835088","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-83508-8_4","type":"book-chapter","created":{"date-parts":[[2021,7,30]],"date-time":"2021-07-30T13:05:06Z","timestamp":1627650306000},"page":"43-56","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Online Makespan Minimization with Budgeted Uncertainty"],"prefix":"10.1007","author":[{"given":"Susanne","family":"Albers","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maximilian","family":"Janke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,31]]},"reference":[{"issue":"2","key":"4_CR1","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1137\/S0097539797324874","volume":"29","author":"S Albers","year":"1999","unstructured":"Albers, S.: Better bounds for online scheduling. SIAM J. Comput. 29(2), 459\u2013473 (1999)","journal-title":"SIAM J. Comput."},{"key":"4_CR2","unstructured":"Albers, S., Janke, M.: Scheduling in the random-order model. In: 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"issue":"3","key":"4_CR3","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1016\/j.orl.2007.11.005","volume":"36","author":"MA Aloulou","year":"2008","unstructured":"Aloulou, M.A., Croce, F.D.: Complexity of single machine scheduling problems under scenario-based uncertainty. Oper. Res. Lett. 36(3), 338\u2013342 (2008)","journal-title":"Oper. Res. Lett."},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Bartal, Y., Fiat, A., Karloff, H., Vohra, R.: New algorithms for an ancient scheduling problem. In: Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing, pp. 51\u201358 (1992)","DOI":"10.1145\/129712.129718"},{"issue":"3","key":"4_CR5","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0020-0190(94)00026-3","volume":"50","author":"Y Bartal","year":"1994","unstructured":"Bartal, Y., Karloff, H.J., Rabani, Y.: A better lower bound for on-line scheduling. Inf. Process. Lett. 50(3), 113\u2013116 (1994)","journal-title":"Inf. Process. Lett."},{"key":"4_CR6","doi-asserted-by":"publisher","unstructured":"Bertsimas, D., Sim, M.: Robust discrete optimization and network flows. Math. Program. Ser. B 98(1\u20133), 49\u201371 (2003). https:\/\/doi.org\/10.1007\/s10107-003-0396-4","DOI":"10.1007\/s10107-003-0396-4"},{"issue":"1","key":"4_CR7","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1287\/opre.1030.0065","volume":"52","author":"D Bertsimas","year":"2004","unstructured":"Bertsimas, D., Sim, M.: The price of robustness. Oper. Res. 52(1), 35\u201353 (2004)","journal-title":"Oper. Res."},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-030-39479-0_5","volume-title":"Approximation and Online Algorithms","author":"M Bougeret","year":"2020","unstructured":"Bougeret, M., Jansen, K., Poss, M., Rohwedder, L.: Approximation results for makespan minimization with budgeted uncertainty. In: Bampis, E., Megow, N. (eds.) WAOA 2019. LNCS, vol. 11926, pp. 60\u201371. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-39479-0_5"},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.dam.2018.07.001","volume":"261","author":"M Bougeret","year":"2019","unstructured":"Bougeret, M., Pessoa, A.A., Poss, M.: Robust scheduling with budgeted uncertainty. Discrete Appl. Math. 261, 93\u2013107 (2019)","journal-title":"Discrete Appl. Math."},{"issue":"01","key":"4_CR10","doi-asserted-by":"publisher","first-page":"1540011","DOI":"10.1142\/S0217595915400114","volume":"32","author":"L Chen","year":"2015","unstructured":"Chen, L., Ye, D., Zhang, G.: Approximating the optimal algorithm for online scheduling problems via dynamic programming. Asia-Pac. J. Oper. Res. 32(01), 1540011 (2015)","journal-title":"Asia-Pac. J. Oper. Res."},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Cheng, T.E., Kellerer, H., Kotov, V.: Semi-on-line multiprocessor scheduling with given total processing time. Theor. Comput. Scie. 337(1\u20133), 134\u2013146 (2005)","DOI":"10.1016\/j.tcs.2004.11.018"},{"key":"4_CR12","unstructured":"Cohen, I., Im, S., Panigrahi, D.: Online two-dimensional load balancing. In: 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Dantzig, G.B.: Linear programming under uncertainty. Manage. Sci. 1(3\u20134), 197\u2013206 (1955)","DOI":"10.1287\/mnsc.1.3-4.197"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"D\u00fcrr, C., Erlebach, T., Megow, N., Mei\u00dfner, J.: Scheduling with explorable uncertainty. In: 9th Innovations in Theoretical Computer Science Conference (ITCS 2018). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2018)","DOI":"10.1007\/978-3-319-94418-0_16"},{"issue":"12","key":"4_CR15","doi-asserted-by":"publisher","first-page":"3630","DOI":"10.1007\/s00453-020-00742-2","volume":"82","author":"C D\u00fcrr","year":"2020","unstructured":"D\u00fcrr, C., Erlebach, T., Megow, N., Mei\u00dfner, J.: An adversarial model for scheduling with testing. Algorithmica 82(12), 3630\u20133675 (2020). https:\/\/doi.org\/10.1007\/s00453-020-00742-2","journal-title":"Algorithmica"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Englert, M., \u00d6zmen, D., Westermann, M.: The power of reordering for online minimum makespan scheduling. In: 2008 49th Annual IEEE Symposium on Foundations of Computer Science, pp. 603\u2013612. IEEE (2008)","DOI":"10.1109\/FOCS.2008.46"},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.tcs.2015.11.025","volume":"613","author":"T Erlebach","year":"2016","unstructured":"Erlebach, T., Hoffmann, M., Kammer, F.: Query-competitive algorithms for cheapest set problems under uncertainty. Theor. Comput. Sci. 613, 51\u201364 (2016)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"4_CR18","first-page":"107","volume":"9","author":"U Faigle","year":"1989","unstructured":"Faigle, U., Kern, W., Tur\u00e1n, G.: On the performance of on-line algorithms for partition problems. Acta Cybernetica 9(2), 107\u2013119 (1989)","journal-title":"Acta Cybernetica"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Feder, T., Motwani, R., Panigrahy, R., Olston, C., Widom, J.: Computing the median with uncertainty. In: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, pp. 602\u2013607 (2000)","DOI":"10.1145\/335305.335386"},{"issue":"6","key":"4_CR20","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1002\/1099-1425(200011\/12)3:6<343::AID-JOS54>3.0.CO;2-2","volume":"3","author":"R Fleischer","year":"2000","unstructured":"Fleischer, R., Wahl, M.: On-line scheduling revisited. J. Sched. 3(6), 343\u2013353 (2000)","journal-title":"J. Sched."},{"issue":"2","key":"4_CR21","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1137\/0222026","volume":"22","author":"G Galambos","year":"1993","unstructured":"Galambos, G., Woeginger, G.J.: An on-line scheduling heuristic with better worst-case ratio than Graham\u2019s list scheduling. SIAM J. Comput. 22(2), 349\u2013355 (1993)","journal-title":"SIAM J. Comput."},{"issue":"9","key":"4_CR22","doi-asserted-by":"publisher","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"RL Graham","year":"1966","unstructured":"Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell Syst. Tech. J. 45(9), 1563\u20131581 (1966)","journal-title":"Bell Syst. Tech. J."},{"key":"4_CR23","unstructured":"Gupta, M., Sabharwal, Y., Sen, S.: The update complexity of selection and related problems. arXiv preprint arXiv:1108.5525 (2011)"},{"issue":"1","key":"4_CR24","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1145\/7531.7535","volume":"34","author":"DS Hochbaum","year":"1987","unstructured":"Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems theoretical and practical results. J. ACM (JACM) 34(1), 144\u2013162 (1987)","journal-title":"J. ACM (JACM)"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Im, S., Kell, N., Kulkarni, J., Panigrahi, D.: Tight bounds for online vector scheduling. In: 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, pp. 525\u2013544. IEEE (2015)","DOI":"10.1109\/FOCS.2015.39"},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"Kahan, S.: A model for data in motion. In: Proceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing, pp. 265\u2013277 (1991)","DOI":"10.1145\/103418.103449"},{"issue":"2","key":"4_CR27","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1006\/jagm.1996.0019","volume":"20","author":"DR Karger","year":"1996","unstructured":"Karger, D.R., Phillips, S.J., Torng, E.: A better algorithm for an ancient scheduling problem. J. Algor. 20(2), 400\u2013430 (1996)","journal-title":"J. Algor."},{"issue":"1","key":"4_CR28","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.ejor.2011.08.029","volume":"217","author":"A Kasperski","year":"2012","unstructured":"Kasperski, A., Kurpisz, A., Zieli\u0144ski, P.: Approximating a two-machine flow shop scheduling under discrete scenario uncertainty. Eur. J. Oper. Res. 217(1), 36\u201343 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"4_CR29","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-642-31724-8_9","volume-title":"Advances in Computational Intelligence","author":"A Kasperski","year":"2012","unstructured":"Kasperski, A., Kurpisz, A., Zieli\u0144ski, P.: Parallel machine scheduling under uncertainty. In: Greco, S., Bouchon-Meunier, B., Coletti, G., Fedrizzi, M., Matarazzo, B., Yager, R.R. (eds.) IPMU 2012. CCIS, vol. 300, pp. 74\u201383. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31724-8_9"},{"key":"4_CR30","doi-asserted-by":"crossref","unstructured":"Khanna, S., Tan, W.C.: On computing functions with uncertainty. In: Proceedings of the Twentieth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 171\u2013182 (2001)","DOI":"10.1145\/375551.375577"},{"key":"4_CR31","doi-asserted-by":"publisher","unstructured":"Lenstra, J.K., Shmoys, D.B., Tardos, E.: Approximation algorithms for scheduling unrelated parallel machines. Math. Program. 46(1\u20133), 259\u2013271 (1990). https:\/\/doi.org\/10.1007\/BF01585745","DOI":"10.1007\/BF01585745"},{"key":"4_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-540-85363-3_13","volume-title":"Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques","author":"M Mastrolilli","year":"2008","unstructured":"Mastrolilli, M., Mutsanas, N., Svensson, O.: Approximating single machine scheduling with scenarios. In: Goel, A., Jansen, K., Rolim, J.D.P., Rubinfeld, R. (eds.) APPROX\/RANDOM-2008. LNCS, vol. 5171, pp. 153\u2013164. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85363-3_13"},{"key":"4_CR33","volume-title":"Offering a Precision-Performance Tradeoff for Aggregation Queries Over Replicated Data","author":"C Olston","year":"2000","unstructured":"Olston, C., Widom, J.: Offering a Precision-Performance Tradeoff for Aggregation Queries Over Replicated Data. Tech. rep, Stanford (2000)"},{"key":"4_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-030-24766-9_6","volume-title":"Algorithms and Data Structures","author":"A Basu Roy","year":"2019","unstructured":"Basu Roy, A., Bougeret, M., Goldberg, N., Poss, M.: Approximating robust bin packing with budgeted uncertainty. In: Friggstad, Z., Sack, J.-R., Salavatipour, M.R. (eds.) WADS 2019. LNCS, vol. 11646, pp. 71\u201384. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-24766-9_6"},{"key":"4_CR35","unstructured":"Rudin, J.F.: Improved bounds for the on-line scheduling problem (2001)"},{"issue":"2","key":"4_CR36","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1287\/moor.1090.0381","volume":"34","author":"P Sanders","year":"2009","unstructured":"Sanders, P., Sivadasan, N., Skutella, M.: Online scheduling with bounded migration. Math. Oper. Res. 34(2), 481\u2013498 (2009)","journal-title":"Math. Oper. Res."},{"key":"4_CR37","doi-asserted-by":"crossref","unstructured":"Singla, S.: The price of information in combinatorial optimization. In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 2523\u20132532. SIAM (2018)","DOI":"10.1137\/1.9781611975031.161"},{"issue":"6","key":"4_CR38","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/s10951-015-0418-0","volume":"18","author":"B Tadayon","year":"2015","unstructured":"Tadayon, B., Smith, J.C.: Algorithms and complexity analysis for robust single-machine scheduling problems. J. Sched. 18(6), 575\u2013592 (2015). https:\/\/doi.org\/10.1007\/s10951-015-0418-0","journal-title":"J. Sched."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-83508-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,18]],"date-time":"2022-02-18T11:25:34Z","timestamp":1645183534000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-83508-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030835071","9783030835088"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-83508-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"31 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Algorithms and Data Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 August 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/projects.cs.dal.ca\/wads2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"123","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":"47","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":"38% - 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.1","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":"13","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)"}}]}}