{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T00:08:29Z","timestamp":1778458109684,"version":"3.51.4"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032186591","type":"print"},{"value":"9783032186607","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-18660-7_37","type":"book-chapter","created":{"date-parts":[[2026,5,10]],"date-time":"2026-05-10T23:20:21Z","timestamp":1778455221000},"page":"686-703","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Online Makespan Minimization: Beat LPT by\u00a0Dynamic Locking"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-0177-9426","authenticated-orcid":false,"given":"Zhaozi","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-3200-9575","authenticated-orcid":false,"given":"Zhiwei","family":"Ying","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9330-1926","authenticated-orcid":false,"given":"Yuhao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,1]]},"reference":[{"key":"37_CR1","doi-asserted-by":"publisher","unstructured":"Albers, S.: Better bounds for online scheduling. SIAM J. Comput. 29(2), 459\u2013473 (1999). https:\/\/doi.org\/10.1137\/S0097539797324874","DOI":"10.1137\/S0097539797324874"},{"key":"37_CR2","doi-asserted-by":"publisher","unstructured":"Albers, S., Hellwig, M.: Online makespan minimization with parallel schedules. Algorithmica 78(2), 492\u2013520 (2017). https:\/\/doi.org\/10.1007\/s00453-016-0172-5","DOI":"10.1007\/s00453-016-0172-5"},{"key":"37_CR3","doi-asserted-by":"publisher","unstructured":"Aspnes, J., Azar, Y., Fiat, A., Plotkin, S.A., Waarts, O.: On-line load balancing with applications to machine scheduling and virtual circuit routing. In: Kosaraju, S.R., Johnson, D.S., Aggarwal, A. (eds.) Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 16\u201318 May 1993, San Diego, CA, USA, pp. 623\u2013631. ACM (1993). https:\/\/doi.org\/10.1145\/167088.167248","DOI":"10.1145\/167088.167248"},{"key":"37_CR4","doi-asserted-by":"publisher","unstructured":"Bartal, Y., Fiat, A., Karloff, H.J., Vohra, R.: New algorithms for an ancient scheduling problem. J. Comput. Syst. Sci. 51(3), 359\u2013366 (1995). https:\/\/doi.org\/10.1006\/jcss.1995.1074","DOI":"10.1006\/jcss.1995.1074"},{"key":"37_CR5","doi-asserted-by":"publisher","unstructured":"Berman, P., Charikar, M., Karpinski, M.: On-line load balancing for related machines. J. Algorithms 35(1), 108\u2013121 (2000). https:\/\/doi.org\/10.1006\/JAGM.1999.1070","DOI":"10.1006\/JAGM.1999.1070"},{"key":"37_CR6","doi-asserted-by":"publisher","unstructured":"Chen, B., Vestjens, A.P.A.: Scheduling on identical machines: how good is LPT in an on-line setting? Oper. Res. Lett. 21(4), 165\u2013169 (1997). https:\/\/doi.org\/10.1016\/S0167-6377(97)00040-0","DOI":"10.1016\/S0167-6377(97)00040-0"},{"key":"37_CR7","doi-asserted-by":"publisher","unstructured":"Chen, B., van Vliet, A., Woeginger, G.J.: An optimal algorithm for preemptive on-line scheduling. Oper. Res. Lett. 18(3), 127\u2013131 (1995). https:\/\/doi.org\/10.1016\/0167-6377(95)00039-9","DOI":"10.1016\/0167-6377(95)00039-9"},{"key":"37_CR8","doi-asserted-by":"publisher","unstructured":"Dwibedy, D., Mohanty, R.: Online list scheduling for makespan minimization: a review of the state-of-the-art results, research challenges and open problems. SIGACT News 53(2), 84\u2013105 (2022). https:\/\/doi.org\/10.1145\/3544979.3544993","DOI":"10.1145\/3544979.3544993"},{"key":"37_CR9","doi-asserted-by":"publisher","unstructured":"Ebenlendr, T., Sgall, J.: A lower bound on deterministic online algorithms for scheduling on related machines without preemption. Theory Comput. Syst. 56(1), 73\u201381 (2015). https:\/\/doi.org\/10.1007\/s00224-013-9451-6","DOI":"10.1007\/s00224-013-9451-6"},{"key":"37_CR10","doi-asserted-by":"publisher","unstructured":"Englert, M., \u00d6zmen, D., Westermann, M.: The power of reordering for online minimum makespan scheduling. SIAM J. Comput. 43(3), 1220\u20131237 (2014). https:\/\/doi.org\/10.1137\/130919738","DOI":"10.1137\/130919738"},{"key":"37_CR11","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1137\/0222026","DOI":"10.1137\/0222026"},{"issue":"2","key":"37_CR12","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"RL Graham","year":"1969","unstructured":"Graham, R.L.: Bounds on multiprocessing timing anomalies. J. SIAM Appl. Math. 17(2), 416\u2013429 (1969)","journal-title":"J. SIAM Appl. Math."},{"key":"37_CR13","doi-asserted-by":"publisher","unstructured":"Huang, Z., Kang, N., Tang, Z.G., Wu, X., Zhang, Y.: Online makespan minimization: the power of restart. In: Blais, E., Jansen, K., Rolim, J.D.P., Steurer, D. (eds.) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX\/RANDOM 2018, 20\u201322 August 2018 - Princeton, NJ, USA. LIPIcs, vol.\u00a0116, pp. 14:1\u201314:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.APPROX-RANDOM.2018.14","DOI":"10.4230\/LIPIcs.APPROX-RANDOM.2018.14"},{"key":"37_CR14","doi-asserted-by":"publisher","unstructured":"III, J.F.R., Chandrasekaran, R.: Improved bounds for the online scheduling problem. SIAM J. Comput. 32(3), 717\u2013735 (2003). https:\/\/doi.org\/10.1137\/S0097539702403438","DOI":"10.1137\/S0097539702403438"},{"key":"37_CR15","doi-asserted-by":"publisher","unstructured":"Jez, L., Schwartz, J., Sgall, J., B\u00e9k\u00e9si, J.: Lower bounds for online makespan minimization on a small number of related machines. J. Sched. 16(5), 539\u2013547 (2013). https:\/\/doi.org\/10.1007\/s10951-012-0288-7","DOI":"10.1007\/s10951-012-0288-7"},{"key":"37_CR16","doi-asserted-by":"publisher","unstructured":"Karger, D.R., Phillips, S.J., Torng, E.: A better algorithm for an ancient scheduling problem. J. Algorithms 20(2), 400\u2013430 (1996). https:\/\/doi.org\/10.1006\/jagm.1996.0019","DOI":"10.1006\/jagm.1996.0019"},{"key":"37_CR17","doi-asserted-by":"publisher","unstructured":"Li, S., Zhang, Y.: On-line scheduling on parallel machines to minimize the makespan. J. Syst. Sci. Complex. 29(2), 472\u2013477 (2016). https:\/\/doi.org\/10.1007\/S11424-015-3252-8","DOI":"10.1007\/S11424-015-3252-8"},{"key":"37_CR18","doi-asserted-by":"publisher","unstructured":"Li, W., Yuan, J.: LPT online strategy for parallel-machine scheduling with kind release times. Optim. Lett. 10(1), 159\u2013168 (2016). https:\/\/doi.org\/10.1007\/s11590-015-0862-y","DOI":"10.1007\/s11590-015-0862-y"},{"key":"37_CR19","doi-asserted-by":"publisher","unstructured":"Noga, J., Seiden, S.S.: An optimal online algorithm for scheduling two machines with release times. Theor. Comput. Sci. 268(1), 133\u2013143 (2001). https:\/\/doi.org\/10.1016\/S0304-3975(00)00264-4","DOI":"10.1016\/S0304-3975(00)00264-4"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-18660-7_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,10]],"date-time":"2026-05-10T23:20:22Z","timestamp":1778455222000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-18660-7_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032186591","9783032186607"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-18660-7_37","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":"1 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WINE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web and Internet Economics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New Brunswick, NJ","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2025","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":"wine2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wine2025.cs.rutgers.edu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}