{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:30:52Z","timestamp":1757619052356,"version":"3.44.0"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031987397"},{"type":"electronic","value":"9783031987403"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-98740-3_32","type":"book-chapter","created":{"date-parts":[[2025,7,17]],"date-time":"2025-07-17T23:48:50Z","timestamp":1752796130000},"page":"446-458","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Streaming Algorithms for\u00a0Scheduling Jobs with\u00a0Priorities"],"prefix":"10.1007","author":[{"given":"Bin","family":"Fu","sequence":"first","affiliation":[]},{"given":"Yumei","family":"Huo","sequence":"additional","affiliation":[]},{"given":"Hairong","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,7,18]]},"reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"Beigel, R., Fu, B.: A dense hierarchy of sublinear time approximation schemes for bin packing. In: Proceedings of the 6th International Frontiers in Algorithmics, and Proceedings of the 8th International Conference on Algorithmic Aspects in Information and Management. FAW-AAIM\u201912, pp. 172\u2013181. Springer-Verlag, Beijing (2012). isbn: 9783642296994","DOI":"10.1007\/978-3-642-29700-7_16"},{"issue":"3","key":"32_CR2","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/BF00288685","volume":"1","author":"EG Coffman","year":"1972","unstructured":"Coffman, E.G., Graham, R.L.: Optimal scheduling for two-processor systems. Acta Informatica 1(3), 200\u2013213 (1972)","journal-title":"Acta Informatica"},{"key":"32_CR3","doi-asserted-by":"publisher","first-page":"916","DOI":"10.1007\/s00224-020-10011-y","volume":"65","author":"G Cormode","year":"2021","unstructured":"Cormode, G., Vesel\u00fd, P.: Streaming algorithms for bin packing and vector scheduling. Theory Comput. Syst. 65, 916\u2013942 (2021)","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"32_CR4","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/0196-6774(84)90039-7","volume":"5","author":"D Dolev","year":"1984","unstructured":"Dolev, D., Warmuth, M.K.: Scheduling precedence graphs of bounded height. J. Algor. 5(1), 48\u201359 (1984)","journal-title":"J. Algor."},{"key":"32_CR5","doi-asserted-by":"publisher","unstructured":"Dwibedy, D., Mohanty, R.: Online list scheduling formakespan minimization: a review of the state-of-the-art results, research challenges and open problems. SIGACT News 53(2), 84\u2013105 (2022). issn: 0163-5700. https:\/\/doi.org\/10.1145\/3544979.3544993","DOI":"10.1145\/3544979.3544993"},{"key":"32_CR6","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1016\/j.dam.2022.06.019","volume":"320","author":"F Bin","year":"2022","unstructured":"Bin, F., Huo, Y., Zhao, H.: Streaming algorithms for multitasking scheduling with shared processing. Disc. Appl. Math. 320, 346\u2013355 (2022)","journal-title":"Disc. Appl. Math."},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"Fu, B., Huo, Y., Zhao, H.: Streaming approximation scheme for minimizing total completion time on parallel machines subject to varying processing capacity. Theor. Comput. Sci. 961, 113937 (2023). issn: 0304-3975","DOI":"10.1016\/j.tcs.2023.113937"},{"key":"32_CR8","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, 1563\u20131581 (1966)","journal-title":"Bell Syst. Tech. J."},{"key":"32_CR9","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. SIAM J. Appl. Math. 17, 416\u2013429 (1969)","journal-title":"SIAM J. Appl. Math."},{"issue":"1","key":"32_CR10","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 34(1), 144\u2013162 (1987)","journal-title":"J. ACM"},{"key":"32_CR11","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1145\/321941.321951","volume":"23","author":"E Horowitz","year":"1976","unstructured":"Horowitz, E., Sahni, S.: Exact and approximate algorithms for scheduling nonidentical processors. J. ACM 23, 317\u2013327 (1976)","journal-title":"J. ACM"},{"issue":"1","key":"32_CR12","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1287\/opre.26.1.22","volume":"26","author":"JK Lenstra","year":"1978","unstructured":"Lenstra, J.K., Kan, A.: Complexity of scheduling under precedence constraints. Oper. Res. 26(1), 22\u201335 (1978)","journal-title":"Oper. Res."},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"Levey, E., Rothvoss, T.: A (1+epsilon)-approximation for makespan scheduling with precedence constraints using LP hierarchies. SIAM J. Comput. 50(3), STOC16-201\u2013STOC16\u2013217 (2021)","DOI":"10.1137\/16M1105049"},{"issue":"1","key":"32_CR14","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1145\/2627692.2627694","volume":"43","author":"A McGregor","year":"2014","unstructured":"McGregor, A.: Graph stream algorithms: a survey. SIGMOD Rec. 43(1), 9\u201320 (2014)","journal-title":"SIGMOD Rec."},{"issue":"2","key":"32_CR15","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1561\/0400000002","volume":"1","author":"S Muthukrishnan","year":"2005","unstructured":"Muthukrishnan, S.: Data streams: algorithms and applications. Found. Trends Theor. Comput. Sci. 1(2), 117\u2013236 (2005)","journal-title":"Found. Trends Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-98740-3_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,7]],"date-time":"2025-09-07T13:48:41Z","timestamp":1757252921000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-98740-3_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031987397","9783031987403"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-98740-3_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"18 July 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bozeman, MT","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":"21 July 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"36","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.montana.edu\/bhz\/iwoca2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}