{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T10:49:17Z","timestamp":1778496557407,"version":"3.51.4"},"reference-count":23,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"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":4307,"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":[[2001,10]]},"DOI":"10.1016\/s0304-3975(00)00264-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:49:41Z","timestamp":1027601381000},"page":"133-143","source":"Crossref","is-referenced-by-count":29,"title":["An optimal online algorithm for scheduling two machines with release times"],"prefix":"10.1016","volume":"268","author":[{"given":"John","family":"Noga","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven S.","family":"Seiden","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00264-4_BIB1","doi-asserted-by":"crossref","unstructured":"S. Albers, Better bounds for online scheduling. In Proc. 29th ACM Symp. on Theory of Computing, 1997, pp. 130\u2013139.","DOI":"10.1145\/258533.258566"},{"issue":"3","key":"10.1016\/S0304-3975(00)00264-4_BIB2","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1006\/jcss.1995.1074","article-title":"New algorithms for an ancient scheduling problem","volume":"51","author":"Bartal","year":"1995","journal-title":"J. Comput. System Sci."},{"issue":"3","key":"10.1016\/S0304-3975(00)00264-4_BIB3","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0020-0190(94)00026-3","article-title":"A better lower bound for on-line scheduling","volume":"50","author":"Bartal","year":"1994","journal-title":"Informat. Process. Lett."},{"key":"10.1016\/S0304-3975(00)00264-4_BIB4","series-title":"Online Computation and Competitive Analysis","author":"Borodin","year":"1998"},{"issue":"5","key":"10.1016\/S0304-3975(00)00264-4_BIB5","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0020-0190(94)00110-3","article-title":"A lower bound for randomized on-line scheduling algorithms","volume":"51","author":"Chen","year":"1994","journal-title":"Informat. Process. Lett."},{"issue":"4","key":"10.1016\/S0304-3975(00)00264-4_BIB6","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0167-6377(94)90071-X","article-title":"New lower and upper bounds for on-line scheduling","volume":"16","author":"Chen","year":"1994","journal-title":"Operat. Res. Lett."},{"issue":"4","key":"10.1016\/S0304-3975(00)00264-4_BIB7","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0167-6377(97)00040-0","article-title":"Scheduling on identical machines. How good is LPT in an online setting?","volume":"21","author":"Chen","year":"1997","journal-title":"Operat. Res. Lett."},{"issue":"2","key":"10.1016\/S0304-3975(00)00264-4_BIB8","first-page":"107","article-title":"On the performance of on-line algorithms for partition problems","volume":"9","author":"Faigle","year":"1989","journal-title":"Acta Cybernetica"},{"issue":"2","key":"10.1016\/S0304-3975(00)00264-4_BIB9","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1137\/0222026","article-title":"An online scheduling heuristic with better worst case ratio than Graham's list scheduling","volume":"22","author":"Galambos","year":"1993","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(00)00264-4_BIB10","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 Systems Technic. J."},{"key":"10.1016\/S0304-3975(00)00264-4_BIB11","doi-asserted-by":"crossref","unstructured":"L. Hall, D. Shmoys, Approximation schemes for constrained scheduling problems, In Proc. 30th IEEE Symp. on Foundations of Computer Science, 1989, pp. 134\u2013139.","DOI":"10.1109\/SFCS.1989.63468"},{"issue":"2","key":"10.1016\/S0304-3975(00)00264-4_BIB12","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1006\/jagm.1996.0019","article-title":"A better algorithm for an ancient scheduling problem","volume":"20","author":"Karger","year":"1996","journal-title":"J Algorithms"},{"issue":"1","key":"10.1016\/S0304-3975(00)00264-4_BIB13","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF01762111","article-title":"Competitive snoopy caching","volume":"3","author":"Karlin","year":"1988","journal-title":"Algorithmica"},{"key":"10.1016\/S0304-3975(00)00264-4_BIB14","unstructured":"E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys, Sequencing and scheduling: Algorithms and complexity. In: S.C. Graves, A.H.G.R. Kan, P. Zipkin (Eds.), Handbooks in Operations Research and Management Science, Vol. 4: Logistics of Production and Inventory, North-Holland, 1993, pp. 445\u2013552."},{"issue":"1","key":"10.1016\/S0304-3975(00)00264-4_BIB15","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BF01294261","article-title":"Randomized competitive algorithms for the list update problem","volume":"11","author":"Reingold","year":"1994","journal-title":"Algorithmica"},{"key":"10.1016\/S0304-3975(00)00264-4_BIB16","doi-asserted-by":"crossref","unstructured":"S.S. Seiden, Randomized algorithms for that ancient scheduling problem, Proc. 5th Workshop on Algorithms and Data Structures, 1997, pp. 210\u2013223.","DOI":"10.1007\/3-540-63307-3_61"},{"issue":"1","key":"10.1016\/S0304-3975(00)00264-4_BIB17","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/S0020-0190(97)00093-8","article-title":"A lower bound for randomized on-line multiprocessor scheduling","volume":"63","author":"Sgall","year":"1997","journal-title":"Informat. Process. Lett."},{"key":"10.1016\/S0304-3975(00)00264-4_BIB18","doi-asserted-by":"crossref","unstructured":"D. Shmoys, J. Wein, D. Williamson, Scheduling parallel machines on-line, Proc. 32nd Symp. on Foundations of Computer Science, 1991, pp. 131\u2013140.","DOI":"10.1109\/SFCS.1991.185361"},{"issue":"2","key":"10.1016\/S0304-3975(00)00264-4_BIB19","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","article-title":"Amortized efficiency of list update and paging rules","volume":"28","author":"Sleator","year":"1985","journal-title":"Communications of the ACM"},{"key":"10.1016\/S0304-3975(00)00264-4_BIB20","unstructured":"L. Stougie, A.P.A. Vestjens, Randomized on-line scheduling: How low can't you go? Manuscript, 1997."},{"key":"10.1016\/S0304-3975(00)00264-4_BIB21","unstructured":"A.P.A. Vestjens, On-line Machine Scheduling, Ph.D. Thesis, Eindhoven University of Technology, The Netherlands, 1997."},{"key":"10.1016\/S0304-3975(00)00264-4_BIB22","series-title":"Theory of games and economic behavior","author":"Von Neumann","year":"1944"},{"key":"10.1016\/S0304-3975(00)00264-4_BIB23","doi-asserted-by":"crossref","unstructured":"A.C. Yao, Probabilistic computations: Toward a unified measure of complexity, In Proc. 18th IEEE Symp. on Foundations of Computer Science, 1977, pp. 222\u2013227.","DOI":"10.1109\/SFCS.1977.24"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500002644?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500002644?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T11:56:49Z","timestamp":1556193409000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500002644"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,10]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,10]]}},"alternative-id":["S0304397500002644"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00264-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,10]]}}}