{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T14:58:38Z","timestamp":1782399518993,"version":"3.54.5"},"reference-count":17,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1987,12,1]],"date-time":"1987-12-01T00:00:00Z","timestamp":565315200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9360,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Complexity"],"published-print":{"date-parts":[[1987,12]]},"DOI":"10.1016\/0885-064x(87)90009-4","type":"journal-article","created":{"date-parts":[[2004,11,6]],"date-time":"2004-11-06T18:01:23Z","timestamp":1099764083000},"page":"406-428","source":"Crossref","is-referenced-by-count":76,"title":["Bin packing with divisible item sizes"],"prefix":"10.1016","volume":"3","author":[{"suffix":"Jr.","given":"E.G","family":"Coffman","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M.R","family":"Garey","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"D.S","family":"Johnson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0885-064X(87)90009-4_BIB1","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\/0885-064X(87)90009-4_BIB2","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1137\/0603007","article-title":"On packing two-dimensional bins","volume":"3","author":"Chung","year":"1982","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0885-064X(87)90009-4_BIB3","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1137\/0212014","article-title":"Dynamic bin packing","volume":"12","author":"Coffman","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0885-064X(87)90009-4_BIB4","series-title":"Algorithm Design for Computer System Design","first-page":"49","article-title":"Approximation algorithms for bin packing\u2014An updated survey","author":"Coffman","year":"1984"},{"key":"10.1016\/0885-064X(87)90009-4_BIB5","doi-asserted-by":"crossref","first-page":"744","DOI":"10.1137\/0214054","article-title":"Scheduling file transfers","volume":"14","author":"Coffman","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0885-064X(87)90009-4_BIB6","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\/0885-064X(87)90009-4_BIB7","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1137\/0208016","article-title":"Combinatorial analysis of an efficient algorithm for processor and storage allocation","volume":"8","author":"Coffman","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0885-064X(87)90009-4_BIB8","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF00288885","article-title":"Bin packing: Maximizing the number of pieces packed","volume":"9","author":"Coffman","year":"1978","journal-title":"Acta Inform."},{"key":"10.1016\/0885-064X(87)90009-4_BIB9","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1137\/0603019","article-title":"Maximizing the minimum processor finish time in a multiprocessor system","author":"Deuermeyer","year":"1982","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0885-064X(87)90009-4_BIB10","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1137\/0215016","article-title":"Variable sized bin packing","volume":"15","author":"Friesen","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0885-064X(87)90009-4_BIB11","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0097-3165(76)90001-7","article-title":"Resource constrained scheduling as generalized bin packing","volume":"21","author":"Garey","year":"1976","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/0885-064X(87)90009-4_BIB12","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0885-064X(87)90009-4_BIB13","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1137\/0117039","article-title":"Bounds on multiprocessor timing anomalies","volume":"17","author":"Graham","year":"1969","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0885-064X(87)90009-4_BIB14","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1145\/362375.362392","article-title":"A class of dynamic memory allocation algorithms","volume":"16","author":"Hirschberg","year":"1973","journal-title":"Comm. ACM"},{"key":"10.1016\/0885-064X(87)90009-4_BIB15","doi-asserted-by":"crossref","first-page":"299","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."},{"key":"10.1016\/0885-064X(87)90009-4_BIB16","volume":"Vol. 1","author":"Knuth","year":"1973"},{"key":"10.1016\/0885-064X(87)90009-4_BIB17","series-title":"Computer and Job-Shop Scheduling Theory","first-page":"139","article-title":"Complexity of scheduling problems","author":"Ullman","year":"1975"}],"container-title":["Journal of Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0885064X87900094?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0885064X87900094?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,2]],"date-time":"2019-02-02T09:23:06Z","timestamp":1549099386000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0885064X87900094"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,12]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1987,12]]}},"alternative-id":["0885064X87900094"],"URL":"https:\/\/doi.org\/10.1016\/0885-064x(87)90009-4","relation":{},"ISSN":["0885-064X"],"issn-type":[{"value":"0885-064X","type":"print"}],"subject":[],"published":{"date-parts":[[1987,12]]}}}