{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:35:03Z","timestamp":1759638903770},"reference-count":8,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1994,5,1]],"date-time":"1994-05-01T00:00:00Z","timestamp":767750400000},"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,5]]},"DOI":"10.1016\/0020-0190(94)00026-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:37:30Z","timestamp":1027640250000},"page":"113-116","source":"Crossref","is-referenced-by-count":73,"title":["A better lower bound for on-line scheduling"],"prefix":"10.1016","volume":"50","author":[{"given":"Yair","family":"Bartal","sequence":"first","affiliation":[]},{"given":"Howard","family":"Karloff","sequence":"additional","affiliation":[]},{"given":"Yuval","family":"Rabani","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)00026-3_BIB1","series-title":"Proc. 24th ACM Symp. on the Theory of Computing","first-page":"51","article-title":"New algorithms for an ancient scheduling problem","author":"Bartal","year":"1992"},{"key":"10.1016\/0020-0190(94)00026-3_BIB2","first-page":"107","article-title":"On the performance of on-line algorithms for partition problems","volume":"9","author":"Faigle","year":"1989","journal-title":"Acta Cybernet."},{"key":"10.1016\/0020-0190(94)00026-3_BIB3","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\/0020-0190(94)00026-3_BIB4","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\/0020-0190(94)00026-3_BIB5","unstructured":"D. Karger, S. Phillips and E. Torng, A better algorithm for an ancient scheduling problem, Manuscript, Stanford University."},{"key":"10.1016\/0020-0190(94)00026-3_BIB6","series-title":"Math Programming: The State of the Art (Bonn 1982)","first-page":"202","article-title":"Recent results in the theory of machine scheduling","author":"Lawler","year":"1983"},{"key":"10.1016\/0020-0190(94)00026-3_BIB7","unstructured":"E.L. Lawler, J.K. Lenstra, A.H. Rinnooy Kan and D.B. Shmoys, Sequencing and scheduling: Algorithms and complexity, in: Handbook of Operations Research and Management Science, Volume IV: Production Planning and Inventory, S.C. Graves, A.H.G. Rinnooy Kan and P. Zipkin, eds. (North-Holland, Amsterdam), to appear."},{"key":"10.1016\/0020-0190(94)00026-3_BIB8","article-title":"An introduction to multiprocessor scheduling","author":"Lenstra","year":"1988","journal-title":"Tech. Rept. CWI"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094000263?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094000263?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:50:31Z","timestamp":1555131031000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019094000263"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,5]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1994,5]]}},"alternative-id":["0020019094000263"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)00026-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"type":"print","value":"0020-0190"}],"subject":[],"published":{"date-parts":[[1994,5]]}}}