{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:22:25Z","timestamp":1759638145378},"reference-count":4,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1994,9,1]],"date-time":"1994-09-01T00:00:00Z","timestamp":778377600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1994,9]]},"DOI":"10.1016\/0020-0190(94)00110-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:45:40Z","timestamp":1027655140000},"page":"219-222","source":"Crossref","is-referenced-by-count":54,"title":["A lower bound for randomized on-line scheduling algorithms"],"prefix":"10.1016","volume":"51","author":[{"given":"Bo","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"van Vliet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerhard J.","family":"Woeginger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)00110-3_BIB1","first-page":"51","article-title":"New algorithms for an ancient scheduling problem","author":"Bartal","year":"1992","journal-title":"Proc. 24th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(94)00110-3_BIB2","first-page":"379","article-title":"On the power of randomization in on-line algorithms","author":"Ben-David","year":"1990","journal-title":"Proc. 22nd Ann. Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(94)00110-3_BIB3","series-title":"Rept. 9404\/A","article-title":"An optimal algorithm for preemptive on-line scheduling","author":"Chen","year":"1994"},{"key":"10.1016\/0020-0190(94)00110-3_BIB4","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."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094001103?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094001103?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:22:21Z","timestamp":1555132941000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019094001103"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,9]]},"references-count":4,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1994,9]]}},"alternative-id":["0020019094001103"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)00110-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"type":"print","value":"0020-0190"}],"subject":[],"published":{"date-parts":[[1994,9]]}}}