{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T22:33:49Z","timestamp":1772490829264,"version":"3.50.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Scheduling"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1023\/a:1022960526107","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T22:16:51Z","timestamp":1049753811000},"page":"309-334","source":"Crossref","is-referenced-by-count":5,"title":["Barely Random Algorithms for Multiprocessor Scheduling"],"prefix":"10.1007","volume":"6","author":[{"given":"Steve","family":"Seiden","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"5117218_CR1","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1137\/S0097539797324874","volume":"29","author":"S. Albers","year":"1999","unstructured":"Albers, S., \u201cBetter bounds for online scheduling,\u201d SIAM J. Comput., 29(2), 459-473 (1999).","journal-title":"SIAM J. Comput."},{"issue":"1","key":"5117218_CR2","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1006\/inco.1999.2809","volume":"158","author":"Y. Bartal","year":"2000","unstructured":"Bartal, Y., M. Chrobak, and L. L. Larmore, \u201cA randomized algorithm for two servers on the line,\u201d Inform. Comput., 158(1), 53-69, April 2000.","journal-title":"Inform. Comput."},{"issue":"3","key":"5117218_CR3","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1006\/jcss.1995.1074","volume":"51","author":"Y. Bartal","year":"1995","unstructured":"Bartal, Y., A. Fiat, H. Karloff, and R. Vohra, \u201cNew algorithms for an ancient scheduling problem,\u201d J. Comput. Syst. Sci., 51(3), 359-366, December 1995.","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"5117218_CR4","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0020-0190(94)00026-3","volume":"50","author":"Y. Bartal","year":"1994","unstructured":"Bartal, Y., H. Karloff, and Y. Rabani, \u201cA better lower bound for on-line scheduling,\u201d Inform. Process. Lett., 50(3), 113-116 (May 1994).","journal-title":"Inform. Process. Lett."},{"key":"5117218_CR5","unstructured":"Ben-David, S., E. Dichterman, J. Noga, and S. S. Seiden, \u201cOn the power of barely random online algorithms,\u201d Manuscript."},{"issue":"5","key":"5117218_CR6","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0020-0190(94)00110-3","volume":"51","author":"B. Chen","year":"1994","unstructured":"Chen, B., A. van Vliet, and G. Woeginger, \u201cA lower bound for randomized on-line scheduling algorithms,\u201d Inform. Process. Lett., 51(5), 219-222 (September 1994a).","journal-title":"Inform. Process. Lett."},{"issue":"4","key":"5117218_CR7","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0167-6377(94)90071-X","volume":"16","author":"B. Chen","year":"1994","unstructured":"Chen, B., A. van Vliet, and G. Woeginger, \u201cNew lower and upper bounds for on-line scheduling,\u201d Oper. Res. Lett., 16(4), 221-230 (November 1994b).","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"5117218_CR8","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1002\/jos.60","volume":"4","author":"L. Epstein","year":"2001","unstructured":"Epstein, L., J. Noga, S. Seiden, J. Sgall, and G. Woeginger, \u201cRandomized online scheduling on two uniform machines,\u201d J. Scheduling, 4(2), 71-92 (March\/April 2001).","journal-title":"J. Scheduling"},{"issue":"2","key":"5117218_CR9","first-page":"107","volume":"9","author":"U. Faigle","year":"1989","unstructured":"Faigle, U., W. Kern, and G. Tur\u00e0n, \u201cOn the performance of on-line algorithms for partition problems,\u201d Acta Cybernetica, 9(2), 107-119, 1989.","journal-title":"Acta Cybernetica"},{"issue":"6","key":"5117218_CR10","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1002\/1099-1425(200011\/12)3:6<343::AID-JOS54>3.0.CO;2-2","volume":"3","author":"R. Fleischer","year":"2000","unstructured":"Fleischer, R. and M. Wahl, \u201cOnline scheduling revisited,\u201d J. Scheduling, 3(6), 343-353 (November\/December 2000).","journal-title":"J. Scheduling"},{"issue":"2","key":"5117218_CR11","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1137\/0222026","volume":"22","author":"G. Galambos","year":"1993","unstructured":"Galambos, G. and G. Woeginger, \u201cAn online scheduling heuristic with better worst case ratio than Graham's list scheduling,\u201d SIAM J. Comput., 22(2), 349-355 April 1993.","journal-title":"SIAM J. Comput."},{"key":"5117218_CR12","unstructured":"Gormley, T., N. Reingold, E. Torng, and J. Westbrook, \u201cGenerating adversaries for request-answer games,\u201d in Proc. 11th ACM-SIAM Symp. on Discrete Algorithms, 2000, pp. 564-565."},{"key":"5117218_CR13","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"R. L. Graham","year":"1966","unstructured":"Graham, R. L., \u201cBounds for certain multiprocessing anomalies,\u201d Bell Syst. Tech. J., 45, 1563-1581 (1966).","journal-title":"Bell Syst. Tech. J."},{"issue":"2","key":"5117218_CR14","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1006\/jagm.1996.0019","volume":"20","author":"D. Karger","year":"1996","unstructured":"Karger, D., S. Phillips, and E. Torng, \u201cA better algorithm for an ancient scheduling problem,\u201d J. Algorithms, 20(2), 400-430 (March 1996).","journal-title":"J. Algorithms"},{"issue":"1","key":"5117218_CR15","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BF01294261","volume":"11","author":"N. Reingold","year":"1994","unstructured":"Reingold, N., J. Westbrook, and D. Sleator, \u201cRandomized competitive algorithms for the list update problem,\u201d Algorithmica, 11(1), 15-32 (January 1994).","journal-title":"Algorithmica"},{"issue":"2","key":"5117218_CR16","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/s004530010014","volume":"28","author":"S. S. Seiden","year":"2000","unstructured":"Seiden, S. S., \u201cRandomized online multiprocessor scheduling,\u201d Algorithmica, 28(2), 173-216 (2000).","journal-title":"Algorithmica"},{"issue":"1","key":"5117218_CR17","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/S0020-0190(97)00093-8","volume":"63","author":"J. Sgall","year":"1997","unstructured":"Sgall, J., \u201cA lower bound for randomized on-line multiprocessor scheduling,\u201d Inform. Process. Lett., 63(1), 51-55 (July 1997).","journal-title":"Inform. Process. Lett."},{"key":"5117218_CR18","unstructured":"Sgall, J., April 1998, Personal Communication."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1022960526107.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1022960526107\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1022960526107.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T13:02:42Z","timestamp":1751634162000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1022960526107"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["5117218"],"URL":"https:\/\/doi.org\/10.1023\/a:1022960526107","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}