{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:38:17Z","timestamp":1774417097113,"version":"3.50.1"},"reference-count":4,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1978,9,1]],"date-time":"1978-09-01T00:00:00Z","timestamp":273456000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1978,9]]},"DOI":"10.1007\/bf00288885","type":"journal-article","created":{"date-parts":[[2004,10,4]],"date-time":"2004-10-04T16:06:46Z","timestamp":1096906006000},"page":"263-271","source":"Crossref","is-referenced-by-count":60,"title":["Bin packing: Maximizing the number of pieces packed"],"prefix":"10.1007","volume":"9","author":[{"suffix":"Jr.","given":"E. G.","family":"Coffman","sequence":"first","affiliation":[]},{"given":"J. Y. -T.","family":"Leung","sequence":"additional","affiliation":[]},{"given":"D. W.","family":"Ting","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF00288885_CR1","unstructured":"Coffman, E.G., Garey, M.R., Johnson, D.S.: An application of bin-packing to multiprocessor scheduling. SIAM J. Comput. (to appear)"},{"key":"BF00288885_CR2","unstructured":"Coffman, E.G., Jr., Leung, J.Y-T., Ting, D.: Bin-packing: Maximizing the number of pieces packed. Technical Report, Computer Science Dept., The Pennsylvania State Univ., 1976"},{"key":"BF00288885_CR3","volume-title":"Computer and job-shop scheduling theory","author":"R.L. Graham","year":"1976","unstructured":"Graham, R.L.: Bounds on the performance of scheduling algorithms. In: Computer and job-shop scheduling theory (E.G. Coffman, ed.). New York:Wiley 1976"},{"key":"BF00288885_CR4","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1137\/0203025","volume":"3","author":"D.S. Johnson","year":"1974","unstructured":"Johnson, D.S., Demers, A., Ullman, J.D., Garey, M.R., Graham, R.L.: Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J. Comput. 3 299\u2013326 (1974)","journal-title":"SIAM J. Comput."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00288885.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00288885\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00288885","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00288885.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,17]],"date-time":"2020-02-17T19:07:35Z","timestamp":1581966455000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00288885"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978,9]]},"references-count":4,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1978,9]]}},"alternative-id":["BF00288885"],"URL":"https:\/\/doi.org\/10.1007\/bf00288885","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1978,9]]}}}