{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,25]],"date-time":"2025-11-25T04:49:05Z","timestamp":1764046145840,"version":"3.35.0"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2008,11,22]],"date-time":"2008-11-22T00:00:00Z","timestamp":1227312000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2010,8]]},"DOI":"10.1007\/s00453-008-9257-0","type":"journal-article","created":{"date-parts":[[2008,11,21]],"date-time":"2008-11-21T16:47:16Z","timestamp":1227286036000},"page":"819-847","source":"Crossref","is-referenced-by-count":8,"title":["Scheduling Jobs on Grid Processors"],"prefix":"10.1007","volume":"57","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":[[2008,11,22]]},"reference":[{"key":"9257_CR1","unstructured":"Boyar, J., Ellen, F.: Improved lower bounds for Grid scheduling. Unpublished manuscript (2008)"},{"key":"9257_CR2","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1007\/3-540-44849-7_13","volume-title":"5th Italian Conference on Algorithms and Complexity","author":"J. Boyar","year":"2003","unstructured":"Boyar, J., Favrholdt, L.M.: The relative worst order ratio for on-line algorithms. In: 5th Italian Conference on Algorithms and Complexity. LNCS, vol.\u00a02653, pp. 58\u201369. Springer, Berlin (2003). Extended version in ACM Trans. Algorithms 3(2), 22 (2007)"},{"issue":"4","key":"9257_CR3","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1145\/1383369.1383379","volume":"4","author":"J. Boyar","year":"2008","unstructured":"Boyar, J., Medvedev, P.: The relative worst order ratio applied to seat reservation. ACM Trans. Algorithms 4(4), 48 (2008)","journal-title":"ACM Trans. Algorithms"},{"key":"9257_CR4","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.: The relative worst order ratio applied to paging. J. Comput. Syst. Sci. 73, 818\u2013843 (2007)","journal-title":"J. Comput. Syst. Sci."},{"key":"9257_CR5","unstructured":"Busch, M.: An investigation of the algorithms for solving the grid scheduling problem (in Danish). Bachelor project, Department of Mathematics and Computer Science, University of Southern Denmark, Odense, Denmark (2006)"},{"issue":"4","key":"9257_CR6","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.: Separating online scheduling algorithms with the relative worst order ratio. J. Comb. Optim. 12(4), 362\u2013385 (2006)","journal-title":"J. Comb. Optim."},{"key":"9257_CR7","unstructured":"Garey, M.R., Graham, R.L., Ullman, J.D.: An analysis of some packing algorithms. Combinatorial Algorithms (Courant Computer Science Symposium 9), 39\u201347 (1972)"},{"key":"9257_CR8","doi-asserted-by":"crossref","unstructured":"Graham, R.L.: Bounds on multiprocessing anomalies and related packing algorithms. In: Proc. 1972 Spring Joint Computer Conference, pp.\u00a0205\u2013217 (1972)","DOI":"10.1145\/1478873.1478901"},{"key":"9257_CR9","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. Comput. Syst. Sci. 8, 272\u2013314 (1974)","journal-title":"J. Comput. Syst. Sci."},{"key":"9257_CR10","unstructured":"Kohrt, J.S.: Online algorithms under new assumptions. PhD thesis, Department of Mathematics and Computer Science, University of Southern Denmark, Odense, Denmark (2004)"},{"issue":"1","key":"9257_CR11","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.: Competitive snoopy caching. Algorithmica 3(1), 79\u2013119 (1988)","journal-title":"Algorithmica"},{"issue":"3","key":"9257_CR12","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1145\/3828.3833","volume":"32","author":"C. Lee","year":"1985","unstructured":"Lee, C., Lee, D.: A simple on-line bin-packing algorithm. J. ACM 32(3), 562\u2013572 (1985)","journal-title":"J. ACM"},{"issue":"2","key":"9257_CR13","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.: Amortized efficiency of list update and paging rules. Commun. ACM 28(2), 202\u2013208 (1985)","journal-title":"Commun. ACM"},{"key":"9257_CR14","unstructured":"Vinter, B.: Personal communication. http:\/\/mig-2.imada.sdu.dk:8092\/MiG\/Mig\/ (2006)"},{"key":"9257_CR15","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/S0166-218X(96)00018-2","volume":"72","author":"G. Zhang","year":"1997","unstructured":"Zhang, G.: A new version of on-line variable-sized bin packing. Discrete Appl. Math. 72, 193\u2013197 (1997)","journal-title":"Discrete Appl. Math."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-008-9257-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-008-9257-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-008-9257-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,3]],"date-time":"2025-02-03T03:54:06Z","timestamp":1738554846000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-008-9257-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11,22]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,8]]}},"alternative-id":["9257"],"URL":"https:\/\/doi.org\/10.1007\/s00453-008-9257-0","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2008,11,22]]}}}