{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,14]],"date-time":"2024-03-14T06:45:03Z","timestamp":1710398703800},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1982,9,1]],"date-time":"1982-09-01T00:00:00Z","timestamp":399686400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1982,9]]},"DOI":"10.1007\/bf02241699","type":"journal-article","created":{"date-parts":[[2005,11,15]],"date-time":"2005-11-15T04:27:02Z","timestamp":1132028822000},"page":"227-239","source":"Crossref","is-referenced-by-count":15,"title":["A class of simple stochastic online bin packing algorithms"],"prefix":"10.1007","volume":"29","author":[{"given":"U.","family":"Hoffmann","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02241699_CR1","volume-title":"The design and analysis of computer algorithms","author":"A. V. Aho","year":"1974","unstructured":"Aho, A. V., Hopcroft, J. E., Ullman, J. D.: The design and analysis of computer algorithms. Reading, Mass.: Addison Wesley 1974."},{"key":"BF02241699_CR2","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/0020-0190(80)90041-1","volume":"11","author":"G. N. Frederickson","year":"1980","unstructured":"Frederickson, G. N.: Probabilistic analysis of simple one- and two-dimensional bin packing algorithms. Information Processing Letters11, 156\u2013161 (1980).","journal-title":"Information Processing Letters"},{"key":"BF02241699_CR3","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/S0019-9958(80)90050-9","volume":"44","author":"E. G. Coffman","year":"1980","unstructured":"Coffman, E. G., So, K., Hoffri, M., Yao, A. C.: A stochastic model of bin-packing. Information and control44, 105\u2013115 (1980).","journal-title":"Information and control"},{"key":"BF02241699_CR4","volume-title":"Computers and intractability","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R., Johnson, D. S.: Computers and intractability. San Francisco: Freeman 1979."},{"key":"BF02241699_CR5","series-title":"CISM","volume-title":"Analysis and design of algorithms in combinatorial optimization","author":"M. R. Garey","year":"1981","unstructured":"Garey, M. R., Johnson, D. S.: Approximation algorithms for bin packing: a survey. In: Analysis and design of algorithms in combinatorial optimization (Ausiello, G., Lucertini, M., eds.). (CISM No. 266.) Wien-New York: Springer 1981."},{"key":"BF02241699_CR6","unstructured":"Hoffmann, U.: Stochastische Packungsalgorithmen. Dissertation, Stuttgart, 1981."},{"key":"BF02241699_CR7","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/S0022-0000(74)80026-7","volume":"8","author":"D. S. Johnson","year":"1974","unstructured":"Johnson, D. S.: Fast algorithms for bin packing. J. of Comp. and Syst. Sci8, 272\u2013314 (1974).","journal-title":"J. of Comp. and Syst. Sci"},{"key":"BF02241699_CR8","unstructured":"Kn\u00f6del, W.: A bin-packing algorithm with complexity 0(nlogn) and performance 1 in the stochastic limit. Proc. of 10th Symposium on Math. Foundations in Comp. Sc. 81. (To appear in Lecture Notes in Computer Science. Berlin-Heidelberg-New York: Springer."},{"key":"BF02241699_CR9","volume-title":"Stochastic processes","author":"N. U. Prabhu","year":"1965","unstructured":"Prabhu, N. U.: Stochastic processes. New York: Macmillan 1965."},{"key":"BF02241699_CR10","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF02127580","volume":"4","author":"A. R\u00e9nyi","year":"1953","unstructured":"R\u00e9nyi, A.: On the theory of order statistics. Acta Mathematica Academiae Scientiarum Hungariae4, 191\u2013231 (1953).","journal-title":"Acta Mathematica Academiae Scientiarum Hungariae"},{"key":"BF02241699_CR11","first-page":"146","volume":"35","author":"S. D. Shapiro","year":"1977","unstructured":"Shapiro, S. D.: Performance of heuristic bin packing algorithms with segments of random lengths. Information and Control35, 146\u2013158 (1977).","journal-title":"Information and Control"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02241699.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02241699\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02241699","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T23:15:45Z","timestamp":1557875745000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02241699"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,9]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1982,9]]}},"alternative-id":["BF02241699"],"URL":"https:\/\/doi.org\/10.1007\/bf02241699","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1982,9]]}}}