{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T11:37:38Z","timestamp":1719920258124},"reference-count":24,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T00:00:00Z","timestamp":1685577600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T00:00:00Z","timestamp":1685577600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T00:00:00Z","timestamp":1685577600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T00:00:00Z","timestamp":1685577600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T00:00:00Z","timestamp":1685577600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T00:00:00Z","timestamp":1685577600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1016\/j.jcss.2023.01.001","type":"journal-article","created":{"date-parts":[[2023,1,25]],"date-time":"2023-01-25T16:36:18Z","timestamp":1674664578000},"page":"42-72","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Online bin covering with limited migration"],"prefix":"10.1016","volume":"134","author":[{"given":"Sebastian","family":"Berndt","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-6761-8521","authenticated-orcid":false,"given":"Leah","family":"Epstein","sequence":"additional","affiliation":[]},{"given":"Klaus","family":"Jansen","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-7935-6218","authenticated-orcid":false,"given":"Asaf","family":"Levin","sequence":"additional","affiliation":[]},{"given":"Marten","family":"Maack","sequence":"additional","affiliation":[]},{"given":"Lars","family":"Rohwedder","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.jcss.2023.01.001_br0010","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1016\/0196-6774(84)90004-X","article-title":"On a dual version of the one-dimensional bin packing problem","volume":"5","author":"Assmann","year":"1984","journal-title":"J. Algorithms"},{"key":"10.1016\/j.jcss.2023.01.001_br0020","first-page":"1","article-title":"Lower bounds for online bin covering-type problems","author":"Balogh","year":"2018","journal-title":"J. Sched."},{"key":"10.1016\/j.jcss.2023.01.001_br0030","series-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","first-page":"135","article-title":"Fully dynamic bin packing revisited","volume":"vol. 40","author":"Berndt","year":"2015"},{"key":"10.1016\/j.jcss.2023.01.001_br0040","article-title":"Fully dynamic bin packing revisited","author":"Berndt","year":"2018","journal-title":"Math. Program."},{"key":"10.1016\/j.jcss.2023.01.001_br0050","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/j.tcs.2014.06.029","article-title":"Online bin covering: expectations vs. guarantees","volume":"556","author":"Christ","year":"2014","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.jcss.2023.01.001_br0060","series-title":"Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001","first-page":"557","article-title":"Better approximation algorithms for bin covering","author":"Csirik","year":"2001"},{"issue":"2","key":"10.1016\/j.jcss.2023.01.001_br0070","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0166-218X(88)90052-2","article-title":"Online algorithms for a dual version of bin packing","volume":"21","author":"Csirik","year":"1988","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"10.1016\/j.jcss.2023.01.001_br0080","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1006\/inco.2001.3087","article-title":"Online variable sized covering","volume":"171","author":"Epstein","year":"2001","journal-title":"Inf. Comput."},{"issue":"1","key":"10.1016\/j.jcss.2023.01.001_br0090","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/s10951-009-0129-5","article-title":"Comparing online algorithms for bin packing problems","volume":"15","author":"Epstein","year":"2012","journal-title":"J. Sched."},{"issue":"2","key":"10.1016\/j.jcss.2023.01.001_br0100","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1007\/s00224-008-9129-7","article-title":"Class constrained bin covering","volume":"46","author":"Epstein","year":"2010","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"10.1016\/j.jcss.2023.01.001_br0110","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10107-007-0200-y","article-title":"A robust APTAS for the classical bin packing problem","volume":"119","author":"Epstein","year":"2009","journal-title":"Math. Program."},{"issue":"2","key":"10.1016\/j.jcss.2023.01.001_br0120","doi-asserted-by":"crossref","first-page":"1310","DOI":"10.1137\/11082782X","article-title":"Robust approximation schemes for cube packing","volume":"23","author":"Epstein","year":"2013","journal-title":"SIAM J. Control Optim."},{"issue":"1","key":"10.1016\/j.jcss.2023.01.001_br0130","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/s00453-012-9718-3","article-title":"Robust algorithms for preemptive scheduling","volume":"69","author":"Epstein","year":"2014","journal-title":"Algorithmica"},{"key":"10.1016\/j.jcss.2023.01.001_br0140","series-title":"45th International Colloquium on Automata, Languages, and Programming","first-page":"51:1","article-title":"Fully-dynamic bin packing with little repacking","volume":"vol. 107","author":"Feldkord","year":"2018"},{"key":"10.1016\/j.jcss.2023.01.001_br0150","series-title":"LATIN 2016: Theoretical Informatics - 12th Latin American Symposium","first-page":"469","article-title":"Probabilistic analysis of the dual next-fit algorithm for bin covering","volume":"vol. 9644","author":"Fischer","year":"2016"},{"key":"10.1016\/j.jcss.2023.01.001_br0160","series-title":"LATIN 2018: Theoretical Informatics - 13th Latin American Symposium","first-page":"461","article-title":"Probabilistic analysis of online (class-constrained) bin packing and bin covering","volume":"vol. 10807","author":"Fischer","year":"2018"},{"key":"10.1016\/j.jcss.2023.01.001_br0170","series-title":"26th Annual European Symposium on Algorithms, ESA 2018","first-page":"32:1","article-title":"Symmetry exploitation for online machine covering with bounded migration","volume":"vol. 112","author":"G\u00e1lvez","year":"2018"},{"key":"10.1016\/j.jcss.2023.01.001_br0180","series-title":"Handbook of Approximation Algorithms and Metaheuristics","year":"2007"},{"key":"10.1016\/j.jcss.2023.01.001_br0190","series-title":"Automata, Languages, and Programming - 40th International Colloquium","first-page":"589","article-title":"A robust AFPTAS for online bin packing with polynomial migration","author":"Jansen","year":"2013"},{"key":"10.1016\/j.jcss.2023.01.001_br0200","series-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","first-page":"13:1","article-title":"Online strip packing with polynomial migration","volume":"vol. 81","author":"Jansen","year":"2017"},{"issue":"1\u20133","key":"10.1016\/j.jcss.2023.01.001_br0210","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1016\/S0304-3975(03)00363-3","article-title":"An asymptotic fully polynomial time approximation scheme for bin covering","volume":"306","author":"Jansen","year":"2003","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"10.1016\/j.jcss.2023.01.001_br0220","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1287\/moor.1090.0381","article-title":"Online scheduling with bounded migration","volume":"34","author":"Sanders","year":"2009","journal-title":"Math. Oper. Res."},{"issue":"3","key":"10.1016\/j.jcss.2023.01.001_br0230","doi-asserted-by":"crossref","first-page":"991","DOI":"10.1287\/moor.2015.0765","article-title":"Robust polynomial-time approximation schemes for parallel machine scheduling with job arrivals and departures","volume":"41","author":"Skutella","year":"2016","journal-title":"Math. Oper. Res."},{"issue":"1","key":"10.1016\/j.jcss.2023.01.001_br0240","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/S0167-6377(99)00023-1","article-title":"Optimal on-line algorithms for variable-sized bin covering","volume":"25","author":"Woeginger","year":"1999","journal-title":"Oper. Res. Lett."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000023000089?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000023000089?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,2,22]],"date-time":"2023-02-22T01:00:42Z","timestamp":1677027642000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000023000089"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6]]},"references-count":24,"alternative-id":["S0022000023000089"],"URL":"https:\/\/doi.org\/10.1016\/j.jcss.2023.01.001","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[2023,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Online bin covering with limited migration","name":"articletitle","label":"Article Title"},{"value":"Journal of Computer and System Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jcss.2023.01.001","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2023 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}