{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T08:26:13Z","timestamp":1774599973885,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001736","name":"German-Israeli Foundation for Scientific Research and Development","doi-asserted-by":"publisher","award":["I-1366-407.6\/2016"],"award-info":[{"award-number":["I-1366-407.6\/2016"]}],"id":[{"id":"10.13039\/501100001736","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"crossref","award":["308\/18"],"award-info":[{"award-number":["308\/18"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2022,2]]},"DOI":"10.1007\/s00453-021-00895-8","type":"journal-article","created":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T07:07:42Z","timestamp":1638342462000},"page":"325-343","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Approximation Schemes for the Generalized Extensible Bin Packing Problem"],"prefix":"10.1007","volume":"84","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7935-6218","authenticated-orcid":false,"given":"Asaf","family":"Levin","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,1]]},"reference":[{"key":"895_CR1","unstructured":"Alon, N., Azar, Y., Woeginger, G. J., Yadid, T.: Approximation schemes for scheduling. In: Proceedings of the 8th Symposium on Discrete Algorithms (SODA 1997), pp. 493\u2013500 (1997)"},{"issue":"1","key":"895_CR2","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<55::AID-JOS2>3.0.CO;2-J","volume":"1","author":"N Alon","year":"1998","unstructured":"Alon, N., Azar, Y., Woeginger, G.J., Yadid, T.: Approximation schemes for scheduling on parallel machines. J. Sched. 1(1), 55\u201366 (1998)","journal-title":"J. Sched."},{"issue":"4","key":"895_CR3","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1287\/ijoc.2017.0750","volume":"29","author":"BP Berg","year":"2017","unstructured":"Berg, B.P., Denton, B.T.: Fast approximation methods for online scheduling of outpatient procedure centers. INFORMS J. Comput. 29(4), 631\u2013644 (2017)","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"895_CR4","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0020-0190(97)00164-6","volume":"64","author":"M Cesati","year":"1997","unstructured":"Cesati, M., Trevisan, L.: On the efficiency of polynomial time approximation schemes. Inf. Process. Lett. 64(4), 165\u2013171 (1997)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"895_CR5","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s10951-006-5594-5","volume":"9","author":"E Coffman","year":"2006","unstructured":"Coffman, E., Lueker, G.S.: Approximation algorithms for extensible bin packing. J. Sched. 9(1), 63\u201369 (2006)","journal-title":"J. Sched."},{"key":"895_CR6","unstructured":"Coffman Jr, E.G., Lueker, G.S.: Approximation algorithms for extensible bin packing. In: Proceedings of the 12th Symposium on Discrete Algorithms (SODA 2001), pp. 586\u2013588 (2001)"},{"key":"895_CR7","doi-asserted-by":"crossref","unstructured":"DellOlmo, P., Kellerer, H., Speranza, M.G., Tuza, Z.: A 13\/12 approximation algorithm for bin packing with extendable bins. Inf. Process. Lett. 65(5), 229\u2013233 (1998)","DOI":"10.1016\/S0020-0190(97)00216-0"},{"key":"895_CR8","doi-asserted-by":"crossref","unstructured":"Dell\u2019Olmo, P., Speranza, M.G.: Approximation algorithms for partitioning small items in unequal bins to minimize the total size. Discret. Appl. Math. 94(1\u20133), 181\u2013191 (1999)","DOI":"10.1016\/S0166-218X(99)00020-7"},{"issue":"4\u2013part\u20131","key":"895_CR9","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1287\/opre.1090.0791","volume":"58","author":"BT Denton","year":"2010","unstructured":"Denton, B.T., Miller, A.J., Balasubramanian, H.J., Huschka, T.R.: Optimal allocation of surgery blocks to operating rooms under uncertainty. Oper. Res. 58(4\u2013part\u20131), 802\u2013816 (2010)","journal-title":"Oper. Res."},{"key":"895_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"RG Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Berlin (1999)"},{"key":"895_CR11","unstructured":"Eisenbrand, F., Hunkenschr\u00f6der, C., Klein, K.-M., Kouteck\u1ef3, M., Levin, A., Onn, S.: An algorithmic theory of integer programming. arXiv:1904.01361 (2019)"},{"key":"895_CR12","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.jcss.2016.07.007","volume":"84","author":"L Epstein","year":"2017","unstructured":"Epstein, L., Levin, A.: An AFPTAS for variable sized bin packing with general activation costs. J. Comput. Syst. Sci. 84, 79\u201396 (2017)","journal-title":"J. Comput. Syst. Sci."},{"issue":"6\u20137","key":"895_CR13","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s00236-005-0003-7","volume":"42","author":"L Epstein","year":"2006","unstructured":"Epstein, L., Tassa, T.: Vector assignment schemes for asymmetric settings. Acta Inform. 42(6\u20137), 501\u2013514 (2006)","journal-title":"Acta Inform."},{"key":"895_CR14","volume-title":"Parameterized Complexity Theory","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Berlin (2006)"},{"key":"895_CR15","volume-title":"Approximation Algorithms","author":"DS Hochbaum","year":"1997","unstructured":"Hochbaum, D.S.: Various notions of approximations: good, better, best, and more. In: Hochbaum, D.S. (ed.) Approximation Algorithms. PWS Publishing Company, New York (1997)"},{"issue":"1","key":"895_CR16","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1145\/2455.214106","volume":"32","author":"DS Hochbaum","year":"1985","unstructured":"Hochbaum, D.S., Maass, W.: Approximation schemes for covering and packing problems in image processing and VLSI. J. ACM 32(1), 130\u2013136 (1985)","journal-title":"J. ACM"},{"key":"895_CR17","unstructured":"Jansen, K., Klein, K.-M., Maack, M., Rau, M.: Empowering the configuration-ip-new ptas results for scheduling with setups times. In: Proceedings of the 10th Innovations in Theoretical Computer Science Conference (ITCS 2019) (2019)"},{"key":"895_CR18","unstructured":"Jansen, K., Klein, K.-M., Verschae, J.: Closing the gap for makespan scheduling via sparsification techniques. In: Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016) (2016)"},{"issue":"1","key":"895_CR19","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1093\/comjnl\/bxm048","volume":"51","author":"D Marx","year":"2008","unstructured":"Marx, D.: Parameterized complexity and approximation algorithms. Comput. J. 51(1), 60\u201378 (2008)","journal-title":"Comput. J."},{"key":"895_CR20","doi-asserted-by":"crossref","unstructured":"Sagnol, G., genannt Waldschmidt, D. S., Tesch, A.: The price of fixed assignments in stochastic extensible bin packing. In: Proceedings of the 16th International Workshop on Approximation and Online Algorithms (WAOA 2018), pp. 327\u2013347 (2018)","DOI":"10.1007\/978-3-030-04693-4_20"},{"issue":"4","key":"895_CR21","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s10288-006-0025-1","volume":"5","author":"R Sirdey","year":"2007","unstructured":"Sirdey, R.: Combinatorial optimization problems in wireless switch design. 4OR 5(4), 319\u2013333 (2007)","journal-title":"4OR"},{"key":"895_CR22","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1023\/A:1018935608981","volume":"86","author":"MG Speranza","year":"1999","unstructured":"Speranza, M.G., Tuza, Z.: On-line approximation algorithms for scheduling tasks on identical machines with extendable working time. Ann. Oper. Res. 86, 491\u2013506 (1999)","journal-title":"Ann. Oper. Res."},{"key":"895_CR23","doi-asserted-by":"crossref","unstructured":"Ye, D., Zhang, G.: On-line extensible bin packing with unequal bin sizes. In: Proceedings of the 1st International Workshop on Approximation and Online Algorithms (WAOA 2003), pp. 235\u2013247 (2003)","DOI":"10.1007\/978-3-540-24592-6_19"},{"issue":"4","key":"895_CR24","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/S0020-0190(02)00404-0","volume":"85","author":"D Ye","year":"2003","unstructured":"Ye, D., Zhang, G.: On-line scheduling with extendable working time on a small number of machines. Inf. Process. Lett. 85(4), 171\u2013177 (2003)","journal-title":"Inf. Process. Lett."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-021-00895-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-021-00895-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-021-00895-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,15]],"date-time":"2022-02-15T07:04:16Z","timestamp":1644908656000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-021-00895-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,1]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,2]]}},"alternative-id":["895"],"URL":"https:\/\/doi.org\/10.1007\/s00453-021-00895-8","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,12,1]]},"assertion":[{"value":"18 June 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 November 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 December 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}