{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T04:07:29Z","timestamp":1751342849842,"version":"3.41.0"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1999,12,1]],"date-time":"1999-12-01T00:00:00Z","timestamp":944006400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,12,1]],"date-time":"1999-12-01T00:00:00Z","timestamp":944006400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Optimization"],"published-print":{"date-parts":[[1999,12]]},"DOI":"10.1023\/a:1009875403874","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T23:53:29Z","timestamp":1040601209000},"page":"399-416","source":"Crossref","is-referenced-by-count":8,"title":["Randomized Online Scheduling with Delivery Times"],"prefix":"10.1007","volume":"3","author":[{"given":"Steve","family":"Seiden","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"244016_CR1","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/BF01294260","volume":"11","author":"S. Ben-David","year":"1994","unstructured":"S. Ben-David, A. Borodin, R. Karp, G. Tardos, and A. Wigderson, \"On the power of randomization in on-line algorithms,\" Algorithmica, vol. 11, no. 1, pp. 2\u201314, 1994.","journal-title":"Algorithmica"},{"key":"244016_CR2","doi-asserted-by":"crossref","unstructured":"L. Hall and B. Shmoys, \"Approximation Schemes for Constrained Scheduling Problems,\" in Proceedings of the 30th IEEE Symposium on Foundations of Computer Science, 1989, pp. 134\u2013139.","DOI":"10.1109\/SFCS.1989.63468"},{"key":"244016_CR3","doi-asserted-by":"crossref","unstructured":"H. Hoogeveen and A. Vestjens, \"Optimal On-Line Algorithms for Single-Machine Scheduling,\" in Proceedings of the 5th International Conference on Integer Programming and Combinatorial Optimization, 1996, pp. 404\u2013414.","DOI":"10.1007\/3-540-61310-2_30"},{"key":"244016_CR4","doi-asserted-by":"crossref","first-page":"542","DOI":"10.1007\/BF01189993","volume":"11","author":"A. Karlin","year":"1994","unstructured":"A. Karlin, M. Manasse, L. McGeoch, and S. Owicki, \"Competitive randomized algorithms for nonuniform problems,\" Algorithmica, vol. 11, no. 6, pp. 542\u2013571, 1994.","journal-title":"Algorithmica"},{"key":"244016_CR5","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF01762111","volume":"3","author":"A. Karlin","year":"1988","unstructured":"A. Karlin, M. Manasse, L. Rudolph, and D. Sleator, \"Competitive snoopy caching,\" Algorithmica, vol. 3, no. 1, pp. 79\u2013119, 1988.","journal-title":"Algorithmica"},{"key":"244016_CR6","doi-asserted-by":"crossref","first-page":"205","DOI":"10.15807\/jorsj.22.205","volume":"22","author":"H. Kise","year":"1979","unstructured":"H. Kise, T. Ibaraki, and H. Mine, \"Performance analysis of six approximation algorithms for the one-machine maximum lateness scheduling problem with ready times,\" Journal of the Operations Research Society of Japan, vol. 22, pp. 205\u2013224, 1979.","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"244016_CR7","doi-asserted-by":"crossref","unstructured":"J. Sgall, \"On-line scheduling,\" in On-Line Algorithms-The State of the Art, Lecture Notes in Computer Science, A. Fiat and G. Woeginger (Eds.), Springer-Verlag, 1998, ch. 9.","DOI":"10.1007\/BFb0029570"},{"key":"244016_CR8","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D. Sleator","year":"1985","unstructured":"D. Sleator and R. Tarjan, \"Amortized efficiency of list update and paging rules,\" Communications of the ACM, vol. 28, no. 2, pp. 202\u2013208, Feb. 1985.","journal-title":"Communications of the ACM"},{"key":"244016_CR9","unstructured":"L. Stougie and A.P.A. Vestjens, \"Randomized on-line scheduling: How low can't you go?\" Manuscript, 1997."},{"key":"244016_CR10","volume-title":"On-line Machine Scheduling","author":"A.P.A. Vestjens","year":"1997","unstructured":"A.P.A. Vestjens, \"On-line Machine Scheduling,\" PhD Thesis, Eindhoven University of Technology, The Netherlands, 1997."}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009875403874.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009875403874\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009875403874.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:14:13Z","timestamp":1751282053000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009875403874"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,12]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1999,12]]}},"alternative-id":["244016"],"URL":"https:\/\/doi.org\/10.1023\/a:1009875403874","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[1999,12]]}}}