{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T01:45:13Z","timestamp":1767318313658,"version":"3.48.0"},"publisher-location":"Singapore","reference-count":27,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819548385","type":"print"},{"value":"9789819548392","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-981-95-4839-2_22","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T01:41:34Z","timestamp":1767318094000},"page":"283-291","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Generalized Last Open-End Bin Packing Problem"],"prefix":"10.1007","author":[{"given":"Zhikang","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weidong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","unstructured":"Balogh, J., Bekesi, J., Dosa, G., Epstein, L., Levin, A.: A new and improved algorithm for online bin packing. In: Azar, Y., Bast, H., Herman, G. (eds.) 26th Annual European Symposium on Algorithms, ESA 2018. LIPIcs, vol. 112, pp. 5:1\u20135:14. Helsinki, Finland (2018). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2018.5","DOI":"10.4230\/LIPIcs.ESA.2018.5"},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"2047","DOI":"10.1007\/s00453-021-00818-7","volume":"83","author":"J Balogh","year":"2021","unstructured":"Balogh, J., B\u00e9k\u00e9si, J., D\u00f3sa, G., Epstein, L., Levin, A.: A new lower bound for classic online bin packing. Algorithmica 83, 2047\u20132062 (2021)","journal-title":"Algorithmica"},{"key":"22_CR3","doi-asserted-by":"publisher","unstructured":"Balogh, J., Epstein, L., Levin, A.: More on ordered open end bin packing. J. Sched. 24(6), 589\u2013614 (2021). https:\/\/doi.org\/10.1007\/s10951-021-00709-3","DOI":"10.1007\/s10951-021-00709-3"},{"issue":"3","key":"22_CR4","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1287\/ijoc.2022.0191","volume":"36","author":"A Bansal","year":"2024","unstructured":"Bansal, A., Richard, J.P., Berg, B.P., Huang, Y.L.: A sequential follower refinement algorithm for robust surgery scheduling. INFORMS J. Comput. 36(3), 918\u2013937 (2024)","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"22_CR5","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":"2","key":"22_CR6","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1287\/opre.1070.0415","volume":"56","author":"A Ceselli","year":"2008","unstructured":"Ceselli, A., Righini, G.: An optimization algorithm for the ordered open-end bin-packing problem. Oper. Res. 56(2), 425\u2013436 (2008)","journal-title":"Oper. Res."},{"issue":"6","key":"22_CR7","doi-asserted-by":"publisher","first-page":"1491","DOI":"10.1287\/opre.1120.1109","volume":"60","author":"M Dell\u2019Amico","year":"2012","unstructured":"Dell\u2019Amico, M., D\u00edaz, J.C.D., Iori, M.: The bin packing problem with precedence constraints. Oper. Res. 60(6), 1491\u20131504 (2012)","journal-title":"Oper. Res."},{"issue":"1","key":"22_CR8","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.ipl.2008.08.005","volume":"109","author":"L Epstein","year":"2008","unstructured":"Epstein, L., Levin, A.: Asymptotic fully polynomial approximation schemes for variants of open-end bin packing. Inf. Process. Lett. 109(1), 32\u201337 (2008)","journal-title":"Inf. Process. Lett."},{"issue":"6","key":"22_CR9","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1016\/j.orl.2020.10.006","volume":"48","author":"L Epstein","year":"2020","unstructured":"Epstein, L., Levin, A.: A note on a variant of the online open end bin packing problem. Oper. Res. Lett. 48(6), 844\u2013849 (2020)","journal-title":"Oper. Res. Lett."},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/j.dam.2022.07.003","volume":"321","author":"L Epstein","year":"2022","unstructured":"Epstein, L.: Open-end bin packing: new and old analysis approaches. Discret. Appl. Math. 321, 220\u2013239 (2022)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"22_CR11","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.orl.2008.12.007","volume":"37","author":"L Gai","year":"2009","unstructured":"Gai, L., Zhang, G.: Hardness of lazy packing and covering. Oper. Res. Lett. 37(2), 89\u201392 (2009)","journal-title":"Oper. Res. Lett."},{"issue":"16","key":"22_CR12","doi-asserted-by":"publisher","first-page":"3616","DOI":"10.3390\/math11163616","volume":"11","author":"H Guo","year":"2023","unstructured":"Guo, H., Li, W., Deng, B.: A survey on fair allocation of chores. Mathematics 11(16), 3616 (2023)","journal-title":"Mathematics"},{"issue":"1","key":"22_CR13","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.ejor.2023.06.028","volume":"312","author":"M Haouari","year":"2024","unstructured":"Haouari, M., Mhiri, M.: Lower and upper bounding procedures for the bin packing problem with concave loading cost. Eur. J. Oper. Res. 312(1), 56\u201369 (2024)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"22_CR14","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1002\/jos.75","volume":"4","author":"JYT Leung","year":"2001","unstructured":"Leung, J.Y.T., Dror, M., Young, G.H.: A note on an open-end bin packing problem. J. Sched. 4(4), 201\u2013207 (2001)","journal-title":"J. Sched."},{"issue":"2","key":"22_CR15","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/s00453-008-9202-2","volume":"57","author":"M Lin","year":"2010","unstructured":"Lin, M., Yang, Y., Xu, J.: Improved approximation algorithms for maximum resource bin packing and lazy bin covering problems. Algorithmica 57(2), 232\u2013251 (2010)","journal-title":"Algorithmica"},{"issue":"1","key":"22_CR16","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/j.tcs.2009.10.006","volume":"411","author":"M Lin","year":"2010","unstructured":"Lin, M., Yang, Y., Xu, J.: On lazy bin covering and packing problems. Theoret. Comput. Sci. 411(1), 277\u2013284 (2010)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"22_CR17","doi-asserted-by":"publisher","first-page":"882","DOI":"10.1016\/j.ejor.2023.11.008","volume":"314","author":"W Li","year":"2024","unstructured":"Li, W., Ou, J.: Approximation algorithms for scheduling parallel machines with an energy constraint in green manufacturing. Eur. J. Oper. Res. 314(3), 882\u2013893 (2024)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"22_CR18","doi-asserted-by":"publisher","first-page":"912","DOI":"10.1016\/j.ejor.2023.11.002","volume":"314","author":"W Li","year":"2024","unstructured":"Li, W., Ou, J.: Machine scheduling with restricted rejection: an application to task offloading in cloud\u2013edge collaborative computing. Eur. J. Oper. Res. 314(3), 912\u2013919 (2024)","journal-title":"Eur. J. Oper. Res."},{"key":"22_CR19","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.dam.2025.02.015","volume":"367","author":"W Li","year":"2025","unstructured":"Li, W., Yang, Y., Xiao, M., Chen, X., Sterna, M., B\u0142a\u017cewicz, J.: Scheduling with a discounted profit criterion on identical machines. Discret. Appl. Math. 367, 195\u2013209 (2025)","journal-title":"Discret. Appl. Math."},{"key":"22_CR20","doi-asserted-by":"publisher","unstructured":"Luo, K., Spieksma, F.C.R.: Online bin packing with overload cost. In: Mudgal, A., Subramanian, C.R. (eds.) Algorithms and Discrete Applied Mathematics. CALDAM 2021. LNCS, vol. 12601, pp. 3\u201315. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-67899-9_1","DOI":"10.1007\/978-3-030-67899-9_1"},{"issue":"5","key":"22_CR21","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1145\/585265.585269","volume":"49","author":"SS Seiden","year":"2002","unstructured":"Seiden, S.S.: On the online bin packing problem. J. ACM 49(5), 640\u2013671 (2002)","journal-title":"J. ACM"},{"issue":"2","key":"22_CR22","doi-asserted-by":"publisher","first-page":"1534","DOI":"10.1109\/TMC.2023.3237938","volume":"23","author":"Q Su","year":"2023","unstructured":"Su, Q., Zhang, Q., Li, W., Zhang, X.: Primal-dual-based computation offloading method for energy-aware cloud-edge collaboration. IEEE Trans. Mob. Comput. 23(2), 1534\u20131549 (2023)","journal-title":"IEEE Trans. Mob. Comput."},{"issue":"7","key":"22_CR23","doi-asserted-by":"publisher","first-page":"1023","DOI":"10.3390\/math13071023","volume":"13","author":"H Xiao","year":"2025","unstructured":"Xiao, H., Zhang, J., Zhang, Z., Li, W.: A survey of approximation algorithms for the universal facility location problem. Mathematics 13(7), 1023 (2025)","journal-title":"Mathematics"},{"issue":"5","key":"22_CR24","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1287\/opre.51.5.759.16753","volume":"51","author":"J Yang","year":"2003","unstructured":"Yang, J., Leung, J.Y.T.: The ordered open-end bin-packing problem. Oper. Res. 51(5), 759\u2013770 (2003)","journal-title":"Oper. Res."},{"issue":"4","key":"22_CR25","doi-asserted-by":"publisher","first-page":"68","DOI":"10.3390\/computation12040068","volume":"12","author":"Y Yang","year":"2024","unstructured":"Yang, Y., Xiao, M., Li, W.: Semi-Online algorithms for the hierarchical extensible bin-packing problem and early work problem. Computation 12(4), 68 (2024)","journal-title":"Computation"},{"issue":"2","key":"22_CR26","doi-asserted-by":"publisher","first-page":"1278","DOI":"10.1109\/TMC.2022.3232513","volume":"23","author":"J Zhang","year":"2022","unstructured":"Zhang, J., Zhang, Y., Wu, H., Li, W.: An ordered submodularity-based budget-feasible mechanism for opportunistic mobile crowdsensing task allocation and pricing. IEEE Trans. Mob. Comput. 23(2), 1278\u20131294 (2022)","journal-title":"IEEE Trans. Mob. Comput."},{"key":"22_CR27","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BF02684336","volume":"60","author":"G Zhang","year":"1998","unstructured":"Zhang, G.: Parameterized on-line open-end bin packing. Computing 60, 267\u2013273 (1998)","journal-title":"Computing"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-4839-2_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T01:41:34Z","timestamp":1767318094000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-4839-2_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819548385","9789819548392"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-4839-2_22","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":"2 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TAMC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual Conference on Theory and Applications of Models of Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jinan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"19 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tamc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.maths.sdnu.edu.cn\/TAMC2025.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}