{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T20:17:21Z","timestamp":1672604241862},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,9,17]],"date-time":"2010-09-17T00:00:00Z","timestamp":1284681600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1007\/s10951-010-0199-4","type":"journal-article","created":{"date-parts":[[2010,9,16]],"date-time":"2010-09-16T19:56:22Z","timestamp":1284666982000},"page":"273-287","source":"Crossref","is-referenced-by-count":3,"title":["A new variable-sized bin packing problem"],"prefix":"10.1007","volume":"15","author":[{"given":"Joan","family":"Boyar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lene M.","family":"Favrholdt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,9,17]]},"reference":[{"key":"199_CR1","unstructured":"Angelopoulos, S., Dorrigiv, R., & L\u00f3pez-Ortiz, A. (2007). On the separation and equivalence of paging strategies. In 18th annual ACM-SIAM symposium on discrete algorithms (pp.\u00a0229\u2013237)."},{"issue":"1","key":"199_CR2","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/BF01294264","volume":"11","author":"S. Ben-David","year":"1994","unstructured":"Ben-David, S., & Borodin, A. (1994). A new measure for the study of on-line algorithms. Algorithmica, 11(1), 73\u201391.","journal-title":"Algorithmica"},{"key":"199_CR3","volume-title":"Online computation and competitive analysis","author":"A. Borodin","year":"1998","unstructured":"Borodin, A., & El-Yaniv, R. (1998). Online computation and competitive analysis. London: Cambridge University Press."},{"issue":"2","key":"199_CR4","doi-asserted-by":"crossref","DOI":"10.1145\/1240233.1240245","volume":"3","author":"J. Boyar","year":"2007","unstructured":"Boyar, J., & Favrholdt, L. M. (2007). The relative worst order ratio for on-line algorithms. ACM Transactions on Algorithms, 3(2), 22.","journal-title":"ACM Transactions on Algorithms"},{"issue":"4","key":"199_CR5","doi-asserted-by":"crossref","first-page":"819","DOI":"10.1007\/s00453-008-9257-0","volume":"57","author":"J. Boyar","year":"2010","unstructured":"Boyar, J., & Favrholdt, L. M. (2010). Scheduling jobs on Grid processors. Algorithmica, 57(4), 819\u2013847.","journal-title":"Algorithmica"},{"issue":"4","key":"199_CR6","doi-asserted-by":"crossref","DOI":"10.1145\/1383369.1383379","volume":"4","author":"J. Boyar","year":"2008","unstructured":"Boyar, J., & Medvedev, P. (2008). The relative worst order ratio applied to seat reservation. ACM Transactions on Algorithms, 4(4), 48.","journal-title":"ACM Transactions on Algorithms"},{"key":"199_CR7","doi-asserted-by":"crossref","first-page":"818","DOI":"10.1016\/j.jcss.2007.03.001","volume":"73","author":"J. Boyar","year":"2007","unstructured":"Boyar, J., Favrholdt, L. M., & Larsen, K. S. (2007a). The relative worst-order ratio applied to paging. Journal of Computer and System Sciences, 73, 818\u2013843.","journal-title":"Journal of Computer and System Sciences"},{"key":"199_CR8","doi-asserted-by":"crossref","unstructured":"Boyar, J., Ehmsen, M. R., & Larsen, K. S. (2007b). Theoretical evidence for the superiority of LRU-2 over LRU for the paging problem. In LNCS: Vol.\u00a04368. Approximation and online algorithms (WAOA 2006) (pp.\u00a095\u2013107).","DOI":"10.1007\/11970125_8"},{"key":"199_CR9","unstructured":"Darling, A., Carey, L., & Feng, W. (2003). The design, implementation, and evaluation of mpiBLAST. In ClusterWorld conference & Expo and the 4th international conference on Linux cluster: the HPC revolution 2003."},{"key":"199_CR10","doi-asserted-by":"crossref","unstructured":"Ehmsen, M. R., Favrholdt, L. M., Kohrt, J. S., & Mihai, R. (2008). Comparing First-Fit and Next-Fit for online edge coloring. In 19th international symposium on algorithms and computation (pp.\u00a089\u201399).","DOI":"10.1007\/978-3-540-92182-0_11"},{"issue":"4","key":"199_CR11","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1007\/s10878-006-9005-9","volume":"12","author":"L. Epstein","year":"2006","unstructured":"Epstein, L., Favrholdt, L. M., & Kohrt, J. S. (2006). Separating scheduling algorithms with the relative worst order ratio. Journal of Combinatorial Optimization, 12(4), 362\u2013385.","journal-title":"Journal of Combinatorial Optimization"},{"issue":"1","key":"199_CR12","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF01762111","volume":"3","author":"A. R. Karlin","year":"1988","unstructured":"Karlin, A. R., Manasse, M. S., Rudolph, L., & Sleator, D. D. (1988). Competitive snoopy caching. Algorithmica, 3(1), 79\u2013119.","journal-title":"Algorithmica"},{"key":"199_CR13","unstructured":"Kenyon, C. (1996). Best-fit bin-packing with random order. In 7th annual ACM-SIAM symposium on discrete algorithms (pp.\u00a0359\u2013364)."},{"key":"199_CR14","unstructured":"Rangwala, H., Lantz, E., Musselman, R., Pinnow, K., Smith, B., & Wallenfelt, B. (2005). Massively parallel BLAST for the Blue Gene\/L. In High availability and performance computing workshop."},{"issue":"2","key":"199_CR15","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D. D. Sleator","year":"1985","unstructured":"Sleator, D. D., & Tarjan, R. E. (1985). Amortized efficiency of list update and paging rules. Communication of the ACM, 28(2), 202\u2013208.","journal-title":"Communication of the ACM"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0199-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-010-0199-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0199-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T21:11:12Z","timestamp":1559682672000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-010-0199-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9,17]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["199"],"URL":"https:\/\/doi.org\/10.1007\/s10951-010-0199-4","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,9,17]]}}}