{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:19:20Z","timestamp":1759637960192},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540633075"},{"type":"electronic","value":"9783540694229"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63307-3_61","type":"book-chapter","created":{"date-parts":[[2010,4,5]],"date-time":"2010-04-05T15:22:48Z","timestamp":1270480968000},"page":"210-223","source":"Crossref","is-referenced-by-count":9,"title":["Randomized algorithms for that ancient scheduling problem"],"prefix":"10.1007","author":[{"given":"Steve","family":"Seiden","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,7,30]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Albers, S. Better bounds for online scheduling. In Proc. 29th ACM Symposium on Theory of Computing (STOC) (1997), pp. 130\u2013139.","DOI":"10.1145\/258533.258566"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Bartal, Y., Fiat, A., Karloff, H., AND Vohra, R. New algorithms for an ancient scheduling problem. In Proceedings of the Twenty-Fourth Annual ACM Symposium on the Theory of Computing (May 1992), pp. 51\u201358.","DOI":"10.1145\/129712.129718"},{"issue":"3","key":"19_CR3","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1006\/jcss.1995.1074","volume":"51","author":"Y. Bartal","year":"Dec 1995","unstructured":"Bartal, Y., Fiat, A., Karloff, H., and Vohra, R. New algorithms for an ancient scheduling problem. Journal of Computer and System Sciences 51, 3 (Dec 1995), 359\u2013366.","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"19_CR4","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0020-0190(94)00026-3","volume":"50","author":"Y. Bartal","year":"May 1994","unstructured":"Bartal, Y., Karloff, H., and Rabani, Y. A better lower bound for on-line scheduling. Information Processing Letters 50, 3 (May 1994), 113\u2013116.","journal-title":"Information Processing Letters"},{"issue":"5","key":"19_CR5","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0020-0190(94)00110-3","volume":"51","author":"B. Chen","year":"September 1994","unstructured":"Chen, B., van Vliet, A., and Woeginger, G. A lower bound for randomized on-line scheduling algorithms. Information Processing Letters 51, 5 (September 1994), 219\u201322.","journal-title":"Information Processing Letters"},{"issue":"4","key":"19_CR6","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0167-6377(94)90071-X","volume":"16","author":"B. Chen","year":"November 1994","unstructured":"Chen, B., van Vliet, A., and Woeginger, G. New lower and upper bounds for on-line scheduling. Operations Research Letters 16, 4 (November 1994), 221\u2013230.","journal-title":"Operations Research Letters"},{"issue":"2","key":"19_CR7","first-page":"107","volume":"9","author":"U. Faigle","year":"1989","unstructured":"Faigle, U., Kern, W., and Tur\u00e0n, G. On the performance of on-line algorithms for partition problems. Acta Cybernetica 9, 2 (1989), 107\u201319.","journal-title":"Acta Cybernetica"},{"issue":"2","key":"19_CR8","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1137\/0222026","volume":"22","author":"G. Galambos","year":"April 1993","unstructured":"Galambos, G., and Woeginger, G. An online scheduling heuristic with better worst case ratio than Graham's list scheduling. SIAM Journal on Computing 22, 2 (April 1993), 349\u2013355.","journal-title":"SIAM Journal on Computing"},{"key":"19_CR9","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"R. Graham","year":"1966","unstructured":"Graham, R. Bounds for certain multiprocessing anomalies. Bell Systems Technical Journal 45 (1966), 1563\u20131581.","journal-title":"Bell Systems Technical Journal"},{"key":"19_CR10","unstructured":"Karger, D., Phillips, S., and Torng, E. A better algorithm for an ancient scheduling problem. In Proc. 5th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (1994), pp. 132\u2013140."},{"issue":"2","key":"19_CR11","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1006\/jagm.1996.0019","volume":"20","author":"D. Karger","year":"March 1996","unstructured":"Karger, D., Phillips, S., and Torng, E. A better algorithm for an ancient scheduling problem. Journal of Algorithms 20, 2 (March 1996), 400\u2013430.","journal-title":"Journal of Algorithms"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Sgall, J.On-Line Scheduling on Parallel Machines. PhD thesis, Carnegie-Mellon University, 1994.","DOI":"10.1007\/3-540-58338-6_65"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63307-3_61","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T14:23:47Z","timestamp":1685543027000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63307-3_61"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540633075","9783540694229"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-63307-3_61","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}