{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T13:04:16Z","timestamp":1751634256818},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540646822"},{"type":"electronic","value":"9783540691068"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0054373","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T03:43:28Z","timestamp":1149651808000},"page":"255-263","source":"Crossref","is-referenced-by-count":5,"title":["Speed is more powerful than clairvoyance"],"prefix":"10.1007","author":[{"given":"Piotr","family":"Berman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chris","family":"Coulston","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,26]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"S. Albers, Better bounds for online scheduling, STOC (1997), 130\u2013139.","DOI":"10.1145\/258533.258566"},{"key":"24_CR2","first-page":"521","volume-title":"Approximation Algorithms for NP Hard Problems","author":"S. Irani","year":"1997","unstructured":"S. Irani and A. Karlin, Online Computation, in D. Hochbaum (ed.), Approximation Algorithms for NP Hard Problems, PWS Publishing, Boston MA, 1997, 521\u2013563."},{"key":"24_CR3","unstructured":"B. Kalyanasundaram and K. Pruhs Speed is as powerful as clairvoyance, FOCS (1995), 214\u2013221."},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"T. Matsumoto, Competitive analysis of the round robin algorithm, International Symposium on Algorithms and Computation (1992), 71\u201377.","DOI":"10.1007\/3-540-56279-6_59"},{"key":"24_CR5","unstructured":"R. Motwani, S. Phillips and E. Torng, Non-clairvoyant scheduling, SODA (1993), 422\u2013431."},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"C. Phillips, C. Stein, E. Torng and J. Wein, Optimal time-critical scheduling via resource augmentation, STOC (1997), 140\u2013149.","DOI":"10.1145\/258533.258570"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"W. Smith, Various optimizers for single-stage production, Naval Research Logistics Quarterly (1956), 59\u201366.","DOI":"10.1002\/nav.3800030106"},{"key":"24_CR8","volume-title":"Operating Systems","author":"A. Tannenbaum","year":"1997","unstructured":"A. Tannenbaum and A. Woodhull, Operating Systems, Prentice Hall, New Jersey, 1997."}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2014 SWAT'98"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0054373","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T02:46:43Z","timestamp":1555642003000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0054373"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540646822","9783540691068"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/bfb0054373","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}