{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T17:27:59Z","timestamp":1648574879885},"reference-count":3,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1982,12,1]],"date-time":"1982-12-01T00:00:00Z","timestamp":407548800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[1982,12]]},"DOI":"10.1016\/0196-6774(82)90028-1","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"303-316","source":"Crossref","is-referenced-by-count":5,"title":["A two-dimensional bin-packing model of preemptive, FIFO storage allocation"],"prefix":"10.1016","volume":"3","author":[{"given":"B.S","family":"Baker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"suffix":"Jr.","given":"E.G","family":"Coffman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(82)90028-1_BIB1","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1137\/0209064","article-title":"Orthogonal packings in two dimensions","volume":"9","author":"Baker","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(82)90028-1_BIB2","doi-asserted-by":"crossref","first-page":"808","DOI":"10.1137\/0209062","article-title":"Performance bounds for level-oriented two-dimensional packing algorithms","volume":"9","author":"Coffman","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(82)90028-1_BIB3","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1137\/0203025","article-title":"Worst-case performance bounds for simple one-dimensional packing algorithms","volume":"3","author":"Johnson","year":"1974","journal-title":"SIAM J. Comput."}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677482900281?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677482900281?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T06:51:42Z","timestamp":1548744702000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677482900281"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,12]]},"references-count":3,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1982,12]]}},"alternative-id":["0196677482900281"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(82)90028-1","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1982,12]]}}}