{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,25]],"date-time":"2025-11-25T20:24:22Z","timestamp":1764102262784},"reference-count":11,"publisher":"Elsevier BV","issue":"4-5","license":[{"start":{"date-parts":[[1998,5,1]],"date-time":"1998-05-01T00:00:00Z","timestamp":893980800000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[1998,5]]},"DOI":"10.1016\/s0167-6377(98)00019-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:14:29Z","timestamp":1027638869000},"page":"171-177","source":"Crossref","is-referenced-by-count":28,"title":["Randomized online interval scheduling"],"prefix":"10.1016","volume":"22","author":[{"given":"Steven S.","family":"Seiden","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0167-6377(98)00019-4_BIB1","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF00365406","article-title":"On the competetiveness of online realtime task scheduling","volume":"4","author":"Baruah","year":"1992","journal-title":"J. Real-time Systems"},{"issue":"1","key":"10.1016\/S0167-6377(98)00019-4_BIB2","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/BF01294260","article-title":"On the power of randomization in on-line algorithms","volume":"11","author":"Ben-David","year":"1994","journal-title":"Algorithmica"},{"key":"10.1016\/S0167-6377(98)00019-4_BIB3","doi-asserted-by":"crossref","unstructured":"R. Canetti, S. Irani, Bounding the power of preemption in randomized scheduling, in: Proc. 27 Ann. ACM Symp. on the Theory of Computing, 1995 pp. 606\u2013615.","DOI":"10.1145\/225058.225278"},{"issue":"1","key":"10.1016\/S0167-6377(98)00019-4_BIB4","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0166-218X(95)00112-5","article-title":"Note on scheduling intervals on-line","volume":"58","author":"Faigle","year":"1995","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0167-6377(98)00019-4_BIB5","unstructured":"R.L. Graham, D.E. Knuth, O. Patashnik, Concrete Mathematics, 2nd ed., Addison-Wesley, Reading, MA, 1994."},{"issue":"1","key":"10.1016\/S0167-6377(98)00019-4_BIB6","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\/S0167-6377(98)00019-4_BIB7","unstructured":"R. Lipton, A. Tomkins, Online interval scheduling, in: Proc. 5th Ann. ACM-SIAM Symp. on Discrete Algorithms, 1994, pp. 302\u2013311."},{"key":"10.1016\/S0167-6377(98)00019-4_BIB8","doi-asserted-by":"crossref","unstructured":"D. Long, M. Thakur, Scheduling real-time disk transfers for continuous media applications, In Proc. 12th IEEE Sympos. on Mass Storage Systems, Putting all that Data to Work, 1993, pp. 227\u2013232.","DOI":"10.1109\/MASS.1993.289755"},{"issue":"1","key":"10.1016\/S0167-6377(98)00019-4_BIB9","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"},{"issue":"2","key":"10.1016\/S0167-6377(98)00019-4_BIB10","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":"Commun. ACM"},{"issue":"1","key":"10.1016\/S0167-6377(98)00019-4_BIB11","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0304-3975(94)90150-3","article-title":"On-line scheduling of jobs with fixed start and end times","volume":"130","author":"Woeginger","year":"1994","journal-title":"Theoret. Comput. Sci."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637798000194?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637798000194?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T08:54:25Z","timestamp":1555577665000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637798000194"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,5]]},"references-count":11,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[1998,5]]}},"alternative-id":["S0167637798000194"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(98)00019-4","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1998,5]]}}}