{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:38:35Z","timestamp":1742967515835,"version":"3.40.3"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031086229"},{"type":"electronic","value":"9783031086236"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-08623-6_2","type":"book-chapter","created":{"date-parts":[[2022,8,29]],"date-time":"2022-08-29T07:06:24Z","timestamp":1661756784000},"page":"9-14","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Scheduling and\u00a0Packing Under Uncertainty"],"prefix":"10.1007","author":[{"given":"Franziska","family":"Eberle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,30]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","unstructured":"Baruah, S.K., Haritsa, J.R., Sharma, N.: On-line scheduling to maximize task completions. In: RTSS, pp. 228\u2013236. IEEE Computer Society (1994). https:\/\/doi.org\/10.1109\/REAL.1994.342713","DOI":"10.1109\/REAL.1994.342713"},{"key":"2_CR2","unstructured":"B\u00f6hm, M., et al.: Fully dynamic algorithms for knapsack problems with polylogarithmic update time. CoRR, abs\/2007.08415 (2020). https:\/\/arxiv.org\/abs\/2007.08415"},{"issue":"3","key":"2_CR3","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1137\/S0097539700382820","volume":"35","author":"C Chekuri","year":"2005","unstructured":"Chekuri, C., Khanna, S.: A polynomial time approximation scheme for the multiple knapsack problem. SIAM J. Comput. 35(3), 713\u2013728 (2005). https:\/\/doi.org\/10.1137\/S0097539700382820","journal-title":"SIAM J. Comput."},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s10107-020-01469-2","volume":"183","author":"L Chen","year":"2020","unstructured":"Chen, L., Eberle, F., Megow, N., Schewior, K., Stein, C.: A general framework for handling commitment in online throughput maximization. Math. Prog. 183, 215\u2013247 (2020). https:\/\/doi.org\/10.1007\/s10107-020-01469-2","journal-title":"Math. Prog."},{"key":"2_CR5","doi-asserted-by":"publisher","unstructured":"Eberle, F.: Scheduling and packing under uncertainty. Ph.D. thesis, University of Bremen (2020). https:\/\/doi.org\/10.26092\/elib\/436","DOI":"10.26092\/elib\/436"},{"key":"2_CR6","doi-asserted-by":"publisher","unstructured":"Eberle, F., Megow, N., Schewior, K.: Optimally handling commitment issues in online throughput maximization. In: Proceedings of ESA 2020, pp. 41:1\u201341:15 (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2020.41","DOI":"10.4230\/LIPIcs.ESA.2020.41"},{"key":"2_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)"},{"issue":"4","key":"2_CR8","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/321906.321909","volume":"22","author":"OH Ibarra","year":"1975","unstructured":"Ibarra, O.H., Kim, C.E.: Fast approximation algorithms for the knapsack and sum of subset problems. J. ACM 22(4), 463\u2013468 (1975). https:\/\/doi.org\/10.1145\/321906.321909","journal-title":"J. ACM"},{"key":"2_CR9","doi-asserted-by":"publisher","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, The IBM Research Symposia Series, pp. 85\u2013103. Plenum Press, New York (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9","DOI":"10.1007\/978-1-4684-2001-2_9"}],"container-title":["Lecture Notes in Operations Research","Operations Research Proceedings 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-08623-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,29]],"date-time":"2022-08-29T07:06:55Z","timestamp":1661756815000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-08623-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031086229","9783031086236"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-08623-6_2","relation":{},"ISSN":["2731-040X","2731-0418"],"issn-type":[{"type":"print","value":"2731-040X"},{"type":"electronic","value":"2731-0418"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"30 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"OR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Operations Research","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":"31 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"or2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.or2021.unibe.ch\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}