{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T08:10:08Z","timestamp":1737360608533,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424871"},{"type":"electronic","value":"9783540446699"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44669-9_54","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T10:32:26Z","timestamp":1186741946000},"page":"472-482","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Online Flow Time with Resource Augmentation"],"prefix":"10.1007","author":[{"given":"Leah","family":"Epstein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rob","family":"van Stee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,8,2]]},"reference":[{"key":"54_CR1","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, Y. Azar, S. Leonardi, and O. Regev. Minimizing the flow time without migration. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pages 198\u2013205, 1999.","DOI":"10.1145\/301250.301304"},{"key":"54_CR2","unstructured":"A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998."},{"key":"54_CR3","doi-asserted-by":"publisher","first-page":"1497","DOI":"10.1109\/32.58762","volume":"15","author":"M. L. Dertouzos","year":"1989","unstructured":"M. L. Dertouzos and A. K.-L. Mok. Multiprocessor on-line scheduling of hard-realtime tasks. IEEE Transactions on Software Engineering, 15:1497\u20131506, 1989.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"54_CR4","doi-asserted-by":"crossref","unstructured":"A. Goel, M. R. Henzinger, S. Plotkin and E. Tardos. Scheduling Data Transfers in a Network and the Set Scheduling Problem. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing, 1999.","DOI":"10.1145\/301250.301300"},{"key":"54_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1007\/3-540-61310-2_30","volume-title":"Proc. 5th Int. Conf. Integer Programming and Combinatorial Optimization","author":"J.A. Hoogeveen","year":"1996","unstructured":"J.A. Hoogeveen and A.P.A. Vestjens. Optimal on-line algorithms for single-machine scheduling. In Proc. 5th Int. Conf. Integer Programming and Combinatorial Optimization, LNCS, pages 404\u2013414. Springer, 1996."},{"key":"54_CR6","doi-asserted-by":"crossref","unstructured":"B. Kalyanasundaram and K. Pruhs. Speed is as powerful as clairvoyance. In Proceedings of 36th IEEE Symposium on Foundations of Computer Science, pages 214\u2013221, 1995.","DOI":"10.1109\/SFCS.1995.492478"},{"key":"54_CR7","doi-asserted-by":"crossref","unstructured":"H. Kellerer, T. Tautenhahn, and G.J. Woeginger. Approximability and nonapproximability results for minimizing total flow time on a single machine. In Proc. 28th ACM Symposium on the Theory of Computing, pages 418\u2013426, 1996.","DOI":"10.1145\/237814.237989"},{"key":"54_CR8","doi-asserted-by":"crossref","unstructured":"S. Leonardi and D. Raz. Approximating total flow time on parallel machines. In Proc. 29th ACM Symposium on the Theory of Computing, pages 110\u2013119, 1997.","DOI":"10.1145\/258533.258562"},{"key":"54_CR9","doi-asserted-by":"crossref","unstructured":"Cynthia A. Philips, Cliff Stein, Eric Torng, and Joel Wein. Optimal time-critical scheduling via resource augmentation. In Proceedings of the 29th ACM Symposium on Theory of Computing, pages 140\u2013149, 1997.","DOI":"10.1145\/258533.258570"},{"key":"54_CR10","unstructured":"A.P.A. Vestjens. On-line Machine Scheduling PhD thesis, Technical University Eindhoven, 1997."},{"key":"54_CR11","unstructured":"A. C. Yao. Probabilistic computations: Towards a unified measure of complexity. In Proc. 12th ACM Symposium on Theory of Computing, 1980."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44669-9_54","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T07:28:18Z","timestamp":1737358098000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44669-9_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424871","9783540446699"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-44669-9_54","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}