{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T04:40:36Z","timestamp":1772080836849,"version":"3.50.1"},"reference-count":11,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,8,1]],"date-time":"1994-08-01T00:00:00Z","timestamp":775699200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6925,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1994,8]]},"DOI":"10.1016\/0304-3975(94)90153-8","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"73-84","source":"Crossref","is-referenced-by-count":56,"title":["On-line load balancing"],"prefix":"10.1016","volume":"130","author":[{"given":"Yossi","family":"Azar","sequence":"first","affiliation":[]},{"given":"Andrei Z.","family":"Broder","sequence":"additional","affiliation":[]},{"given":"Anna R.","family":"Karlin","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)90153-8_BIB1","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/3-540-57155-8_241","article-title":"Online load balancing of temporary tasks","author":"Azar","year":"1993","journal-title":"Workshop on Algorithms and Data Structures (WADS)"},{"key":"10.1016\/0304-3975(94)90153-8_BIB2","first-page":"203","article-title":"The competitiveness of on-line assignment","author":"Azar","year":"1992","journal-title":"Proc. 3rd Ann. ACM\u2014SIAM SODA"},{"key":"10.1016\/0304-3975(94)90153-8_BIB3","first-page":"51","article-title":"New algorithms for an Ancient Scheduling Problem","author":"Bartal","year":"1992","journal-title":"Proc. 24th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(94)90153-8_BIB4","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/SFCS.1991.185354","article-title":"On-line scheduling in the presence of overload","author":"Baruah","year":"1991","journal-title":"Proc. 32nd IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(94)90153-8_BIB5","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","article-title":"Bounds for certain multiprocessing anomalies","volume":"45","author":"Graham","year":"1966","journal-title":"Bell System Tech. J."},{"key":"10.1016\/0304-3975(94)90153-8_BIB6","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and approximation in deterministic sequencing and scheduling: a survey","volume":"5","author":"Graham","year":"1979","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0304-3975(94)90153-8_BIB7","first-page":"352","article-title":"An optimal algorithm for on-line bipartite matching","author":"Karp","year":"1990","journal-title":"Proc. 22nd Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(94)90153-8_BIB8","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0012-365X(89)90096-4","article-title":"An on-line graph coloring algorithm with sublinear performance ratio","volume":"75","author":"Lov\u00e1sz","year":"1989","journal-title":"Discrete Math."},{"key":"10.1016\/0304-3975(94)90153-8_BIB9","first-page":"402","article-title":"Online load balancing and network flow","author":"Phillips","year":"1993","journal-title":"Proc. 25th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(94)90153-8_BIB10","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1109\/SFCS.1991.185361","article-title":"Scheduling parallel machines on-line","author":"Shmoys","year":"1991","journal-title":"Proc. 32nd IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(94)90153-8_BIB11","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1109\/FSCS.1990.89567","article-title":"Randomized on-line graph coloring","author":"Vishwanathan","year":"1990","journal-title":"Proc. 31st Ann. Symp. on Foundations of Computer Science"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594901538?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594901538?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T11:16:47Z","timestamp":1580901407000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594901538"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,8]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,8]]}},"alternative-id":["0304397594901538"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)90153-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,8]]}}}